Bounds and Codes for General Phased Burst Errors
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916586295656448 |
|---|---|
| author | Bitzer, Sebastian Di Giusto, Andrea Ravagnani, Alberto Yaakobi, Eitan |
| author_facet | Bitzer, Sebastian Di Giusto, Andrea Ravagnani, Alberto Yaakobi, Eitan |
| contents | Phased burst errors (PBEs) are bursts of errors occurring at one or more known locations. The correction of PBEs is a classical topic in coding theory, with prominent applications such as the design of array codes for memory systems or distributed storage. We propose a general yet fine-grained approach to this problem, accounting not only for the number of bursts but also the error structure in each burst. By modeling PBEs as an error set in an adversarial channel, we investigate bounds on the maximal size of codes that can correct them. The PBE-correction capability of generalized concatenated codes is analyzed, and asymptotically good PBE-correcting codes are constructed, recovering a classical construction in a specific problem instance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_12280 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Bounds and Codes for General Phased Burst Errors Bitzer, Sebastian Di Giusto, Andrea Ravagnani, Alberto Yaakobi, Eitan Information Theory Phased burst errors (PBEs) are bursts of errors occurring at one or more known locations. The correction of PBEs is a classical topic in coding theory, with prominent applications such as the design of array codes for memory systems or distributed storage. We propose a general yet fine-grained approach to this problem, accounting not only for the number of bursts but also the error structure in each burst. By modeling PBEs as an error set in an adversarial channel, we investigate bounds on the maximal size of codes that can correct them. The PBE-correction capability of generalized concatenated codes is analyzed, and asymptotically good PBE-correcting codes are constructed, recovering a classical construction in a specific problem instance. |
| title | Bounds and Codes for General Phased Burst Errors |
| topic | Information Theory |
| url | https://arxiv.org/abs/2501.12280 |