2000 character limit reached
Upper Bounds on the Minimum Distance of Quasi-Cyclic LDPC codes Revisited
Published 9 Jan 2014 in cs.IT and math.IT | (1401.2120v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
