Two-Dimensional Cluster-Correcting Codes

DOI10.1109/TIT.2005.847726MaRDI QIDQ3547599zbMATH OpenDBLPWikidataFDO

Authors Moshe Schwartz, Tuvi Etzion

Publication date 21 December 2008

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Array codes correcting a two-dimensional cluster of errors
• A Class of Two-Dimensional Cluster-Correcting Codes Based on Schwartz–Etzion's Construction Methods
• Error-correcting two-dimensional modulation codes
• Clustering-Correcting Codes
• Two-dimensional array codes correcting rectangular burst errors
• Codes that correct two-dimensional burst errors
• LDPC Codes for 2D Arrays
• scientific article; zbMATH DE number 3985115
• Two-dimensional comma-free and cylindric codes
• 2-dimensional arithmetic residue check codes

Cited in

(8)

• Existence of a folding in multidimensional coding
• COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
• Counting polycubes without the dimensionality curse
• Correction of CT burst array errors in the generalized-Lee-RT spaces
• Formulae and growth rates of high-dimensional polycubes
• 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.
• 2-D quasi m-arrays and Gold code arrays

This page was built for publication: Two-Dimensional Cluster-Correcting Codes

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