Batch codes from Hamming and Reed-Muller codes
From MaRDI portal
Publication:5241179
Abstract: Batch codes, introduced by Ishai et al. encode a string into an -tuple of strings, called buckets. In this paper we consider multiset batch codes wherein a set of -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.
Recommendations
Cites work
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Batch codes and their applications
- Binary Linear Locally Repairable Codes
- Combinatorial batch codes
- Combinatorial batch codes: a lower bound and optimal constructions
- Constructions and bounds for batch codes with small parameters
- Linear batch codes
- Optimal combinatorial batch codes based on block designs
- Optimal combinatorial batch codes derived from dual systems
Cited in
(3)
This page was built for publication: Batch codes from Hamming and Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241179)
