1982•IEEE Transactions on Information TheoryRequires access

New decoding algorithm for Reed - Muller codes (Corresp.)

Kin‐ichiroh Tokiwa, Tatsuo Sugimura, M. Kasahara, T. Namekawa

Abstract

We interpret Reed-Muller codes in terms of superimposition and present a new decoding algorithm for Reed-Muller codes. Before presenting this algorithm, we propose a decoding algorithm for a class of simple iterated codes (SI codes) that will play an important role in our new decoding algorithm. Finally, we compare our algorithm with the conventional algorithm for the cyclic Reed-Muller codes from the standpoint of decoding delay.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Berlekamp–Welch algorithm, List decoding, Sequential decoding, Decoding methods, Algorithm, Reed–Muller code, Computer science, BCJR algorithm