English

On some batch code properties of the simplex code

Information Theory 2023-01-24 v5 Combinatorics math.IT

Abstract

The binary kk-dimensional simplex code is known to be a 2k12^{k-1}-batch code and is conjectured to be a 2k12^{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.

Keywords

Cite

@article{arxiv.2110.07421,
  title  = {On some batch code properties of the simplex code},
  author = {Henk D. L. Hollmann and Karan Khathuria and Ago-Erik Riet and Vitaly Skachek},
  journal= {arXiv preprint arXiv:2110.07421},
  year   = {2023}
}
R2 v1 2026-06-24T06:53:23.037Z