On some batch code properties of the simplex code
From MaRDI portal
Publication:2701478
DOI10.1007/s10623-022-01173-6OpenAlexW3206407066MaRDI QIDQ2701478
Vitaly Skachek, Karan Khathuria, Ago-Erik Riet, Henk D. L. Hollmann
Publication date: 28 April 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.07421
Arithmetic and combinatorial problems involving abstract finite groups (20D60) Finite abelian groups (20K01) Other types of codes (94B60) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Exterior algebras and two conjectures on finite Abelian groups.
- A proof of Snevily's conjecture.
- A combinatorial proof of Dyson's conjecture
- Additive Latin transversals.
- Batch codes and their applications
- Combinatorial Nullstellensatz
- Bounds on the Length of Functional PIR and Batch Codes
- Switch Codes: Codes for Fully Parallel Reconstruction
- A Combinatorial Problem on Abelian Groups
- Transversals of additive Latin squares
- Almost Optimal Construction of Functional Batch Codes Using Extended Simplex Codes
This page was built for publication: On some batch code properties of the simplex code