DocumentCode :
2000801
Title :
On braided block codes
Author :
Truhachev, Dmitri ; Lentmaier, Michael ; Zigangirov, Kamil
Author_Institution :
Dept. of Inf. Technol., Lund Univ., Sweden
fYear :
2003
fDate :
29 June-4 July 2003
Firstpage :
32
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;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN :
0-7803-7728-1
Type :
conf
DOI :
10.1109/ISIT.2003.1228046
Filename :
1228046
Link To Document :
بازگشت