Code Design for Short Blocks: A Survey

TL;DR

This survey reviews recent code constructions for short information blocks in wireless communications, comparing their performance to theoretical bounds and classical schemes, highlighting trade-offs between performance and decoding complexity.

Contribution

It provides a comprehensive overview of recent advances in short block code design and their performance relative to theoretical limits and classical methods.

Findings

Recent codes approach theoretical performance bounds

Trade-offs exist between decoding complexity and performance

Short block codes outperform classical schemes in certain regimes

Abstract

The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem which is gaining relevance thanks to emerging applications in wireless communication networks. In this work, we review some of the most recent code constructions targeting the short block regime, and we compare then with both finite-length performance bounds and classical error correction coding schemes. We will see how it is possible to effectively approach the theoretical bounds, with different performance vs. decoding complexity trade-offs.