Background: Finite Length Bounds

To evaluate the performance of error correcting codes in the finite blocklength regime, the traditional asymptotic information theoretic results are not very insightful. Instead, finite blocklength coding bounds provide better means to assess their performance.

Here, we provide the implementation of three different bounds for the scalar AWGN channel:

To interpret the results of the Online Tool, please consider the following points:

Sphere Packing Bound

Detailed description will follow.

Random Coding Bound

Detailed description will follow.

Normal Approximation

Detailed description will follow.