On decoding BCH codes
G. David Forney · IEEE Transactions on Information Theory · 1965
The Gorenstein-Zierler decoding algorithm for BCH codes is extended, modified, and analyzed; in particular, we show how to correct erasures as well as errors, exhibit improved procedures for finding error and erasure values, and consider in some detail the implementation of these procedures in a special-purpose computer.
Cited by 387 works. doi:10.1109/tit.1965.1053825
Authors
References
- Error Correcting Codes
- On a class of error correcting binary group codes
- Polynomial Codes Over Certain Finite Fields
- Encoding and error-correction procedures for the Bose-Chaudhuri codes
- Codes correcteurs d'erreurs
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
- A Class of Error-Correcting Codes in $p^m $ Symbols
- Computation with finite fields
- Further results on error correcting binary group codes
- An electronic decoder for Bose-Chaudhuri-Hocquenghem error-correcting codes