论文信息 - A Sufficient Bound for Codes Correcting Bursts with Weight Constraint

A Sufficient Bound for Codes Correcting Bursts with Weight Constraint

An upper bound on the sufficient number of panty-cheek positions of a hnear code capable of correcting bursts of a given length or less having a weight constraint over them is p r e s e n t e d An example of a code which corrects all bursts of length 3 or less that have weight 2 or less is given.

Bal Kishan Dass

[1] Bhu Dev Sharma,et al. Extended Varshamov- Gilbert and sphere-packing bounds for burst-correcting codes (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[2] Richard W. Hamming,et al. Error detecting and error correcting codes , 1950 .

[3] Journal of the Association for Computing Machinery , 1961, Nature.

[4] G. Sacks. Multiple error correction by means of parity checks , 1958 .

[5] S. H. Reiger,et al. Codes for the correction of 'clustered' errors , 1960, IRE Trans. Inf. Theory.

[6] W. W. Peterson,et al. Error-Correcting Codes. , 1962 .

[7] Jack K. Wolf,et al. Burst distance and multiple-burst correction , 1970, Bell Syst. Tech. J..

[8] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.