Codes on Key Errors

Coding theory has started with the intention of detection and correction of errors which have occurred during communication. Different types of errors are produced by different types of communication channels and accordingly codes are developed to deal with them. In 2013 Sharma and Gaur introduced a new kind of an error which will be termed “key error”. This paper obtains the lower and upper bounds on the number of parity-check digits required for linear codes capable for detecting such errors. Illustration of such a code is provided. Codes capable of simultaneous detection and correction of such errors have also been considered.