Error-Correcting Codes That Nearly Saturate Shannon's Bound

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 publication has 0 references indexed in Scilit: