Three-dimensional cluster error-correcting array codes
暂无分享,去创建一个
We present linear binary three-dimensional array codes that can correct three-dimensional clusters (or bursts) of errors. Constructions of the codes are based on the three-dimensional interleaving schemes and direct-sum augmentation technique.
[1] Alexander Vardy,et al. Interleaving Schemes for Multidimensional Cluster Errors , 1998, IEEE Trans. Inf. Theory.
[2] Martin Bossert,et al. Array Codes Correcting a Two-Dimensional Cluster of Errors , 1998, IEEE Trans. Inf. Theory.
[3] Khaled A. S. Abdel-Ghaffar,et al. Two-dimensional burst identification codes and their use in burst correction , 1988, IEEE Trans. Inf. Theory.