Decoding the (47,24,11) quadratic residue code
Authors:
- I.S. ReedIRI.S. Reed
- Trieu-Kien TruongTTTrieu-Kien Truong
- Xuemin ChenXCXuemin Chen
- 1 March 2001
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 47 (3) , 1181-1186
Abstract
The techniques needed to decode the (47,24,11) quadratic residue (QR) code differ from the schemes developed for cyclic codes. By finding certain nonlinear relations between the known and unknown syndromes for this special code, two methods are developed to decode up to the true minimum distance of the (47,24,11) QR code. These algorithms can be utilized to decode effectively the 1/2 -rate (48,24,12) QR code for correcting five errors and detecting six errors.Keywords
This publication has 8 references indexed in Scilit:
- Use of Grobner bases to decode binary cyclic codes up to the true minimum distanceIEEE Transactions on Information Theory, 1994
- A new procedure for decoding cyclic and BCH codes up to actual minimum distanceIEEE Transactions on Information Theory, 1994
- Error-locating pairs for cyclic codesIEEE Transactions on Information Theory, 1994
- Decoding the (73, 37, 13) quadratic residue codeIEE Proceedings - Computers and Digital Techniques, 1994
- The algebraic decoding of the (41, 21, 9) quadratic residue codeIEEE Transactions on Information Theory, 1992
- Decoding the (24,12,8) Golay codeIEE Proceedings E Computers and Digital Techniques, 1990
- Algebraic decoding of the (23,12,7) Golay code (Corresp.)IEEE Transactions on Information Theory, 1987
- The Theory of Error-Correcting Codes1977