Abstract

It is shown that in the rth order binary Reed-Muller code of length N = 2m and minimum distance d = 2m−r, the only code-words having weight between d and 2d are those with weights of the form 2d - 2i for some i. The same result also holds for certain supercodes of the RM codes.

Full Text
Published version (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