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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
