Abstract
We consider two-dimensional error-correcting codes capable of correcting unrestricted bursts of size b. We construct optimal 2-burst-correcting codes in three connectivity models: the rectangular grid with 4 or 8 neighbors, and the hexagonal graph. We also give optimal, or nearly optimal. 2-burst-correcting codes in all dimensions. We then construct 3-burst-correcting codes with 3 redundancy bits above the sphere-packing bound, followed by b-straight-burst-correcting codes with b - 2 redundancy bits above the sphere-packing bound. We conclude by improving the Reiger bound for two-dimensional unrestricted-burst-correcting codes.
| Original language | English |
|---|---|
| Pages (from-to) | 397 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| State | Published - 20 Oct 2004 |
| Externally published | Yes |
| Event | Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: 27 Jun 2004 → 2 Jul 2004 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics