论文信息 - A Note on Bounds for Burst Correcting Codes with Lee Weight Consideration

A Note on Bounds for Burst Correcting Codes with Lee Weight Consideration

Lee weight is more appropriate for some practical situations than Hamming weight. Bounds over the number of parity checks in terms of Hamming weight have been obtained, but such a detailed study is not available in terms of Lee weight. In this paper, considering Lee weight, we obtain a necessary bound over the number of parity checks to correct a message which has both clustered errors and errors in separate positions. Also there is a bound for codes correcting bursts with limited intensity.

Bhu Dev Sharma | S. N. Goel | B. D. Sharma | S. Goel

[1] C. Y. Lee,et al. Some properties of nonbinary error-correcting codes , 1958, IRE Trans. Inf. Theory.

[2] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.

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

[4] Bal Kishan Dass. A Sufficient Bound for Codes Correcting Bursts with Weight Constraint , 1975, JACM.

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

[6] B. K. Dass,et al. On linear codes correcting random and low-density burst errors , 1977 .