DocumentCode
3277520
Title
Construction of codes based on finite generalized quadrangles for iterative decoding
Author
Vontobel, Pascal O. ; Tanner, R. Michael
Author_Institution
ISI, Eidgenossische Tech. Hochschule, Zurich, Switzerland
fYear
2001
fDate
2001
Firstpage
223
Abstract
Finite generalized polygons (FGPs) for constructing Tanner graphs are investigated, focusing on finite generalized quadrangles (FGQs). Graphs from FGPs are distinctive in that their girths are the largest possible, namely, exactly twice the diameter. Rates, minimum distances, and simulation results using enhanced sum-product decoders are given
Keywords
codes; graph theory; iterative decoding; BER; Tanner graphs; bit error rate; code construction; code rates; finite generalized polygons; finite generalized quadrangles; iterative decoding; minimum distances; simulation results; sum-product decoders; Bit error rate; Geometry; Intersymbol interference; Iterative decoding; Joining processes; Parity check codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location
Washington, DC
Print_ISBN
0-7803-7123-2
Type
conf
DOI
10.1109/ISIT.2001.936086
Filename
936086
Link To Document