Augmented Reed-Muller Codes of High Rate and Erasure Repair
Hiram H. López, Gretchen L. Matthews, Daniel Valvo
Abstract
Hiram H. López, Gretchen L. Matthews, Daniel Valvo
Abstract
We present two families of augmented Reed-Muller (ARM) codes, which are evaluation codes obtained by adding specific vectors to a Reed-Muller code. We develop exact repair schemes for single erasures for these ARM codes. When a dimension and a base field are fixed, we give examples where ARM codes provide a lower bandwidth in comparison with Reed-Solomon codes. We analyze the asymptotical behavior when ARM codes achieve the maximum rate.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We present two families of augmented Reed-Muller (ARM) codes, which are evaluation codes obtained by adding specific vectors to a Reed-Muller code. We develop exact repair schemes for single erasures for these ARM codes. When a dimension and a base field are fixed, we give examples where ARM codes provide a lower bandwidth in comparison with Reed-Solomon codes. We analyze the asymptotical behavior when ARM codes achieve the maximum rate.
Key concepts: Reed–Solomon error correction, Reed–Muller code, Tornado code, Erasure code, Raptor code, Computer science, Luby transform code, Online codes