DocumentCode :
2384088
Title :
Dealing with short cycles in graphical codes
Author :
Guyader, Arnaud ; Fabre, Eric
Author_Institution :
IRISA, Rennes, France
fYear :
2000
fDate :
2000
Firstpage :
10
Abstract :
The graphical representation of codes has opened the way to soft decoding by belief propagation, which extends the usual soft Viterbi decoding. This simple algorithm is most often used for constructing and evaluating graphical codes. We show that belief propagation on graphs is not always appropriate and that the algorithmic resources for graphical models are far more extended than belief propagation. In particular, we propose new approximate decoders based on the “conditioning technique” to solve the short cycles problem of graphical codes
Keywords :
Viterbi decoding; belief networks; codes; graph theory; approximate decoders; belief propagation; conditioning technique; graphical codes; graphical representation; short cycles problem; soft Viterbi decoding; soft decoding; Approximation algorithms; Belief propagation; Decoding; Graphical models; Particle measurements; Protection; Tree data structures; Tree graphs; Turbo codes; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
Type :
conf
DOI :
10.1109/ISIT.2000.866300
Filename :
866300
Link To Document :
بازگشت