DocumentCode :
2112114
Title :
Fast algebraic decoding of the (17, 9, 5) 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 :
1812
Lastpage :
1815
Abstract :
A fast algebraic decoding algorithm is proposed to correct all patterns of two or fewer errors in the binary (17, 9, 5) quadratic residue (QR) code. Computer simulations show that the average decoding time of the proposed decoding algorithm is about 2.88 times less execution time than the D3 algebraic decoding algorithm of Chang et al.
Keywords :
algebraic codes; binary codes; decoding; residue codes; D3 algebraic decoding algorithm; QR code; binary code; computer simulation; fast algebraic decoding algorithm; quadratic residue code; Algorithm design and analysis; Decoding; Encoding; Polynomials; Silicon; Software algorithms; 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.6201457
Filename :
6201457
Link To Document :
بازگشت