Code Design for Short Blocks: A Survey

October 04, 2016 ยท The Cartographer ยท ๐Ÿ› arXiv.org

๐Ÿ“š THE CARTOGRAPHER: The Cartographer
Survey/review paper โ€” maps the landscape rather than implementing a method.

"No code URL or promise found in abstract"
"Title-pattern auto-detect: Code Design for Short Blocks: A Survey"

Evidence collected by the PWNC Scanner

Authors Gianluigi Liva, Lorenzo Gaudio, Tudor Ninacs, Thomas Jerkovits arXiv ID 1610.00873 Category cs.IT: Information Theory Citations 115 Venue arXiv.org Last Checked 1 day ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Information Theory