Izvorni znanstveni članak

https://doi.org/10.3336/gm.61.1.08

LDPC codes from Deza digraphs

Nina Mostarac orcid.org/0000-0001-5626-1849 ; Faculty of Mathematics, University of Rijeka, 51 000 Rijeka, Croatia
Marina Šimac ; Faculty of Mathematics, University of Rijeka, 51 000 Rijeka, Croatia

Preuzmi JATS datoteku

Sažetak

In this paper, we present a construction of LDPC codes obtained from Deza digraphs with parameters \((n,k,0,1)\). The obtained LDPC codes have no cycles of length four in the Tanner graphs corresponding to the adjacency matrices of the Deza digraphs as parity-check matrices. We describe how LDPC codes can be obtained by applying the Cartesian product of certain Deza digraphs, and the Kronecker product of an adjacency matrix of a Deza digraph with parameters \((n,k,0,1)\) or \((n,k,1,1)\) and a permutation matrix. We also use several other combinatorial objects in the construction of LDPC codes.

Ključne riječi

Linear code, LDPC code, Deza digraph

Hrčak ID:

348194

URI

https://hrcak.srce.hr/348194

Datum izdavanja:

28.6.2026.

Posjeta: 0 *