Title : 
On braided block codes
         
        
            Author : 
Truhachev, Dmitri ; Lentmaier, Michael ; Zigangirov, Kamil
         
        
            Author_Institution : 
Dept. of Inf. Technol., Lund Univ., Sweden
         
        
        
            fDate : 
29 June-4 July 2003
         
        
        
            Abstract : 
Two families of braided block codes are analyzed, tightly braided block codes and sparsely braided block codes. Bounds on the free distance of tightly braided block codes are derived. Asymptotic iterative decoding performance of sparsely braided block codes is studied.
         
        
            Keywords : 
block codes; iterative decoding; asymptotic iterative decoding performance; sparsely braided block code family; tightly braided block code; Block codes; Councils; Encoding; Information analysis; Information technology; Iterative decoding; Parity check codes; Product codes; Reliability engineering; Upper bound;
         
        
        
        
            Conference_Titel : 
Information Theory, 2003. Proceedings. IEEE International Symposium on
         
        
            Print_ISBN : 
0-7803-7728-1
         
        
        
            DOI : 
10.1109/ISIT.2003.1228046