Optimal codes for correcting a single (wrap-around) burst of errors
In 2007, Martinian and Trott presented codes for correcting a burst of erasures with a minimum decoding delay. Their construction employs [n,k] codes that can correct any burst of erasures (including wrap-around bursts) of length n-k. The raised the question if such [n,k] codes exist for all integer...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | In 2007, Martinian and Trott presented codes for correcting a burst of
erasures with a minimum decoding delay. Their construction employs [n,k] codes
that can correct any burst of erasures (including wrap-around bursts) of length
n-k. The raised the question if such [n,k] codes exist for all integers k and n
with 1 |
|---|---|
| DOI: | 10.48550/arxiv.0712.2182 |