Key points are not available for this paper at this time.
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.
López et al. (Mon,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: