On some batch code properties of the simplex code

10/14/2021
by   Henk D. L. Hollmann, et al.
0

The binary k-dimensional simplex code is known to be a 2^k-1-batch code and is conjectured to be a 2^k-1-functional batch code. Here, we offer a simple, constructive proof of a result that is "in between" these two properties. Our approach is to relate these properties to certain (old and new) additive problems in finite abelian groups. We also formulate a conjecture for finite abelian groups that generalizes the above-mentioned conjecture.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/05/2018

On the Menezes-Teske-Weng's conjecture

In 2003, Alfred Menezes, Edlyn Teske and Annegret Weng presented a conje...
research
01/27/2023

A proof of the Nisan-Ronen conjecture

Noam Nisan and Amir Ronen conjectured that the best approximation ratio ...
research
07/20/2019

A short proof of a conjecture by Ben-Akiva and Lerman about the nested logit model

We provide a short proof of a result by Cardell (1997) on a conjecture o...
research
12/02/2022

Quantitative bounds for unconditional pairs of frames

We formulate a quantitative finite-dimensional conjecture about frame mu...
research
01/17/2021

Almost Optimal Construction of Functional Batch Codes Using Hadamard Codes

A functional k-batch code of dimension s consists of n servers storing l...
research
09/26/2021

Mixing of 3-term progressions in Quasirandom Groups

In this note, we show the mixing of three-term progressions (x, xg, xg^2...
research
10/21/2020

Is Batch Norm unique? An empirical investigation and prescription to emulate the best properties of common normalizers without batch dependence

We perform an extensive empirical study of the statistical properties of...

Please sign up or login with your details

Forgot password? Click here to reset