Improved union bound on linear codes for the input-binary AWGN channel, with applications to turbo codes
AM Viterbi, AJ Viterbi - Proceedings. 1998 IEEE International …, 1998 - ieeexplore.ieee.org
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 …
of the random coding bound for rates near capacity, most results for specific codes, both …
[引用][C] Improved union bound on linear codes for the input-binary AWGN channel, with applications to turbo codes
AM VITERBI, AJ VITERBI - … Cambridge MA, 16-21 August 1998 …, 1998 - pascal-francis.inist.fr
Improved union bound on linear codes for the input-binary AWGN channel, with applications
to turbo codes CNRS Inist Pascal-Francis CNRS Pascal and Francis Bibliographic …
to turbo codes CNRS Inist Pascal-Francis CNRS Pascal and Francis Bibliographic …