Efficient Error-Correcting Codes in the Short Blocklength Regime
arXiv:1812.08562
Abstract
The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem that is gaining relevance thanks to emerging applications in wireless communication networks. In this paper, we review some of the most promising code constructions targeting the short block regime, and we compare them with both finite-length performance bounds and classical error-correction coding schemes. The work addresses the use of both binary and high-order modulations over the additive white Gaussian noise channel. We will illustrate how to effectively approach the theoretical bounds with various performance versus decoding complexity tradeoffs.
arXiv commentPreprint submitted to Physical Communication; corrected typos; added references; extended discussion on list decoding of polar codes
References in corpus (10)
- Coded Random Access: Applying Codes on Graphs to Design Random Access Protocols
- Short-Packet Communications over Multiple-Antenna Rayleigh-Fading Channels
- Capacity-achieving ensembles for the binary erasure channel with bounded complexity
- Capacity-Achieving Ensembles of Accumulate-Repeat-Accumulate Codes for the Erasure Channel with Bounded Complexity
- Multiple-Bases Belief-Propagation Decoding of High-Density Cyclic Codes
- Variable-length Convolutional Coding for Short Blocklengths with Decision Feedback
- Polar Code Construction for List Decoding
- Reliability-output Decoding of Tail-biting Convolutional Codes
- Advanced channel coding for space mission telecommand links
- Joint Design of Convolutional Code and CRC under Serial List Viterbi Decoding