Batch codes from affine Cartesian codes and quotient spaces

DOI10.1007/978-3-030-92641-0_1zbMath1495.94100arXiv2005.07577OpenAlexW3025166389MaRDI QIDQ2149781

Tim Jackman, Haley Colgate, Travis Alan Baumbaugh, Felice Manganiello

Publication date: 29 June 2022

Full work available at URL: https://arxiv.org/abs/2005.07577

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Unnamed Item
• Combinatorial batch codes: a lower bound and optimal constructions
• Constructions and bounds for batch codes with small parameters
• Generalized Hamming weights of affine Cartesian codes
• Combinatorial batch codes
• Affine Cartesian codes with complementary duals
• Affine Cartesian codes
• Batch codes and their applications
• Generalized Hamming weights of q-ary Reed-Muller codes
• Nearly Optimal Constructions of PIR and Batch Codes
• Lifted Reed-Solomon Codes and Lifted Multiplicity Codes
• Binary Batch Codes With Improved Redundancy
• Batch Codes from Hamming and Reed-M\"uller Codes
• Optimal combinatorial batch codes based on block designs

This page was built for publication: Batch codes from affine Cartesian codes and quotient spaces