Asymptotic Combinatorial Coding Theory
Asymptotic Combinatorial Coding Theory
On one useful inequality in testing of hypotheses
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We suggest a new approach to constructing a lower bound on the decoding error probability in a discrete memoryless channel at zero transmission rate. This approach considerably simplifies derivation of the bound, making it more natural, and simultaneously improves the remainder term of the estimate for the decoding error exponent.