LEADER 00870nam0-2200289 --450 001 9910922148203321 005 20250115122858.0 010 $a978-88-288-3508-0 100 $a20250115d2024----kmuy0itay5050 ba 101 0 $aita 102 $aIT 105 $a 001yy 200 1 $a<>obbligazioni$fUmberto Breccia con Filippo Viglione 205 $aRistampa aggiornata 210 $aMilano$cGiuffrè$d2024 215 $aXXIV, 1162 p.$d21 cm 225 1 $aTrattato di diritto privato$fa cura di Giovanni Iudica e Paolo Zatti 676 $a346.4502$v23$zita 700 1$aBreccia,$bUmberto$f<1943- >$035651 701 1$aViglione,$bFilippo$0288634 801 0$aIT$bUNINA$gREICAT$2UNIMARC 901 $aBK 912 $a9910922148203321 952 $aVIII B 666 (1, RIST.)$b2024/1947$fFGBC 959 $aFGBC 996 $aObbligazioni$94308795 997 $aUNINA LEADER 02042oam 2200409zu 450 001 9910872665803321 005 20241212214858.0 035 $a(CKB)111026746723916 035 $a(SSID)ssj0000455033 035 $a(PQKBManifestationID)12211793 035 $a(PQKBTitleCode)TC0000455033 035 $a(PQKBWorkID)10398888 035 $a(PQKB)11441852 035 $a(NjHacI)99111026746723916 035 $a(EXLCZ)99111026746723916 100 $a20160829d1998 uy 101 0 $aeng 135 $aur||||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$a1998 IEEE International Symposium on Information Theory 210 31$a[Place of publication not identified]$cIEEE$d1998 215 $a1 online resource (526 pages) 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a9780780350007 311 08$a0780350006 330 $aIt is now understood that the turbo decoding algorithm is an instance of a probability propagation algorithm (PPA) on a graph with many cycles. In this paper we investigate the behavior of an PPA in graphs with a single cycle such as the graph of a tail-biting code. First, we show that for strictly positive local kernels, the iterations of the PPA converge to a unique fixed point, (which was also observed by Anderson and Hladik (1998) and Weiss (1997)). Secondly, we shall generalize a result of McEliece and Rodemich (1995), by showing that if the hidden variables in the cycle are binary-valued, the PPA will always make an optimal decision. (This was also observed independently by Weiss). When the hidden variables can assume 3 or more values, the behavior of the PPA is much harder to characterize. 606 $aInformation theory$vCongresses 615 0$aInformation theory 676 $a003.54 712 02$aInstitute of Electrical and Electronics Engineers, Inc. Staff 801 0$bPQKB 906 $aPROCEEDING 912 $a9910872665803321 996 $a1998 IEEE International Symposium on Information Theory$92510307 997 $aUNINA