On weights of 2-repeated bursts

Authors

  • Barkha Rohtagi Department of Applied Sciences, KIET, NH-58, P.Box-02, Ghaziabad-201206, India
  • Bhu Dev Sharma Department of Mathematics, JIIT (Deemed University), A-10, Sector-62, Noida-201301, India

DOI:

https://doi.org/10.23755/rm.v27i1.33

Keywords:

repeated burst errors, weight of bursts, burst error correcting codes.

Abstract

It is generally seen that the behavior of the bursts depend upon the nature of the channel. In a very busy communication channel bursts repeat themselves. In this communication we are exploring the idea of weight consideration of 2-repeated bursts of length b(fixed). Some results on weights of 2-repeated bursts of length b(fixed) are derived and some combinatorial results with weight constraint for 2-repeated bursts of length b(fixed) are also given.

References

N.M. Abramson, A class of systematic codes for non-independent errors, IRE Trans. on Information Theory IT-5 (4) (1959), 150-157.

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

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

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

R.T. Chien and D.T. Tang, On definitions of a burst, IBM Journal of Research and Development 9 (4) (1965), 229-293.

B.K. Dass, On a burst-error correcting code, Journal of Information and Optimization Sciences 1 (3) (1980), 291-295.

B.K. Dass, P. Garg and M. Zanneti, On repeated burst error detecting and correcting codes, in special volume of East-West J. of Mathematics: Contributed in General Algebra II (eds. Nguyen Van Sanh and Nittiya Pabhapote) (2008), 79-98.

B.K. Dass and P. Garg, On repeated low-density burst error detecting linear codes, Mathematical Communications 16 (2011), 37-47.

B.K. Dass and P. Garg, On 2-repeatted burst codes, Ratio Mathematica 19 (2009), 11-24.

B. Elspas, A note on p-nary adjacent error correcting codes, IRE Trans. IT-6 (1960), 13-15.

P. Fire, A class of multiple-error-correcting binary codes for non-independent errors, Sylvania Report RSL-E-2, Sylvania Reconnaissance System Laboratory, Mountain View, Calif., (1959).

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

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

B.D. Sharma and B.K. Dass (1972), On weight of bursts, presented at 38th Annul. Conf. of IMS, Bhopal, India.

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

Downloads

Published

2014-12-14

Issue

Vol. 27 (2014)

Section

Volume 27-2014

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.