Batch codes from affine Cartesian codes and quotient spaces
From MaRDI portal
Publication:2149781
DOI10.1007/978-3-030-92641-0_1zbMATH Open1495.94100arXiv2005.07577OpenAlexW3025166389MaRDI QIDQ2149781FDOQ2149781
Authors: Travis Alan Baumbaugh, Haley Colgate, Tim Jackman, Felice Manganiello 
Publication date: 29 June 2022
Abstract: Affine Cartesian codes are defined by evaluating multivariate polynomials at a cartesian product of finite subsets of a finite field. In this work we examine properties of these codes as batch codes. We consider the recovery sets to be defined by points aligned on a specific direction and the buckets to be derived from cosets of a subspace of the ambient space of the evaluation points. We are able to prove that under these conditions, an affine Cartesian code is able to satisfy a query of size up to one more than the dimension of the space of the ambient space.
Full work available at URL: https://arxiv.org/abs/2005.07577
Recommendations
Cites Work
- Affine Cartesian codes
- Generalized Hamming weights of q-ary Reed-Muller codes
- Combinatorial batch codes: a lower bound and optimal constructions
- Generalized Hamming weights of affine Cartesian codes
- Affine Cartesian codes with complementary duals
- Combinatorial batch codes
- Optimal combinatorial batch codes derived from dual systems
- Batch codes and their applications
- Optimal combinatorial batch codes based on block designs
- Constructions and bounds for batch codes with small parameters
- 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
Cited In (2)
This page was built for publication: Batch codes from affine Cartesian codes and quotient spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2149781)
