DocumentCode :
2118567
Title :
Study on the algebraic decoding of the (89, 45, 17) quadratic residue code
Author :
Lee, Hung-Peng
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Fortune Inst. of Technol., Kaohsiung, Taiwan
fYear :
2012
fDate :
21-23 April 2012
Firstpage :
2124
Lastpage :
2127
Abstract :
A study on the weight-5 error patterns of the algebraic decoding of the (89, 45, 17) quadratic residue (QR) code with reducible generator polynomial, proposed by Truong et al. (2008), is presented. For the QR codes with irreducible generator polynomial, S1 = 0 means that the received word has no errors. For the (89, 45, 17) QR codes, some weight-5 error patterns will cause a zero value in syndrome S1. However, these weight-5 error patterns do not cause a decoding failure while using the inverse-free Berlekamp-Massey (IFBM) algorithm to determine the error-locator polynomial. An example shows the facts.
Keywords :
algebraic codes; polynomials; quadratic programming; 89 45 17 quadratic residue code; IFBM; algebraic decoding; error locator polynomial; error patterns; generator polynomial; inverse free Berlekamp-Massey; zero value; Algorithm design and analysis; Decoding; Encoding; Generators; Hamming distance; Polynomials; Systematics; algebraic decoding algorithm; error pattern; quadratic residue code; syndrome;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Consumer Electronics, Communications and Networks (CECNet), 2012 2nd International Conference on
Conference_Location :
Yichang
Print_ISBN :
978-1-4577-1414-6
Type :
conf
DOI :
10.1109/CECNet.2012.6201692
Filename :
6201692
Link To Document :
بازگشت