Extremal absorbing sets in low-density parity-check codes

DOI10.3934/amc.2021003zbMath1520.94088MaRDI QIDQ6112248

Emily McMillon, Christine A. Kelley, Allison Beemer

Publication date: 7 July 2023

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

zbMATH Keywords

decodingabsorbing setsiterative decodingTanner graphlow-density parity-check code

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• The size of bipartite graphs with a given girth
• Dynamic cage survey
• Using Linear Programming to Decode Binary Linear Codes
• On the stopping distance and the stopping redundancy of codes
• Pseudocodewords of Tanner Graphs
• A recursive approach to low complexity codes
• Connectivity of cages
• Finite-length analysis of low-density parity-check codes on the binary erasure channel
• Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes
• 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
• The History of Degenerate (Bipartite) Extremal Graph Problems