Title :
Correcting a specified set of likely error patterns
Author :
Tan, Narciso L. ; Welch, Lloyd R. ; Scholtz, Robert A.
Author_Institution :
Commun. Sci. Inst., Univ. of Southern California, Los Angeles, CA, USA
fDate :
27 Jun-1 Jul 1994
Abstract :
This paper investigates the problem of finding the minimum redundancy code that will correct any specified set of error patterns which can occur anywhere within a code word or overlap two code words. Suppose a set of likely error patterns in a communication system is given. Although codes which have been designed to correct random error patterns and burst error patterns can be used, the main concern here is to find linear block codes which will correct this set of error patterns with the fewest possible redundant bits for different code wordlengths
Keywords :
block codes; coding errors; error correction codes; error statistics; linear codes; burst error patterns correction; code word; code wordlengths; communication system; linear block codes; minimum redundancy code; random error patterns correction; Block codes; Contracts; Decoding; Delay effects; Error correction; Error correction codes; Galois fields; Parity check codes; Redundancy;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394987
