On some batch code properties of the simplex code

Autor:	Henk D. L. Hollmann, Karan Khathuria, Ago-Erik Riet, Vitaly Skachek
Rok vydání:	2022
Předmět:	FOS: Computer and information sciences Information Theory (cs.IT) Computer Science - Information Theory Applied Mathematics FOS: Mathematics Mathematics - Combinatorics Combinatorics (math.CO) Computer Science Applications
Zdroj:	Designs, Codes and Cryptography. 91:1595-1605
ISSN:	1573-7586 0925-1022
DOI:	10.1007/s10623-022-01173-6
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9e245358f10941198dad9f2f8494365 https://doi.org/10.1007/s10623-022-01173-6 Zobrazit plný text záznamu Full text from SpringerLink