Code Design for Short Blocks: A Survey
arXiv:1610.00873
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.
A preliminary version of this work was presented at the 25th Edition of the European Conference on Networks and Communications (EuCNC), June 2016. This version includes the performance of polar codes with list decoding and CRC
Cited by in corpus (7)
- Short Codes with Mismatched Channel State Information: A Case Study
- Goodput Maximization with Quantized Feedback in the Finite Blocklength Regime for Quasi-Static Channels
- Polar Coding with Chemical Reaction Networks
- Segmentation-Discarding Ordered-Statistic Decoding for Linear Block Codes
- Protograph-Based Design for QC Polar Codes
- NOMA Joint Decoding based on Soft-Output Ordered-Statistics Decoder for Short Block Codes
- Shaped On-Off Keying Using Polar Codes