Codes Correcting Key Errors

Abstract

The objective of coding theory is to protect a message going through a noisychannel. The nature of errors that cause noisy channel depends on different factors.Accordingly codes are needed to develop to deal with different types of errors. Sharmaand Gaur [6] introduced a new kind of error which is termed as ‘key error’. This paperpresents lower and upper bounds on the number of parity-check digits required for linearcodes capable of correcting such errors. An example of such a code is also provided

Keywords

• Parity check matrix,syndrome,standard array,solid burst error

References

1. Das, P. K., (2014), Codes on Key Errors, Cybernetics and Information Technologies, 14(2), pp. 31-37.
2. Hamming, R. W., (1950), Error-detecting and error-correcting codes, Bell System Technical Journal, 29, pp. 147-160.
3. Peterson, W. W. and Weldon(Jr.), E. J., (1972), Error-Correcting Codes, 2nd edition, The MIT Press, Mass.
4. Reiger, S. H., (1960), Codes for the Correction of Clustered Errors, IRE Trans. Inform. Theory, IT-6, pp. 16-21.
5. Sacks, G. E., (1958), Multiple error correction by means of parity-checks, IRE Trans. Inform. Theory, IT-4, pp. 145-147.
6. Sharma, B. D. and Gaur, A., (2013), Codes Correcting Limited Patterns of Random Errors Using S-K Metric, Cybernetics and Information Technologies, 13(1), pp. 34-45.
7. Pankaj Kumar Das for the photography and short autobiography, see TWMS J. App. Eng. Math., V.3, N.2.