Codes defined on graphs.
Low-density parity-check codes, turbo codes, and indeed most practically decodable capacity-approaching error correcting codes can all be understood as codes defined on graphs. Graphs not only describe the codes, but, more important, they structure the operation of the sum-product decoding algorithm...
| Pubblicato in: | IEEE Communications magazine 41, 8 (2003). |
|---|---|
| Autore principale: | |
| Natura: | Articolo |
| Lingua: | English |
| Soggetti: |