论文信息 - Construction of codes based on finite generalized quadrangles for iterative decoding

Construction of codes based on finite generalized quadrangles for iterative decoding

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.

Pascal O. Vontobel | R. M. Tanner | P. Vontobel | R. M. Tanner

[1] Jacques Tits,et al. Sur la trialité et certains groupes qui s’en déduisent , 1959 .

[2] Bhaskar Bagchi,et al. Even order inversive planes, generalized quadrangles and codes , 1987 .

[3] Shu Lin,et al. Error control coding : fundamentals and applications , 1983 .

[4] Robert Michael Tanner,et al. Minimum-distance bounds by graph analysis , 2001, IEEE Trans. Inf. Theory.

[5] Shu Lin,et al. Iterative decoding of one-step majority logic deductible codes based on belief propagation , 2000, IEEE Trans. Commun..