pith. sign in

arxiv: 1610.00873 · v1 · pith:HTTXEHSZnew · submitted 2016-10-04 · 💻 cs.IT · math.IT

Code Design for Short Blocks: A Survey

classification 💻 cs.IT math.IT
keywords shortblockblocksboundscodedesigninformationperformance
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Shaped On-Off Keying Using Polar Codes

    cs.IT 2019-07 unverdicted novelty 6.0

    Polar codes perform joint distribution matching and error correction for on-off keying, delivering asymptotically optimal signaling and a simulated 1.8 dB gain over uniform transmission at 0.25 bits per channel use.