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...

Descripción completa

Detalles Bibliográficos

Publicado en:	IEEE Communications magazine 41, 8 (2003).
Autor principal:	Kschischang, F.R
Formato:	Artículo
Lenguaje:	inglés
Materias:	Capacity approaching error correcting codes. Channel capacity. Decoding complexity. Factor graphs. Iterative decoding. Joint probability distributions. Low-density parity-check codes. Sum-product algorithm. Sum-product decoding algorithm. Turbo codes.