Title :
The average binary expansion of a Reed-Solomon code is good for error detection
Author_Institution :
US Army Res. Lab., Aberdeen Proving Ground, MD
fDate :
29 Jun-4 Jul 1997
Abstract :
When different bases are used to expand different columns of any Reed-Solomon code, the average error-detecting performance of the resulting binary codes is a monotonic function of the bit error probability
Keywords :
Reed-Solomon codes; binary sequences; error detection codes; error statistics; Reed-Solomon code; average binary expansion; average error-detecting performance; binary codes; bit error probability; error detection; monotonic function; Binary codes; Error probability; Laboratories; Redundancy; Reed-Solomon codes;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613168
