Speaker
Nina Mostarac
(Faculty of Mathematics, University of Rijeka)
Description
In this talk we will describe binary LDPC LCD codes spanned by the adjacency matrices of the odd graphs as their parity-check matrices. For the odd graph $O_n$ ($n\geq 3$), the obtained code $C_n$ is an $(n,n)$-regular binary LDPC code of length ${2n-1 \choose n-1}$, dimension ${2n-2 \choose n-2}$, minimum distance $n+1$ and girth equal to $6$, which is also an LCD code (i.e. $C_n\cap C_n^{\bot}=\{0\}$).
Primary authors
Andrea Švob
(Faculty of Mathematics, University of Rijeka)
Dean Crnković
Nina Mostarac
(Faculty of Mathematics, University of Rijeka)
