Year: 2026
Type: preprint
Abstract: We study binary quasi-cyclic LDPC codes whose parity-check matrices are full arrays of single circulant permutation matrices (CPMs), referred to here as CPM-LDPC codes. Their minimum distance is at most $(J+1)!$, where $J$ is the column weight. For every fixed pair of column and row weights $2\le J
Source: arXiv (Cornell University)
Author: Kasai, Kenta
Institution: Tokyo Institute of Technology
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7213414170
Cites:
Cited by:
Related to: