Absorbing sets of codes from finite geometries
From MaRDI portal
Publication:2325309
DOI10.1007/s12095-019-0353-6zbMath1419.94063OpenAlexW2911389346WikidataQ128504009 ScholiaQ128504009MaRDI QIDQ2325309
Allison Beemer, Kathryn Haymaker, Christine A. Kelley
Publication date: 25 September 2019
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-019-0353-6
Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Absorbing set analysis of codes from affine planes
- Explicit Concentrators from Generalized N-Gons
- Using Linear Programming to Decode Binary Linear Codes
- On the stopping distance and the stopping redundancy of codes
- Codes on finite geometries
- Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights
- Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes
- A recursive approach to low complexity codes
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- Finite-length analysis of low-density parity-check codes on the binary erasure channel
- Finite Geometry and Combinatorial Applications
- On the Smallest Absorbing Sets of LDPC Codes From Finite Planes
- LDPC Codes on Partial Geometries: Construction, Trapping Set Structure, and Puncturing
This page was built for publication: Absorbing sets of codes from finite geometries
