Improvement on decoding of the (71, 36, 11) quadratic residue code

In this paper, a fast algebraic decoding algorithm (ADA) is proposed to correct all patterns of five errors or less in the binary systematic (71, 36, 11) quadratic residue (QR) code. The method is based on the modification of the ADAs developed by Reed et al and Lin et al. The new conditions and the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2011 6th International Conference on Computer Science and Education S. 324 - 329
Hauptverfasser: Hung-Peng Lee, Hsin-Chiu Chang
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.08.2011
Schlagworte:
algebraic decoding algorithm
Computers
Decoding
error-locator polynomial
Indexes
Polynomials
quadratic residue code
Search methods
Silicon
syndrome
Systematics
ISBN:1424497175, 9781424497171
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, a fast algebraic decoding algorithm (ADA) is proposed to correct all patterns of five errors or less in the binary systematic (71, 36, 11) quadratic residue (QR) code. The method is based on the modification of the ADAs developed by Reed et al and Lin et al. The new conditions and the error-locator polynomials for decoding this code will be derived. Besides, a computer search shows that the minimum degree of the unknown syndrome polynomial f(S 7 ) in the five-error case is 2. Hence, the computational complexity can be reduced in finite field. Simulation result shows that the average decoding time of the proposed ADA is superior to the ADA given by Chang et al.
ISBN:1424497175
9781424497171
DOI:10.1109/ICCSE.2011.6028645