Efficient Shortened Cyclic Codes Correcting Either Random Errors or Bursts

Efficient cyclic or shortened cyclic codes that can correct either up to t errors or a single burst of length up to b, where t

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE communications letters 2011-07, Vol.15 (7), p.749-751
Hauptverfasser:	Villalba, L. J. G., Cortez, J. R. F., Orozco, A. L. S., Blaum, M.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Block codes burst errors burst-correcting codes Bursts Coding, codes Computation Computers Error correction Error correction codes Error-correcting codes Exact sciences and technology Generators Information, signal and communications theory Polynomials Random errors Scholarships Search algorithms shortened cyclic codes Signal and communications theory Systematics Telecommunications and information theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Efficient cyclic or shortened cyclic codes that can correct either up to t errors or a single burst of length up to b, where t
ISSN:	1089-7798 1558-2558
DOI:	10.1109/LCOMM.2011.060111.110338