Codes correcting key errors

The objective of coding theory is to protect a message going through a noisy channel. 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. Sharma and Gaur [6] introduced a new kind of error which i...

Full description

Saved in:
Bibliographic Details
Published inTWMS journal of applied and engineering mathematics Vol. 5; no. 1; pp. 110 - 117
Main Author Das, Pankaj Kumar
Format Journal Article
LanguageEnglish
Published Istanbul Turkic World Mathematical Society 01.01.2015
Elman Hasanoglu
Subjects
Channels
Coding
Coding theory
Digits
Error correction
Error-correcting codes
Errors
Mathematical analysis
Mathematical research
Matrix
Messages
Upper bounds
Online AccessGet full text
ISSN2146-1147
2146-1147

Cover

More Information
Summary:The objective of coding theory is to protect a message going through a noisy channel. 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. Sharma and Gaur [6] introduced a new kind of error which is termed as 'key error'. This paper presents lower and upper bounds on the number of parity-check digits required for linear codes capable of correcting such errors. An example of such a code is also provided.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:2146-1147
2146-1147