LDPC codes from Deza digraphs
Glasnik Matematicki · 30.06.2026 · 61 (1) · 175-194
DOI: 10.3336/gm.61.1.08 ↗Kurz gefasst
Fachartikel in der Zeitschrift Glasnik Matematicki, online erschienen am 30.06.2026. Verfasst von Nina Mostarac und 1 weiteren Autor:innen. Die Arbeit nennt 21 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
Mostarac, N., & vSimac, M. (2026). LDPC codes from Deza digraphs. Glasnik Matematicki, 61(1), 175-194. https://doi.org/10.3336/gm.61.1.08
Vancouver
Mostarac N, vSimac M. LDPC codes from Deza digraphs. Glasnik Matematicki. 2026;61(1):175-194. doi:10.3336/gm.61.1.08
BibTeX
@article{Mostarac2026,
author = {Mostarac, Nina and vSimac, Marina},
title = {LDPC codes from Deza digraphs},
journal = {Glasnik Matematicki},
year = {2026},
volume = {61},
number = {1},
pages = {175--194},
doi = {10.3336/gm.61.1.08}
}
EUVIMED