LDPC Codes Based on Algebraic Graphs
Monika Polak, Vasyl Ustimenko · Annales Universitatis Mariae Curie-Sklodowska sectio AI – Informatica · 2012
In this paper we investigate correcting properties of LDPC codes obtained from families of algebraic graphs. The graphs considered in this article come from the infinite incidence structure. We describe how to construct these codes, choose the parameters and present several simulations, done by using the MAP decoder. We describe how error correcting properties are dependent on the graph structure. We compare our results with the currently used codes, obtained by Guinand and Lodge [1] from the family of graphs D(k; q), which were constructed by Ustimenko and Lazebnik [2].