Absorbing sets of codes from finite geometries

Allison Beemer, Kathryn Haymaker, Christine A. Kelley

Research output: Contribution to journalArticlepeer-review


We examine the presence of absorbing sets, fully absorbing sets, and elementary absorbing sets in low-density parity-check (LDPC) codes arising from certain classes of finite geometries. In particular, we prove the parameters of the smallest absorbing sets for finite geometry codes using a tree-based argument. Moreover, we obtain the parameters of the smallest absorbing sets for a special class of codes whose graphs are d-left-regular with girth g = 6 or g = 8.

Original languageEnglish (US)
Pages (from-to)1115-1131
Number of pages17
JournalCryptography and Communications
Issue number5
StatePublished - Sep 15 2019


  • Absorbing sets
  • Finite geometry LDPC codes
  • Tree bounds

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Absorbing sets of codes from finite geometries'. Together they form a unique fingerprint.

Cite this