Novel algorithm to construct QC-LDPC codes for high data rate applications

BP Vairaperumal, T Chandrapragasam - Informatica, 2023 - informatica.si
A novel algorithm to construct highly sparse, quasi-cyclic low-density parity check codes with
large girth and high code rates that can be employed in high data rate applications is …

Design of capacity-approaching low-density parity-check codes using recurrent neural networks

E Nisioti, N Thomos - arXiv preprint arXiv:2001.01249, 2020 - arxiv.org
In this paper, we model Density Evolution (DE) using Recurrent Neural Networks (RNNs)
with the aim of designing capacity-approaching Irregular Low-Density Parity-Check (LDPC) …

Detection and removal of cycles in LDPC codes

N Farheen - 2018 - spectrum.library.concordia.ca
Information technology, at present has thrived to great aspects and every day more
beneficiary of this blessing is being connected to the modern invention and technology. With …

Оценка параметров бирегулярных двудольных графов

ЕА шульгина - Интеллектуальные системы. Теория и приложения, 2016 - mathnet.ru
В данной работе доказана нижняя оценка числа вершин (t, s)-бирегулярных графов
обхвата 6 при 2< t< s. Придуман алгоритм построения (t, s)-бирегулярных графов …

[PDF][PDF] Recursive Constructions of Graphs of Large Girth and Given Degree.

LC Eze, R Jajcay - ITAT, 2022 - ceur-ws.org
This paper is devoted to recursive constructions of small regular graphs of given degree 𝑘
and girth 𝑔, called (𝑘, 𝑔)-graphs, using Cayley graphs, perfect matchings and/or voltage …

Prototype Development in General Purpose Representation and Association Machine Using Communication Theory

H Li - 2017 - stars.library.ucf.edu
Biological system study has been an intense research area in neuroscience and cognitive
science for decades of years. Biological human brain is created as an intelligent system that …