Decoding the (47,24,11) quadratic residue code

Authors:
Ruhua He;I. S. Reed;Trieu-Kien Truong;Xuemin Chen
Affiliations:
Hughes Network Syst., San Diego, CA;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 12

A Lookup Table Decoding of systematic (47,24,11) quadratic residue code

Information Sciences: an International Journal
Algebraic decoding of the (41, 21, 9) Quadratic Residue code

Information Sciences: an International Journal
Decoding the ternary (23, 11, 9) quadratic residue code

Research Letters in Communications
On the decoding of binary cyclic codes with the Newton identities

Journal of Symbolic Computation
Decoding the (47,24,11) quadratic residue code using bit-error probability estimates

IEEE Transactions on Communications
Modified decoding of binary quadratic residue codes by using euclidean algorithm

ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
A method to reduce the decoding complexity of the binary (89, 45, 17) quadratic residue code

ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 2
Decoding golay code by direct solution of the error locator polynomial

ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 2
Syndrome-weight decoder for general binary quadratic residue codes

ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Algebraic decoding of a class of binary cyclic codes via Lagrange interpolation formula

IEEE Transactions on Information Theory
High speed decoding of the binary (47,24,11) quadratic residue code

Information Sciences: an International Journal
A cyclic weight algorithm of decoding the (47,24,11) quadratic residue code

Information Sciences: an International Journal

Quantified Score

Hi-index	754.90

Visualization

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 ½-rate (48,24,12) QR code for correcting five errors and detecting six errors