Algebraic decoding of the (41, 21, 9) Quadratic Residue code
Information Sciences: an International Journal
A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
Designs, Codes and Cryptography
| Hi-index | 754.84 |
A general decoding method for linear codes is investigated for cyclic codes. The decoding consists of solving two systems of linear equations. All but four binary cyclic codes of length less than 63 can so be decoded up to their actual distance. A new family of codes is given for which the decoding needs only O(n2) operations