Construction of codes based on finite generalized quadrangles for iterative decoding
Pascal O. Vontobel, R. Michael Tanner · 2002
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.