# On the Evaluation of the Polyanskiy-Poor–Verdú Converse Bound for Finite Block-Length Coding in AWGN

@article{Erseghe2015OnTE, title={On the Evaluation of the Polyanskiy-Poor–Verd{\'u} Converse Bound for Finite Block-Length Coding in AWGN}, author={Tomaso Erseghe}, journal={IEEE Transactions on Information Theory}, year={2015}, volume={61}, pages={6578-6590} }

A tight converse bound to the channel coding rate in the finite block-length regime and under additive white Gaussian noise conditions was recently proposed by Polyanskiy-Poor-Verdú (PPV). The bound is a generalization of a number of other classical results, and it was also claimed to be equivalent to Shannon's 1959 cone packing bound. In this paper, we investigate methods for a reliable numerical evaluation of the bound, which is troublesome even for not too large values of the block-length n… CONTINUE READING

14 Citations

Coding in the Finite-Blocklength Regime: Bounds Based on Laplace Integrals and Their Asymptotic Approximations

- Mathematics, Computer Science
- 2016

43

Coding Bounds in the Finite-Black-Length Regime: an Application to Spread-Spectrum Systems Design

- Computer Science
- 2019

On the security of transmissions over fading wiretap channels in realistic conditions

- Computer Science
- 2017

4

Saddlepoint Approximations for Short-Packet Wireless Communications

- Computer Science, Mathematics
- 2020

5

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 38 REFERENCES

An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels

- Computer Science, Mathematics
- 2008

53

Design of capacity-approaching irregular low-density parity-check codes

- Computer Science, Mathematics
- 2001

2972

Moderate deviation analysis of channel coding: Discrete memoryless case

- Mathematics, Computer Science
- 2010

53

The third-order term in the normal approximation for the AWGN channel

- Computer Science, Mathematics
- 2014

48