Array codes correcting a two-dimensional cluster of errors

DOI10.1109/18.705587MaRDI QIDQ4701182zbMATH OpenOpenAlexFDO

Authors M. Breitbach, V. R. Sidorenko, Martin Bossert, V. V. Zyablov

Publication date 21 November 1999

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.705587

zbMATH Keywords

array codesconstructiongeneralized Singleton boundHamming boundtwo-dimensional cluster correcting codes

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Burst-correcting codes (94B20) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Two-Dimensional Cluster-Correcting Codes
• Codes correcting a set of clusters of errors or erasures.
• Two-dimensional array codes correcting rectangular burst errors
• A Class of Two-Dimensional Cluster-Correcting Codes Based on Schwartz–Etzion's Construction Methods
• Correction of 2-dimensional occasional and cluster errors in LRTJ-spaces.

Cited in

(11)

• Interleaving schemes on circulant graphs with two offsets
• Codes correcting a set of clusters of errors or erasures.
• Controlling and restoring the integrity of multi-dimensional data arrays through cryptocode constructs
• Existence of a folding in multidimensional coding
• Weakly biased arrays, almost independent arrays and error-correcting codes
• Correction of 2-dimensional occasional and cluster errors in LRTJ-spaces.
• Two-Dimensional Cluster-Correcting Codes
• A Class of Two-Dimensional Cluster-Correcting Codes Based on Schwartz–Etzion's Construction Methods
• Two-dimensional array codes correcting rectangular burst errors
• MDS array codes for correcting a single criss-cross error
• Constructions of covering sequences and 2D-sequences

This page was built for publication: Array codes correcting a two-dimensional cluster of errors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701182)