Title :
Two-dimensional burst-correcting codes
Author :
Schwartz, Moshe ; Etzion, Tuvi
Author_Institution :
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa
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
Keywords :
error correction codes; graph theory; parity check codes; Reiger bound; error-correcting code; hexagonal graph; two-dimensional burst-correcting code; Computer errors; Computer science; Error correction codes; Linear code; Parity check codes; Redundancy; Shape;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Conference_Location :
Chicago, IL
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365434
