Title :
The concatenation error exponent is completely tight
Author :
Lazic, D.E. ; Beth, Th.
Author_Institution :
Fak. fur Inf., Karlsruhe Univ., Germany
fDate :
29 Jun-4 Jul 1997
Abstract :
A new lower bound an the error exponent of concatenated codes is derived which coincides with Forney´s (1966) upper bound for all code rates
Keywords :
Reed-Solomon codes; channel capacity; coding errors; concatenated codes; error statistics; probability; random processes; Forney´s upper bound; Reed-Solomon outer codes; code rates; concatenated codes; concatenation error exponent; error exponent; lower bound; random coding; symbol error probability; Block codes; Channel capacity; Concatenated codes; Entropy; Equations; Error probability; Information theory; Reed-Solomon codes; Upper bound;
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.613274
