arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.00873cs.ITmath.IT
收藏

短块代码设计综述

Code Design for Short Blocks: A Survey

Gianluigi Liva, Lorenzo Gaudio, Tudor Ninacs, Thomas Jerkovits

摘要:

用于短信息块(例如,一千或更少的信息比特)是一个开放的研究问题,由于无线通信网络中的新兴应用,该问题正变得越来越重要。在这项工作中,我们回顾了一些最新的代码结构针对短块制度,然后我们比较有限长度的性能界限和经典的纠错编码方案。我们将看到如何有效地接近理论界限,具有不同的性能与解码复杂性权衡。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑