Batch Codes from Hamming and Reed-M\"uller Codes

zbMATH Open1428.14043arXiv1710.07386MaRDI QIDQ5241179FDOQ5241179

Sophia Friesenhahn, Yariana Diaz, Travis Alan Baumbaugh, Alexander Vetter, Felice Manganiello

Publication date: 30 October 2019

Abstract: Batch codes, introduced by Ishai et al. encode a string $xinSigm{a}^k$ into an $m$-tuple of strings, called buckets. In this paper we consider multiset batch codes wherein a set of $t$-users wish to access one bit of information each from the original string. We introduce a concept of optimal batch codes. We first show that binary Hamming codes are optimal batch codes. The main body of this work provides batch properties of Reed-M"uller codes. We look at locality and availability properties of first order Reed-M"uller codes over any finite field. We then show that binary first order Reed-M"uller codes are optimal batch codes when the number of users is 4 and generalize our study to the family of binary Reed-M"uller codes which have order less than half their length.

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

zbMATH Keywords

Reed-Muller codesHamming codesbatch codesrecovery codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorial batch codes: a lower bound and optimal constructions
• Combinatorial batch codes
• Batch codes and their applications
• Optimal combinatorial batch codes based on block designs
• Constructions and bounds for batch codes with small parameters
• Binary Linear Locally Repairable Codes
• Linear Batch Codes

Cited In (2)

• Batch codes and their applications
• Batch codes from affine Cartesian codes and quotient spaces

This page was built for publication: Batch Codes from Hamming and Reed-M\"uller Codes

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