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
References in corpus (6)
- Coded Random Access: Applying Codes on Graphs to Design Random Access Protocols
- 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
- Reliability-output Decoding of Tail-biting Convolutional Codes
- Advanced channel coding for space mission telecommand links
Cited by in corpus (18)
- Deep Learning Methods for Improved Decoding of Linear Codes
- An Iterative BP-CNN Architecture for Channel Decoding
- A Revisit to Ordered Statistics Decoding: Distance Distribution and Decoding Rules
- Polar Code Construction for List Decoding
- Bit-Metric Decoding of Non-Binary LDPC Codes with Probabilistic Amplitude Shaping
- Efficient Scheduling for the Massive Random Access Gaussian Channel
- On Hard and Soft Decision Decoding of BCH Codes
- A Multi-Objective Optimization Framework for URLLC with Decoding Complexity Constraints
- 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
- Memory Management in Successive-Cancellation based Decoders for Multi-Kernel Polar Codes
- Protograph-Based Design for QC Polar Codes
- Design of Low-Complexity Convolutional Codes over GF(q)
- Latency and Reliability Trade-off with Computational Complexity Constraints: OS Decoders and Generalizations
- Shaped On-Off Keying Using Polar Codes
- NOMA Joint Decoding based on Soft-Output Ordered-Statistics Decoder for Short Block Codes