All trials use unquantised soft-decision Viterbi decoding. List decoding uses the tree-trellis algorithm. Blocks are terminated by encoder flushing.
Measured failure rates for some combinations of code rate and constraint length. All examples use 72 bits of information per message plus a 16 bit CRC.
Each chart also shows the sphere packing limit (SPL) calculated for messages with the same block size. See Appendix for details of the calculation.