Bounds for Codes Correcting/Detecting repeated Low-Density Burst Errors
暂无分享,去创建一个
[1] Poonam Garg,et al. Some Combinatorial Aspects of m-Repeated Burst Error Detecting Codes , 2008 .
[2] Aaron D. Wyner,et al. Low-density-burst-correcting codes (Corresp.) , 1963, IEEE Trans. Inf. Theory.
[3] Poonam Garg,et al. On repeated low-density burst error detecting linear codes , 2011 .
[4] Robert T. Chien,et al. On Definitions of a Burst , 1965, IBM J. Res. Dev..
[5] G. Sacks. Multiple error correction by means of parity checks , 1958 .
[6] A. A. Alexander,et al. Capabilities of the telephone network for data transmission , 1960 .
[7] Bal Kishan Dass. On a Burst-Error Correcting Code , 1980 .
[8] Bhu Dev Sharma,et al. Extended Varshamov- Gilbert and sphere-packing bounds for burst-correcting codes (Corresp.) , 1974, IEEE Trans. Inf. Theory.
[9] Bal Kishan Dass. A Sufficient Bound for Codes Correcting Bursts with Weight Constraint , 1975, JACM.
[10] Richard W. Hamming,et al. Error detecting and error correcting codes , 1950 .
[11] Norman M. Abramson,et al. A class of systematic codes for non-independent errors , 1959, IRE Trans. Inf. Theory.
[12] James L. Massey,et al. Review of 'Error-Correcting Codes, 2nd edn.' (Peterson, W. W., and Weldon, E. J., Jr.; 1972) , 1973, IEEE Trans. Inf. Theory.
[13] Poonam Garg,et al. On 2-Repeated Burst Codes , 2009 .