Upper Bound on Correcting Partial Random Errors
By: Ankita Gaur and Bhu Dev Sharma
Open Access
|Sep 2013
References
- 1. Berlekamp, E. R. Algebraic Coding Theory. New York, Mc Graw-Hill, 1968.
- 2. Peterson, W. W., E. J. Weldon. Error-Correcting Codes. 2nd Ed. Cambridge, Mass., MIT Press, 1972.
- 3. Sharma, B. D., M. L. Kaushik. Algebra of Sharma-Kaushik’s Metric Inducing Partitions of Zq. − J. Combin. Information System Science, Vol. 11, 1986, 19-32.
- 4. Sharma, B. D., G. Dial. Some Tighter Bounds on Code Size with Sharma-Kaushik Metrics. - In: Presented at the Intern. Conf. on Math., Mao, Menorca, June 1987, 15-17.
- 5. Sharma, B. D., M. L. Kaushik. Limited Intensity Random and Burst Error Correcting Codes with Class Weight Consideration. − Elektronische Informationsverarbeitung und Kybernetik, Vol. 15, 1979, 315-321.
- 6. Sharma , B. D., A. Gaur. Codes Correcting Limited Patterns of Random Errors Using SK- METRIC. - Cybernetics and Information Technologies, Vol. 13, 2013, No 1, 34-45.
DOI: https://doi.org/10.2478/cait-2013-0024 | Journal eISSN: 1314-4081 | Journal ISSN: 1311-9702 (formerly 1314-4081)
Language: English
Page range: 41 - 49
Published on: Sep 20, 2013
Published by: Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
In partnership with: Paradigm Publishing Services
Keywords:
Related subjects:
© 2013 Ankita Gaur, Bhu Dev Sharma, published by Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
This work is licensed under the Creative Commons License.