Abstract
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 analyze the absorbing set spectra of LDPC codes from finite Euclidean planes. For some parameters, we classify the absorbing sets present and give exact counts on their multiplicities.
Author supplied keywords
Cite
CITATION STYLE
Haymaker, K. (2017). Absorbing set analysis of codes from affine planes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10495 LNCS, pp. 154–162). Springer Verlag. https://doi.org/10.1007/978-3-319-66278-7_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
