2016/01/27 by Harinaivo Andriatahiny, Andriatahiny, Harinaivo
Computer Science · Mathematics · Social Sciences · #12E05 #16N40 #94B05 #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Islamic Finance and Communication #cs.IT #math.IT #msc:12E05 #msc:16N40 #msc:94B05
paper · pdf · doi:10.48550/arxiv.1601.07633
openalex publication_date 2016/01/27 · arxiv created 2016/01/28 · arxiv updated 2016/01/29 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28
First, a new proof of Berman and Charpin's characterization of the Reed-Muller codes over the binary field or over an arbitrary prime field is presented. These codes are considered as the powers of the radical of a modular algebra. Secondly, the same method is used for the study of the Generalized Reed-Muller codes over a non prime field.