Algebraic decoding of the binary systematic (71, 36, 11) quadratic residue code

A fast and efficient algebraic decoding algorithm (ADA) is proposed to correct up to five possible error patterns in the binary systematic (71, 36, 11) quadratic residue (QR) code. The technique required here is based on the ADA developed by He et al. [2001. Decoding the (47, 24, 11) quadratic resid...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of the Chinese Institute of Engineers Jg. 36; H. 3; S. 399 - 404
Hauptverfasser:	Lee, Hung-Peng, Chang, Hsin-Chiu, Chu, Shao-I
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Taylor & Francis Group 01.04.2013
Schlagworte:	algebraic decoding algorithm quadratic residue code syndrome
ISSN:	0253-3839, 2158-7299
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	A fast and efficient algebraic decoding algorithm (ADA) is proposed to correct up to five possible error patterns in the binary systematic (71, 36, 11) quadratic residue (QR) code. The technique required here is based on the ADA developed by He et al. [2001. Decoding the (47, 24, 11) quadratic residue code. IEEE transactions on information theory, 47 (3), 1181-1186.] and the modification of the ADA developed by Lin et al. [2010. Decoding of the (31, 16, 7) quadratic residue code. Journal of the Chinese institute of engineers, 33 (4), 573-580; 2010. High speed decoding of the binary (47, 24, 11) quadratic residue code. Information sciences, 180 (20), 4060-4068]. The new proposed conditions and the error-locator polynomials for different numbers of errors in the received word are derived. Simulation results show that the decoding speed of the proposed ADA is faster than the other existing ADAs.
ISSN:	0253-3839 2158-7299
DOI:	10.1080/02533839.2012.730259