A method to reduce the decoding complexity of the binary (89, 45, 17) quadratic residue code

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

Citing 2
Cited 0

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

IEEE Transactions on Information Theory
Algebraic Decoding of the Quadratic Residue Code

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In order to use Berlekamp-Massey algorithm to decode the (89, 45, 17) binary quadratic residue code, one needs to determine two primary unknown syndromes. In this paper, the authors give some syndrome matrices, so as to calculate one primary unknown syndrome efficiently. This results in a reduction of decoding complexity in terms of CPU time by 35% at least versus the decoder proposed by Truong et al.