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 for both finite and infinite message lengths.
| Original language | English |
|---|---|
| Pages (from-to) | 2660-2663 |
| Number of pages | 4 |
| Journal | Physical Review Letters |
| Volume | 83 |
| Issue number | 13 |
| DOIs | |
| State | Published - 1 Jan 1999 |