Modified decoding of binary quadratic residue codes by using euclidean algorithm

Authors:
Pei-Yu Shih;Wen-Ku Su;Tsung-Ching Lin;Trieu-Kien Truong
Affiliations:
Department of Information Engineering, I-Shou University;Department of Information Engineering, I-Shou University;Department of Information Engineering, I-Shou University;Department of Information Engineering, I-Shou University
Venue:
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
Year:
2009

Citing 3
Cited 0

Algebraic decoding of the (23,12,7) Golay code

IEEE Transactions on Information Theory
Decoding the (47,24,11) quadratic residue code

IEEE Transactions on Information Theory
A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a modified decoding method is proposed for the binary Quadratic Residue (QR) codes. The key ideal behind the proposed method is to apply the properties of remainder decoding and the modified Gao's algorithm. In the decoding method, the main features are efficient to compute syndromes and determine the error-locator polynomial. And the modified Gao's algorithm is also developed in our decoding algorithm.