Repeated Burst Error Detecting Linear Codes

Authors

  • B. K. Dass Department of Mathematics University of Delhi Delhi - 110 007, India
  • Rashmi Verma Department of Mathematics University of Delhi Delhi - 110 007, India

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.

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.

Downloads

Published

2009-12-11

Issue

Vol. 19 (2009)

Section

Volume 19-2009

License

This journal provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. The journal is committed to real and immediate open access for academic work. All of the journal articles are free to access immediately from the date of publication. There are no charge for readers to download articles and reviews for their own scholarly use. Benefits of open access for authors, include:

  • Free access for all users worldwide
  • Increased visibility and readership
  • Rapid publication
  • No spatial constraints
  • Authors can share their research papers on their personal web-pages (i.e. ResearchGate, etc.)

Ratio Mathematica publishes open access articles under the terms of the Creative Commons Attribution (CC BY) License. The Creative Commons Attribution License (CC-BY) allows users to copy, distribute and transmit an article, adapt the article and make commercial use of the article. The CC BY license permits commercial and non-commercial re-use of an open access article, as long as the author is properly attributed. Copyright on any research article published by Ratio Mathematica is retained by the author(s). Authors grant Ratio Mathematica a license to publish the article and identify itself as the original publisher. Authors also grant any third party the right to use the article freely as long as its original authors, citation details and publisher are identified. 
For further information visit: https://creativecommons.org/licenses/by/3.0/. The following logo will appear in any paper that will be published from the volume number 31/2016 onwards.