Quasi-cyclic LDPC codes with high girth
classification
💻 cs.IT
math.IT
keywords
codesldpcgirthhighquasi-cyclicachievementalgebraicclass
read the original abstract
We study a class of quasi-cyclic LDPC codes. We provide precise conditions guaranteeing high girth in their Tanner graph. Experimentally, the codes we propose perform no worse than random LDPC codes with their same parameters, which is a significant achievement for algebraic codes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.