Two-dimensional cluster-correcting codes

Authors:
M. Schwartz;T. Etzion
Affiliations:
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel;-
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 2

MacWilliams identity for codes with the rank metric

EURASIP Journal on Wireless Communications and Networking - Advances in Error Control Coding Techniques
Error-correction of multidimensional bursts

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.90

Visualization

Abstract

We consider two-dimensional error-correcting codes capable of correcting a single arbitrary cluster of errors of size b. We provide optimal 2-cluster-correcting codes in several connectivity models, as well as optimal, or nearly optimal, 2-cluster-correcting codes in all dimensions. We also construct 3-cluster-correcting codes and b-straight-cluster-correcting codes. We conclude by improving the Reiger bound for two-dimensional cluster-correcting codes.