Exponential error bounds for erasure, list, and decision feedback schemes
G Forney - IEEE Transactions on Information Theory, 1968 - ieeexplore.ieee.org
IEEE Transactions on Information Theory, 1968•ieeexplore.ieee.org
… THE BOUNDS In the Appendix, we show that similar, two-parameter exponential error
bounds govern the quant,ities Pr (E,) and Pr (E,), which we recall are the erasure and undetected-error
probabilities for erasure schemes, or the listerror probability and average number of
incorrect words on the list for list schemes. These bounds are given by Theorem 2. …
bounds govern the quant,ities Pr (E,) and Pr (E,), which we recall are the erasure and undetected-error
probabilities for erasure schemes, or the listerror probability and average number of
incorrect words on the list for list schemes. These bounds are given by Theorem 2. …
By an extension of Gallager's bounding methods, exponential error bounds applicable to coding schemes involving erasures, variable-size lists, and decision feedback are obtained. The bounds are everywhere the tightest known.
ieeexplore.ieee.org