TYPE-II APM-LDPC CODES WITH GIRTH 6

In this paper, for the first time, Type-II APM-LDPC codes are presented as a class of APM-LDPC codes whose parity-check matrices (PCMs) include blocks comprising by combining two non-overlapping APMs. Then, some conditions are provided to give Type-II APM-LDPC codes with girth at least 6 and a table containing of the 4-cycle free constructed codes with will be given.

Authors

Institutions

Publication Details

Journal
Facta Universitatis Series Mathematics and Informatics
Published
2024-12-13
DOI
https://doi.org/10.22190/fumi230814045g
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

TYPE-II APM-LDPC CODES WITH GIRTH 6

Zahra Gholami, Mohammad Gholami
Facta Universitatis Series Mathematics and Informatics
Coding theory and cryptography
article

TYPE-II APM-LDPC CODES WITH GIRTH 6

Zahra Gholami, Mohammad Gholami
article en

Abstract

In this paper, for the first time, Type-II APM-LDPC codes are presented as a class of APM-LDPC codes whose parity-check matrices (PCMs) include blocks comprising by combining two non-overlapping APMs. Then, some conditions are provided to give Type-II APM-LDPC codes with girth at least 6 and a table containing of the 4-cycle free constructed codes with will be given.

Facta Universitatis Series Mathematics and Informatics
Shahrekord University (IR), University of Isfahan (IR)
Shahrekord University, University of Isfahan
Openalex Percentile: Top 76%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.