Minimum-redundancy codes for correcting a single (wrap-around) burst of erasures

Minimum-redundancy codes for correcting a single (wrap-around) burst of erasures

We give recursive constructions, valid for any field, of [n,k] codes capable of correcting a (wrap-around) burst of n - k erasures.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Hollmann, H.D.L., Tolhuizen, L.M.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Construction industry
Electronic mail
Equations
Generators
Linear code
Parity check codes
Terminology
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We give recursive constructions, valid for any field, of [n,k] codes capable of correcting a (wrap-around) burst of n - k erasures.
ISSN:2157-8095
2157-8117
DOI:10.1109/ISIT.2008.4595147