Coding for Optical Communications -- Can We Approach the Shannon Limit With Low Complexity?
Information Theory
2019-09-20 v1 math.IT
Abstract
Approaching capacity with low complexity is a very challenging task. In this paper, we review and compare three promising coding solutions to achieve that, which are suitable for future very high-throughput, low-complexity optical communications.
Keywords
Cite
@article{arxiv.1909.09092,
title = {Coding for Optical Communications -- Can We Approach the Shannon Limit With Low Complexity?},
author = {Alexandre Graell i Amat and Gianluigi Liva and Fabian Steiner},
journal= {arXiv preprint arXiv:1909.09092},
year = {2019}
}
Comments
Invited paper for ECOC 2019. Note that we corrected the iBDD-SR curve in Fig. 2 of an earlier version of this paper. Because of a plotting issue the curve was mistakenly shifted to the right