Coding for Optical Communications -- Can We Approach the Shannon Limit With Low Complexity?
Alexandre Graell i Amat, Gianluigi Liva, Fabian Steiner

TL;DR
This paper reviews three promising coding solutions aimed at achieving near-Shannon limit capacity in optical communications with low complexity, addressing a key challenge for future high-throughput systems.
Contribution
It compares and analyzes three coding methods suitable for low-complexity, high-capacity optical communication systems, highlighting their potential to approach Shannon limit performance.
Findings
Identifies three promising coding schemes for optical communications.
Highlights the potential of these codes to approach Shannon capacity.
Provides a comparative analysis of the coding solutions' complexity and performance.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptical Network Technologies · Error Correcting Code Techniques · graph theory and CDMA systems
