摘要
低密度的同等值检查(LDPC ) 的三个家庭代码基于 symplectic 的完全各向同性的 subspaces 被构造，在有限的地上的单一、直角的空格分别地。在一些特殊情况中的 LDPC 法律的三个家庭的最小的距离被解决。
Three families of low-density parity-check （LDPC） codes are constructed based on the totally isotropic subspaces of symplectic, unitary, and orthogonal spaces over finite fields, respectively. The minimum distances of the three families of LDPC codes in some special cases are settled.
基金
This work was supported in part by the National Natural Science Foundation of China （Grant Nos. 11271004, 11371121, 11471096）.
