Decoding beyond the BCH bound (Corresp.)
Carlos R. P. Hartmann · IEEE Transactions on Information Theory · 1972
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.