Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

LDPC codes constructed from cubic symmetric graphs (CROSBI ID 315243)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Crnković, Dean ; Rukavina, Sanja ; Šimac, Marina LDPC codes constructed from cubic symmetric graphs // Applicable algebra in engineering communication and computing, 33 (2022), 5; 505-522. doi: 10.1007/s00200-020-00468-2

Podaci o odgovornosti

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

engleski

LDPC codes constructed from cubic symmetric graphs

Low-density parity-check (LDPC) codes have been the subject of much interest due to the fact that they can perform near the Shannon limit. In this paper we present a construction of LDPC codes from cubic symmetric graphs. The codes constructed are (3, 3)-regular and the vast majority of the corresponding Tanner graphs have girth greater than four. We analyse properties of the codes obtained and present bounds for the code parameters, the dimension and the minimum distance. Furthermore, we give an expression for the variance of the syndrome weight of the codes constructed. Information on the LDPC codes constructed from bipartite cubic symmetric graphs with less than 200 vertices is presented as well. Some of the codes constructed are optimal, and some have an additional property of being self-orthogonal or linear codes with complementary dual (LCD codes).

LDPC code ; Cubic graph ; Arc-transitive graph ; Bipartite graph

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

33 (5)

2022.

505-522

objavljeno

0938-1279

1432-0622

10.1007/s00200-020-00468-2

Povezanost rada

Matematika

Poveznice
Indeksiranost