Repeated Burst Error Detecting Linear Codes

B. K. Dass, Rashmi Verma

Abstract


This paper presents lower bounds on the number of parity-check digits required for a linear code that is capable of detecting errors which are ‘m-repeated burst errors’. Further, codes capable of detecting and simultaneously correcting such errors have also been studied.


Full Text:

PDF

References


Alexander A.A., Gryb R.M. and Nast D. W. (1960), Capabilities of the telephone network for data transmission, Bell System Tech. J., Vol. 39,No. 3, pp. 431–476.

Berardi L., Dass B.K. and Verma Rashmi (2009), On 2-repeated burst error detecting codes, Journal of Statistical Theory and Practice, Vol. 3, No. 2, pp. 381–391.

Bridwell J.D. and Wolf J.K. (1970), Burst distance and multiple-burst correction, Bell System Tech. J., Vol. 99, pp. 889–909.

Chien R.T. and Tang D.T. (1965), On definitions of a burst, IBM Journal of Research and Development, Vol. 9, No. 4 (July), pp. 292– 293.

Peterson W.W. and Weldon E.J., Jr. (1972), Error-Correcting Codes, 2nd edition, The MIT Press, Mass.

Reiger S.H. (1960), Codes for the correction of “clustered errors”, IRE Trans. Inform. Theory, IT-6 March, pp. 16–21.

Stone J.J. (1961), Multiple burst error correction, Information and Control, Vol. 4, pp. 324–331.


Refbacks

  • There are currently no refbacks.


Copyright (c) 2009 B. K. Dass, Rashmi Verma

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Ratio Mathematica - Journal of Mathematics, Statistics, and Applications. ISSN 1592-7415; e-ISSN 2282-8214.