Dealing with short cycles in graphical codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2000, Pages 10-

  Guyader, Arnaud ^a   Fabre, Eric ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BELIEF PROPAGATION; GRAPHICAL CODES; MARKOV FIELD THEORY; SHORT CYCLES; VITERBI DECODING;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECODING; GRAPH THEORY; MARKOV PROCESSES; MATHEMATICAL MODELS;

TURBO CODES;

EID: 0034447141     PISSN: 21578095     EISSN: None     Source Type: Journal    
DOI: 10.1109/ISIT.2000.866300     Document Type: Article

References (3)

1. Turbo decoding as an instance of Pearl's belief propagation algorithm
2. A recursive approach to low complexity codes
3. Fusion, propagation and structuring in belief networks