DocumentCode
2516301
Title
Asymptotic performances of woven graph codes
Author
Bocharova, Irina ; Kudryashov, Boris ; Johannesson, Rolf ; Zyablov, Victor
Author_Institution
Dept. of Inf. Syst., Univ. of Inf. Techn. Mech. & Opt., St. Petersburg
fYear
2008
fDate
6-11 July 2008
Firstpage
1025
Lastpage
1029
Abstract
Constructions of woven graph codes based on constituent block and convolutional codes are studied. It is shown that within the random ensemble of such codes based on s-partite, s-uniform hypergraphs, where s depends only on the code rate, there exist codes satisfying the Varshamov-Gilbert (VG) and the Costello lower bound on the minimum distance and the free distance, respectively.
Keywords
block codes; convolutional codes; graph theory; random codes; Costello lower bound; Varshamov-Gilbert lower bound; Woven graph codes; block codes; code rate; convolutional codes; random codes; s-partite; s-uniform hypergraphs; Bipartite graph; Block codes; Concatenated codes; Convolutional codes; Encoding; H infinity control; Interleaved codes; Iterative decoding; Parity check codes; Turbo codes; Graphs; LDPC codes; convolutional codes; girth; graph codes; hypergraphs; tailbiting codes; woven codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location
Toronto, ON
Print_ISBN
978-1-4244-2256-2
Electronic_ISBN
978-1-4244-2257-9
Type
conf
DOI
10.1109/ISIT.2008.4595142
Filename
4595142
Link To Document