.png){kind=icon}
.png){kind=icon}
Return
LDPC Codes from Deza Graphs
.png){kind=icon}
PRE
AI
DOI：10.1134/S0032946025030019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We give a construction of LDPC codes from Deza graphs with parameters \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$(v,k,1,0)$\end{document}. The Tanner graphs of these LDPC codes do not contain cycles of length 4. Special attention is given to the construction of LDPC codes from the Moore graphs with diameter 2. We identify and enumerate the smallest absorbing sets in the Tanner graphs of the obtained LDPC codes and analyze their structures. Furthermore, we describe a construction, based on the protograph operation, of an infinite family of LDPC codes, whose Tanner graphs have girth at least 6, obtained from each \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$(v,k,1,0)$\end{document} Deza graph. We give an expression for the variance of a syndrome weight of the constructed LDPC codes, and also present simulation results.
Keywords:
LDPC code
Deza graph
Moore graph
strongly regular graph
Journal
P
IF:
0.9
Papers:
6
Citations:
0