Constructions and bounds for batch codes with small parameters

DOI10.1007/978-3-319-66278-7_24MaRDI QIDQ1705537zbMATH OpenOpenAlexFDO

Authors Eldho K. Thomas, Vitaly Skachek

Publication date 16 March 2018

Full work available at URL https://doi.org/10.1007/978-3-319-66278-7_24

zbMATH Keywords

locally repairable codesprivate information retrievalbatch codesdistributed data storagePIR codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Combinatorial batch codes: a lower bound and optimal constructions
• Nearly Optimal Constructions of PIR and Batch Codes
• Derandomized construction of combinatorial batch codes
• Combinatorial batch codes: extremal problems under Hall-type conditions
• scientific article; zbMATH DE number 6761156
• On erasure combinatorial batch codes
• Linear programming bounds for codes of small size
• Optimal combinatorial batch codes based on block designs
• Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
• Small-bias sets from extended norm-trace codes

Cited in

(3)

• Batch codes from affine Cartesian codes and quotient spaces
• Optimal possibly nonlinear 3-PIR codes of small size
• Batch codes from Hamming and Reed-Muller codes

This page was built for publication: Constructions and bounds for batch codes with small parameters

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