Error-Correcting Codes That Nearly Saturate Shannon's Bound
classification
❄️ cond-mat.dis-nn
keywords
codesbounderror-correctingnearlysaturateshannoncodeconstructed
read the original 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.
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.