On some batch code properties of the simplex code

DOI10.1007/S10623-022-01173-6arXiv2110.07421MaRDI QIDQ6380342FDOQ6380342

Vitaly Skachek, Henk D. L. Hollmann, Ago-Erik Riet, Karan Khathuria

Publication date: 14 October 2021

Abstract: 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.

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Other types of codes (94B60) Finite abelian groups (20K01)

This page was built for publication: On some batch code properties of the simplex code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6380342)