On the dimensions of certain LDPC codes based on q-regular bipartite graphs

被引：10

作者：

Sin, Peter ^{[1
]}

Xiang, Qing

机构：

[1] Univ Florida, Dept Math, Gainesville, FL 32611 USA

[2] Univ Delaware, Dept Math Sci, Newark, DE 19716 USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2006年 / 52卷 / 08期

基金：

美国国家科学基金会;

关键词：

generalized quadrangle; incidence matrix; low-density parity check (LDPC) code; symplectic grou;

D O I：

10.1109/TIT.2006.878231

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

An explicit construction of a family of binary low-density parity check (LDPC) codes called LU(3, q), where q is a power of a prime, was recently given. A conjecture was made for the dimensions of these codes when q is odd. The conjecture is proved in this note. The proof involves the geometry of a four-dimensional (4-D) symplectic vector space and the action of the symplectic group and its subgroups.

引用

页码：3735 / 3737

页数：3

共 5 条

[1]

BAGCHI B, 1991, GEOMETRIAE DEDICATA, V39, P339

[2]

Curtis C. W., 1981, METHODS REPRESENTATI, VI

[3] Explicit construction of families of LDPC codes with no 4-cycles [J].