Achieving the Reiger bound for burst errors using two-dimensional interleaving schemes
暂无分享,去创建一个
The Reiger bound states that the redundancy n-log/sub q/M of any q-ary code, of M codewords of n letters each, that corrects bursts of size up to B is at least 2B (assuming that there are two disjoint bursts of size B that can be corrected by the code (Bossert and Sidorenko, 1996; and Reiger, 1960). In order to achieve the Reiger bound by interleaving single error-correcting codes, these codes should be MDS and the interleaving scheme should use only B of them. Such interleaving is straightforward in one-dimension. Here we consider the two-dimensional version of this problem.
[1] Ronald L. Rivest,et al. An application of number theory to the organization of raster-graphics memory , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[2] S. H. Reiger,et al. Codes for the correction of 'clustered' errors , 1960, IRE Trans. Inf. Theory.
[3] Martin Bossert,et al. Singleton-type bounds for blot-correcting codes , 1996, IEEE Trans. Inf. Theory.