Absorbing set analysis of codes from affine planes

DOI10.1007/978-3-319-66278-7_14MaRDI QIDQ1705521zbMATH OpenOpenAlexFDO

Authors Kathryn Haymaker

Publication date 16 March 2018

Full work available at URL https://doi.org/10.1007/978-3-319-66278-7_14

zbMATH Keywords

absorbing setsEuclidean geometriesfinite planesfinite geometry LDPC codesfully absorbing sets

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Absorbing sets of codes from finite geometries
• Extremal absorbing sets in low-density parity-check codes
• LDPC codes associated with linear representations of geometries
• High-Rate Quasi-Cyclic Low-Density Parity-Check Codes Derived From Finite Affine Planes
• LDPC codes generated by conics in the classical projective plane

Cited in

(4)

• Absorbing sets of codes from finite geometries
• On the Smallest Absorbing Sets of LDPC Codes From Finite Planes
• Extremal absorbing sets in low-density parity-check codes
• On a generalization of both affine planes and MDS-codes with applications to experiment planning

This page was built for publication: Absorbing set analysis of codes from affine planes

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