DocumentCode
2057114
Title
An upper bound on the minimum distance of serially concatenated convolutional codes
Author
Perotti, Alberto ; Benedetto, Sergio
Author_Institution
Center for Multimedia Radio Commun., Politecnico di Torino
fYear
2004
fDate
2004
Firstpage
314
Lastpage
314
Abstract
This paper derives an upper bound on the minimum distance of serially concatenated convolutional codes. The resulting expression shows that their minimum distance cannot grow more than approximately K1-1/df (O) , where K is the information word length, and df (O) is the free distance of the outer code
Keywords
concatenated codes; convolutional codes; information word length; serially concatenated convolutional codes; Character generation; Concatenated codes; Convolutional codes; Error probability; Hamming weight; Multimedia communication; Radio communication; Region 2; Turbo codes; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Conference_Location
Chicago, IL
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365351
Filename
1365351
Link To Document