2006/09/29 by Maria Bras-Amorós, Bras-Amorós, Maria, Michael E. O'Sullivan +1
Computer Science · Mathematics · #Discrete Mathematics (cs.DM) #E.4 #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.DM #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.cs/0609160
arxiv created 2006/09/29 · arxiv updated 2009/12/01
This article is focused on some variations of Reed-Muller codes that yield improvements to the rate for a prescribed decoding performance under the Berlekamp-Massey-Sakata algorithm with majority voting. Explicit formulas for the redundancies of the new codes are given.