On LDPC codes corresponding to affine parts of generalized polygons

Authors:
Monika Polak;Vasyl Ustimenko
Affiliations:
Institute of Mathematics, Maria Curie-Sklodowska University, pl. M. Curie-Sklodowskiej 1, 20-031 Lublin, Poland;Institute of Mathematics, Maria Curie-Sklodowska University, pl. M. Curie-Sklodowskiej 1, 20-031 Lublin, Poland
Venue:
Annales UMCS, Informatica - Cryptography and data protection
Year:
2011

Citing 6
Cited 0

New examples of graphs without small cycles and of large size

European Journal of Combinatorics - Special issue: association schemes
Explicit construction of graphs with an arbitrary large girth and of large size

Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
A characterization of the components of the graphs D(k,q)

Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Extremal properties of regular and affine generalized m-gons as tactical configurations

European Journal of Combinatorics
A Mathematical Theory of Communication

A Mathematical Theory of Communication
Advances in Coding Theory and Crytography

Advances in Coding Theory and Crytography

Quantified Score

Hi-index	0.03

Visualization

Abstract

In this paper we describe how to use special induced subgraphs of generalized m-gons to obtain the LDPC error correcting codes. We compare the properties of codes related to the affine parts of q-regular generalised 6-gons with the properties of known LDPC codes corresponding to the graphs D(5, q).