Local directed strongly regular graphs and LDPC codes based on projective geometry

DOI10.11845/SXJZ.2015039BMaRDI QIDQ5367655zbMATH OpenOpenAlexFDO

Authors Yanan Feng, Shuxia Liu, Li Wei Zeng

Publication date 20 October 2017

Full work available at URL http://www.oaj.pku.edu.cn/sxjz/EN/10.11845/sxjz.2015039b

zbMATH Keywords

\(1\frac{1}{2}\)-designLDPC codelocal directed strongly regular graphprojective space

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Association schemes, strongly regular graphs (05E30) Combinatorial structures in finite projective spaces (51E20) Linear codes (general theory) (94B05)

Recommendations

• LDPC codes generated by conics in the classical projective plane
• LDPC codes associated with linear representations of geometries
• Linear representations of finite geometries and associated LDPC codes
• LDPC codes from \(\mu\)-geodetic graphs obtained from block designs
• Some low-density parity-check codes derived from finite geometries

Cited in

(1)

• Optimal folding of data flow graphs based on finite projective geometry using vector space partitioning

This page was built for publication: Local directed strongly regular graphs and LDPC codes based on projective geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5367655)