Upper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes Revisited
classification
💻 cs.IT
math.IT
keywords
codesdistanceminimumboundscodeldpcquasi-cyclicupper
read the original abstract
Two upper bounds on the minimum distance of type-1 quasi-cyclic low-density parity-check (QC LDPC) codes are derived. The necessary condition is given for the minimum code distance of such codes to grow linearly with the code length.
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.