LDPC Codes Based on Algebraic Graphs

Monika Polak, Vasyl Ustimenko

Abstract


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].

Full Text:

PDF


DOI: http://dx.doi.org/10.2478/v10065-012-0034-y
Date of publication: 2012-01-01 00:00:00
Date of submission: 2016-04-28 09:08:11


Statistics


Total abstract view - 482
Downloads (from 2020-06-17) - PDF - 0

Indicators



Refbacks

  • There are currently no refbacks.


Copyright (c) 2015 Annales UMCS Sectio AI Informatica

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.