Author:
Das Pankaj Kumar,Kumar Subodh
Abstract
To protect the information from disturbances created by noisy channels, redundant symbols (called check symbols) with the information symbols are added. These extra symbols play important role for the efficiency of the communication system. It is always important to know how much these check symbols are required for a code designed for a specific purpose. In this communication, we give lower and upper bounds on check symbols needed to a linear code correcting key errors of length upto p which are confined to a single sub-block. We provide two examples of such linear codes. We, further, obtain those bounds for the case when key error occurs in the whole code length, but the number of disturbing components within key error is upto a certain number. Two examples in this case also are provided.
Publisher
International Journal of Mathematical, Engineering and Management Sciences plus Mangey Ram
Subject
General Engineering,General Business, Management and Accounting,General Mathematics,General Computer Science
Reference10 articles.
1. Balakrishnan, V.K. (1996). Introductory discrete mathematics. Dover Publications, New York.
2. Das, P.K. (2014). Codes on key errors. Cybernetics and Information Technologies, 14(2), 31-37.
3. Das, P.K. (2015). Codes correcting key errors. TWMS Journal of Applied and Engineering Mathematics, 5(1), 110-117.
4. Das, P.K., & Kumar, S. (2020). Location and weight distribution of key errors. Accepted for Publication in Matematiki Vesnik.
5. Hamming, R.W. (1950). Error detecting and error correcting codes. The Bell System Technical Journal, 29(2), 147-160.