LDPC Codes from -Geodetic Graphs Obtained from Block Designs

被引：0

作者：

Crnkovic, Dean ^{[1
]}

Rukavina, Sanja ^{[1
]}

Simac, Marina ^{[1
]}

机构：

[1] Univ Rijeka, Dept Math, Radmile Matejcic 1, Rijeka 51000, Croatia

来源：

GRAPHS AND COMBINATORICS | 2019年 / 35卷 / 02期

关键词：

LDPC code; -Geodetic graph; Block design; PARITY-CHECK CODES; CONSTRUCTION; BINARY;

D O I：

10.1007/s00373-019-02007-4

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In this paper we study low-density parity-check (LDPC) codes spanned by rows of the adjacency matrices of -geodetic graphs obtained from 2-(v,k,) designs. This construction can be applied to any 2-(v,k,) design, but in this paper we focus on the LDPC codes from -geodetic graphs obtained from 2-(v,3,) designs since their Tanner graphs are free of 4-cycles. We analyse some properties of the constructed LDPC codes and discuss code length, dimension and minimum distance. Further, we discuss absorbing sets of these LDPC codes and give an expression for the expectation of a syndrome weight of the constructed LDPC codes. Information on the constructed LDPC codes, such as their parameters, is presented as well.

引用

页码：451 / 469

页数：19

共 50 条

[41] Further Results on Existentially Closed Graphs Arising from Block Designs
Lu, Xiao-Nan
[J]. GRAPHS AND COMBINATORICS, 2019, 35 (06) : 1323 - 1335
[42] Further Results on Existentially Closed Graphs Arising from Block Designs
Xiao-Nan Lu
[J]. Graphs and Combinatorics, 2019, 35 : 1323 - 1335
[43] ON BLOCK-DESIGNS ARISING FROM RANK-3 GRAPHS
TONCHEV, VD
[J]. JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 1981, 5 (04) : 399 - 403
[44] From Product Codes to Structured Generalized LDPC Codes
Lentmaier, Michael
Liva, Gianluigi
Paolini, Enrico
Fettweis, Gerhard
[J]. 2010 5TH INTERNATIONAL ICST CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA (CHINACOM), 2010,
[45] Loop removal from LDPC codes
McGowan, JA
Williamson, RC
[J]. 2003 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS, 2003, : 230 - 233
[46] LDPC codes from the Hermitian curve
Pepe, Valentina
[J]. DESIGNS CODES AND CRYPTOGRAPHY, 2007, 42 (03) : 303 - 315
[47] New Symmetric (61,16,4) Designs Obtained from Codes
Crnkovic, Dean
Rukavina, Sanja
Tonchev, Vladimir D.
[J]. ALGEBRAIC DESIGN THEORY AND HADAMARD MATRICES, ADTHM, 2015, 133 : 61 - 69
[48] From LDPC to Chunked Network Codes
Yang, Shenghao
Tang, Bin
[J]. 2014 IEEE INFORMATION THEORY WORKSHOP (ITW), 2014, : 406 - 410
[49] Designs, strongly regular graphs and codes constructed from some primitive groups
Crnkovic, Dean
Crnkovic, Vedrana Mikulic
Rodrigues, B. G.
[J]. INFORMATION SECURITY, CODING THEORY AND RELATED COMBINATORICS: INFORMATION CODING AND COMBINATORICS, 2011, 29 : 231 - 252
[50] LDPC codes from Singer cycles
Giuzzi, Luca
Sonnino, Angelo
[J]. DISCRETE APPLIED MATHEMATICS, 2009, 157 (08) : 1723 - 1728

← 1 2 3 4 5 →