2014/11/13 by Stéphanie Dib, Dib, Stéphanie, François Rodier +1
Computer Science · Mathematics · #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Number Theory (math.NT) #cs.IT #math.IT #math.NT
paper · pdf · doi:10.48550/arxiv.1411.3545
arxiv created 2015/02/02 · arxiv updated 2015/02/03
We present an asymptotic limit between correctable and uncor-rectable errors on the Reed-Muller codes of any order. This limit is theoretical and does not depend of any decoding algorithm.