Error-Correcting Codes That Nearly Saturate Shannon's Bound
Ido Kanter, David Saad
TL;DR
This paper introduces Gallager-type error-correcting codes inspired by Ising spin systems that approach Shannon's theoretical limit, with performance evaluated across various code rates and message lengths.
Contribution
It presents a novel construction of error-correcting codes that nearly saturate Shannon's bound using insights from statistical physics.
Findings
Codes perform well across different code rates
Performance approaches Shannon's limit in both finite and infinite message lengths
Mapping to Ising spin systems provides new design insights
Abstract
Gallager-type error-correcting codes that nearly saturate Shannon's bound are constructed using insight gained from mapping the problem onto that of an Ising spin system. The performance of the suggested codes is evaluated for different code rates in both finite and infinite message length.
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.