New decoding algorithm for a class of simple iterated codes–its application to decoding algorithm for reed‐muller codes
Kin‐ichiroh Tokiwa, Nasao Kasahara, Toshihiko Namekawa · Electronics and Communications in Japan (Part I Communications) · 1984
Abstract Recently, for the improvement of reliability of digital communication systems, various kinds of error‐correcting codes are being used. to improve system reliability through the use of more capable error‐correcting codes it is extremely important to simplify the decoder construction and to reduce the decoding delay. This paper studies a decoding algorithm for a class of simple iterated codes (SI codes) constructed by simply repeating I times a codeword (called block) in a given code (called subcode). Moreover, this paper discusses the decoding delay when this decoding algorithm is applied to decoding the Reed‐Muller codes constructed by the superimposing method.