Error Locating Codes Dealing with Repeated Low-Density Burst Errors
Keywords:
Error locating codes, burst errors, burst errors of length of b(fixed), repeated low-density burst errors of length b(fixed).Abstract
This paper presents a study of linear codes which are capable to detect and locate errors which are repeated low-density bursts of length b(fixed) with weight w or less. An illustration for such a kind of code has also been provided.
References
Abramson, N.M. [1959] A class of systematic codes for non-independent errors, IRE Trans. on Information Theory, IT-5 (4), 150{ 157.
Alexander, A.A., Gryb, R.M. and Nast, D.W. [1960] Capabilities of the telephone network for data transmission, Bell System Tech J., 39(3), 431-476.
Chien, R.T. and Tang, D.T. [1965] On de¯nitions of a burst, IBM Journal of Research and Development, 9(4), 292{293.
Dass, B.K. [1980] On a Burst- Error Correcting Codes, J. Inf. Optimization Sciences, 1(3), 291{295.
Dass, B.K. [1983] Low-density burst error correcting linear codes,
Advances in Management Studies, 2(4), 375{385.
Dass, B.K. and Arora, Ritu [2010] Error Locating Codes Dealing with Repeated Burst Errors, accepted for publication in Italian Journal of Pure and Applied Mathematics, No. 30.
Dass, B.K. and Chand, Kishan [1986] Linear codes locating/correcting burst errors, DEI Journal of Science and Engineering Research, 4(2), 41{46.
Dass, B.K., Garg, Poonam and Zannetti, M. [2008] Some combina-torial aspects of m-repeated burst error detecting codes, Journal of Statistical Theory and Practice, 2(4), 707{711.
Dass, B.K. and Garg, Poonam [2009(a)] On 2-repeated burst codes,
Ratio Mathematica - Journal of Applied Mathematics, 19, 11{24.
Dass, B.K. and Garg, Poonam [2009(b)] Bounds for codes correct-ing/detecting repeated low-density burst errors, communicated.
Dass, B.K. and Garg, Poonam [2010], On repeated low-density burst error detecting linear codes, communicated.
Fire, P. [1959] A class of multiple-error-correcting binary codes for non-independent errors, Sylvania Report RSL-E-2, Sylvania Recon-naissance Systems Laboratory, Mountain View, Calif.
Hamming, R.W. [1950] Error-detecting and error-correcting codes,
Bell System Tech. J., 29, 147- 160.
Peterson, W.W., Weldon, E.J., Jr. [1972] Error-Correcting Codes, 2nd edition, The MIT Press, Mass.
Sacks, G.E. [1958] Multiple error correction by means of parity-checks,
IRE Trans. Inform. Theory IT, 4(December), 145{147.
Wyner, A.D. [1963] Low-density-burst-correcting codes, IEEE Trans. Informatiom Theory, (April), 124.
Wolf, J., Elspas, B. [1963] Error-locating codes A new concept in error control, IEEE Transactions on Information Theory, 9(2), 113{117.
Downloads
Published
Issue
Section
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.