C. Hartmann
Abstract
In this correspondence, a decoding algorithm to decode beyond the BCH bound is introduced. It gives a complete minimum distance decoding for any cyclic code. A comparison between this decoding algorithm and previously existing ones is also given.
OpenAlex reports 43 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this correspondence, a decoding algorithm to decode beyond the BCH bound is introduced. It gives a complete minimum distance decoding for any cyclic code. A comparison between this decoding algorithm and previously existing ones is also given.
Key concepts: BCH code, Decoding methods, Berlekamp–Welch algorithm, List decoding, Computer science, Sequential decoding, Upper and lower bounds, Code (set theory)