Finite Blocklength Performance of Capacity-achieving Codes in the Light of Complexity Theory

Holger Boche, Andrea Grigorescu, Rafael F. Schaefer +1

Since the work of Polyanskiy, Poor and Verdú on the finite blocklength performance of capacity-achieving codes for discrete memoryless channels, many papers have attempted to find…