On LDPC codes corresponding to affine parts of generalized polygons

DOI10.2478/v10065-011-0003-xzbMath1284.94153OpenAlexW2033253658MaRDI QIDQ2442948

Monika Polak, Vasiliy A. Ustimenko

Publication date: 2 April 2014

Published in: Annales Universitatis Mariae Curie-Skłodowska. Sectio A1. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/v10065-011-0003-x

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05)

Cites Work

• A Mathematical Theory of Communication
• New examples of graphs without small cycles and of large size
• Extremal properties of regular and affine generalized \(m\)-gons as tactical configurations
• Explicit construction of graphs with an arbitrary large girth and of large size
• A characterization of the components of the graphs \(D(k,q)\)
• A new series of dense graphs of high girth
• Fundamentals of Error-Correcting Codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item