Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Physical Sciences and Mathematics
Extremal Absorbing Sets In Low-Density Parity-Check Codes, Emily Mcmillon, Allison Beemer, Christine A. Kelley
Extremal Absorbing Sets In Low-Density Parity-Check Codes, Emily Mcmillon, Allison Beemer, Christine A. Kelley
Department of Mathematics: Faculty Publications
Absorbing sets are combinatorial structures in the Tanner graphs of low-density parity-check (LDPC) codes that have been shown to inhibit the high signal-to-noise ratio performance of iterative decoders over many communication channels. Absorbing sets of minimum size are the most likely to cause errors, and thus have been the focus of much research. In this paper, we determine the sizes of absorbing sets that can occur in general and left-regular LDPC code graphs, with emphasis on the range of b for a given a for which an (a, b)-absorbing set may exist. We identify certain cases of extremal …