New Classes of Partial Geometries and Their Associated LDPC Codes
From MaRDI portal
Abstract: The use of partial geometries to construct parity-check matrices for LDPC codes has resulted in the design of successful codes with a probability of error close to the Shannon capacity at bit error rates down to . Such considerations have motivated this further investigation. A new and simple construction of a type of partial geometries with quasi-cyclic structure is given and their properties are investigated. The trapping sets of the partial geometry codes were considered previously using the geometric aspects of the underlying structure to derive information on the size of allowable trapping sets. This topic is further considered here. Finally, there is a natural relationship between partial geometries and strongly regular graphs. The eigenvalues of the adjacency matrices of such graphs are well known and it is of interest to determine if any of the Tanner graphs derived from the partial geometries are good expanders for certain parameter sets, since it can be argued that codes with good geometric and expansion properties might perform well under message-passing decoding.
Cited in
(6)- LDPC codes from \(\mu\)-geodetic graphs obtained from block designs
- LDPC Codes From Generalized Polygons
- Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- Explicit non-malleable codes from bipartite graphs
- Regular LDPC codes from semipartial geometries
This page was built for publication: New Classes of Partial Geometries and Their Associated LDPC Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976743)
