An Efficient Algorithm for Searching Optimal Shortened Cyclic Single-Burst-Correcting Codes

An Efficient Algorithm for Searching Optimal Shortened Cyclic Single-Burst-Correcting Codes

An efficient algorithm searching for the best (shortened) cyclic burst-correcting codes is presented. The efficiency of the algorithm stems from the fact that no repeated syndromes are computed. It is shown how to achieve this goal by using Gray codes.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE communications letters 2012-01, Vol.16 (1), p.89-91
Hauptverfasser: Villalba, L. J. G., Cortez, J. R. F., Orozco, A. L. S., Blaum, M.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
all-around (AA) bursts
Applied sciences
Binary codes
burst errors
Bursting
Coding, codes
Computation
cyclic bursts
cyclic codes
Decoding
Error-correcting codes
Exact sciences and technology
Fires
Generators
Information, signal and communications theory
optimal burst-correcting codes
Optimization
Polynomials
Reflective binary codes
Searching
shortened cyclic codes
Signal and communications theory
single burst-correcting codes
Stems
Systematics
Telecommunications and information theory
Vectors
wrap-around bursts
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:An efficient algorithm searching for the best (shortened) cyclic burst-correcting codes is presented. The efficiency of the algorithm stems from the fact that no repeated syndromes are computed. It is shown how to achieve this goal by using Gray codes.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2011.111011.112186