Naslov
LDPC codes from cubic semisymmetric graphs

Autori
Šimac, Marina ; Crnković, Dean ; Rukavina, Sanja

Vrsta, podvrsta i kategorija rada
Sažeci sa skupova, sažetak, znanstveni

Izvornik
Graphs and Groups, Geometries and GAP (G2G2) Summer School, Satellite event of the 8th European Congress of Mathematics, Report of Contributions / - , 2021, 14-14

Skup
Graphs and Groups, Geometries and GAP (G2G2-Summer School)

Mjesto i datum
Rogla, Slovenija, 27.06.2021. - 03.07.2021

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
LDPC code, cubic graph, semisymmetric graph

Sažetak
A regular graph is semisymmetric if it is edge- transitive but not vertex-transitive. A cubic semisymmetric graph is a 3-regular graph which is semisymmetric. It has been proved that every semisymmetric graph is necessarily bipartite graph. In this talk we study low-density parity- check (LDPC) codes having cubic semisymmetric graphs as their Tanner graphs. We will discuss some of the properties of the constructed codes and present bounds for the code parameters: code length, dimension and minimum distance. Further, we will discuss the structure of the smallest absorbing sets of these LDPC codes and give an expression for the variance of the syndrome weight of the constructed codes. Moreover, computational and simulation results on the constructed codes will be presented.

Izvorni jezik
Engleski

Znanstvena područja
Matematika

POVEZANOST RADA