Improved union bound on linear codes for the input-binary AWGN channel, with applications to turbo codes
Improved union bound on linear codes for the input-binary AWGN channel, with applications to turbo codes
复制标题
改进了输入二进制 AWGN 信道的线性码的联合界限，并应用于 Turbo 码
DOI：
10.1109/isit.1998.708609
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
A. Viterbi
中科院分区：
文献类型：
--
作者：
A. Viterbi;A. Viterbi
虽然改进的界是证明编码定理和接近容量速率的随机编码界的紧密性的核心，但大多数特定编码的结果，无论是块还是卷积，都是基于简单联合界的。根据线性分组码码字的权重，提出了输入-二进制AWGN信道的改进界。
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.