Two-dimensional burst-correcting codes

Moshe Schwartz, Tuvi Etzion

Research output: Contribution to journalConference articlepeer-review


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 languageEnglish
Pages (from-to)397
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - 20 Oct 2004
Externally publishedYes
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: 27 Jun 20042 Jul 2004

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics


Dive into the research topics of 'Two-dimensional burst-correcting codes'. Together they form a unique fingerprint.

Cite this