A class of LDPC codes based on symplectic space over finite fields
Yanan Feng, Chuchen Tang · Advances in Mathematics of Communications · 2025
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.