IEEE International Symposium on Information Theory (ISIT)
Multi-Step Structure of Reed-Muller Codes
Junyu Ren, Guanghui Wang, Guiying Yan
Abstract
Currently, many low-complexity decoding algorithms for Reed-Muller (RM) codes utilize the Plotkin structure of RM codes to decompose them into shorter RM subcodes for decoding. This study reveals a key relationship among RM subcodes, demonstrating that specific subcodes can generate all subcodes. Furthermore, we identify conditions where subcodes are inherently free of 4-cycles and 6-cycles structures. Building upon these insights, we modified existing well-known algorithms for RM codes, achieving similar error-correction performance with significantly lower complexity by requiring fewer subcode decodings.