Efficient Error-Correcting Codes in the Short Blocklength Regime
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.
Cite
@article{arxiv.1812.08562,
title = {Efficient Error-Correcting Codes in the Short Blocklength Regime},
author = {Mustafa Cemil Coşkun and Giuseppe Durisi and Thomas Jerkovits and Gianluigi Liva and William Ryan and Brian Stein and Fabian Steiner},
journal= {arXiv preprint arXiv:1812.08562},
year = {2019}
}
Comments
Preprint submitted to Physical Communication; corrected typos; added references; extended discussion on list decoding of polar codes