DocumentCode
2456861
Title
Codes with sparse graphs: transform analysis and constructions
Author
Tanner, R. Michael
Author_Institution
Dept. of Comput. Sci., California Univ., Santa Cruz, CA
fYear
1998
fDate
16-21 Aug 1998
Firstpage
116
Abstract
Generalized transform methods are employed to analyze and construct some families of quasi-cyclic codes with constraint graphs that have a low density of edges while maintaining good connectivity. Such codes are of interest for iterative decoding algorithms
Keywords
binary codes; cyclic codes; graph theory; iterative decoding; transform coding; codes; constraint graphs; constructions; generalized transform methods; good connectivity; iterative decoding algorithms; low density of edges; quasi-cyclic codes; sparse graphs; transform analysis; Algorithm design and analysis; Computer science; Differential equations; Iterative algorithms; Iterative decoding; Telecommunications; USA Councils; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.708705
Filename
708705
Link To Document