Extremal absorbing sets in low-density parity-check codes

DOI10.3934/AMC.2021003MaRDI QIDQ6112248zbMATH OpenFDO

Authors Emily McMillon, Allison Beemer, Christine A. Kelley

Publication date 7 July 2023

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/AMC.2021003

zbMATH Keywords

absorbing setsdecodingiterative decodinglow-density parity-check codeTanner graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Linear codes (general theory) (94B05)

Recommendations

• On the Smallest Absorbing Sets of LDPC Codes From Finite Planes
• Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes
• Absorbing sets of codes from finite geometries
• Absorbing set analysis of codes from affine planes
• A characterization of codes with extreme parameters
• The Cycle Consistency Matrix Approach to Absorbing Sets in Separable Circulant-Based LDPC Codes
• Sharp Bounds for Optimal Decoding of Low-Density Parity-Check Codes
• Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes
• On ensembles of low-density parity-check codes: asymptotic distance distributions

Cites work

• A Mathematical Theory of Communication
• A recursive approach to low complexity codes
• Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes
• Connectivity of cages
• Dynamic cage survey
• Finite-length analysis of low-density parity-check codes on the binary erasure channel
• From Cages to Trapping Sets and Codewords: A Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes
• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• scientific article; zbMATH DE number 1439410 (Why is no real title available?)
• On the stopping distance and the stopping redundancy of codes
• Pseudocodewords of Tanner Graphs
• The history of degenerate (bipartite) extremal graph problems
• The size of bipartite graphs with a given girth
• Using Linear Programming to Decode Binary Linear Codes

Cited in

(6)

• Absorbing set analysis of codes from affine planes
• Absorbing sets of codes from finite geometries
• On the Smallest Absorbing Sets of LDPC Codes From Finite Planes
• LDPC LCD codes from odd graphs
• Parity-check codes from disjunct matrices
• LDPC codes from Deza digraphs

This page was built for publication: Extremal absorbing sets in low-density parity-check codes

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