Title :
Improved union bound on linear codes for the input-binary AWGN channel, with applications to turbo codes
Author :
Viterbi, Audrey M. ; Viterbi, Andrew J.
Author_Institution :
QUALCOMM Inc., San Diego, CA, USA
Abstract :
While improved bounds have been central to proofs of the coding theorem and the tightness of the random coding bound for rates near capacity, most results for specific codes, both block and convolutional, have been based on the simple union bound. We present an improved bound for the input-binary AWGN channel in terms of the weights of the code-words of a linear block code
Keywords :
AWGN channels; block codes; channel coding; convolutional codes; interleaved codes; linear codes; maximum likelihood decoding; random codes; turbo codes; capacity; code rates; code word weight; coding theorem; convolutional codes; input-binary AWGN channel; linear block code; maximum likelihood decoding; random coding bound; randomly interleaved turbo code; union bound; AWGN channels; Block codes; Capacity planning; Concatenated codes; Decoding; Equations; Error probability; Turbo codes; Viterbi algorithm; Yield estimation;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708609
