Answers are grounded in this paper and cite their sources.
It is well known that both the minimum distances and stopping distances of LDPC codes are important measures of their performance. In this paper, we analyze the parameters of LDPC codes based on the totally isotropic subspaces of symplectic space and obtain the exact minimum distances and stopping distances of the codes under certain special circumstances. Additionally, we derive the upper and lower bounds on the dimensions of the resulting codes.
No takes yet. Share an insight, caveat, or question.
Feng et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: