Results 81 to 90 of about 35,523 (280)
On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles [PDF]
IEEE Transactions on Information Theory, 2018 In this paper, we study the cycle distribution of random low-density parity-check (LDPC) codes, randomly constructed protograph-based LDPC codes, and random quasi-cyclic (QC) LDPC codes. We prove that for a random bipartite graph, with a given (irregular) degree distribution, the distributions of cycles of different length tend to independent Poisson ...
Ali Dehghan, Amir H. Banihashemi
openaire +3 more sources
Online fountain code with an improved caching mechanism
IET Communications, Volume 18, Issue 20, Page 1813-1825, December 2024.By catching some selected encoded symbols discarded in the original online fountain codes and giving an optimal degree selection strategy of encoded symbols, the proposed online fountain code improves the receiving rules of the encoded symbols. The proposed online codes outperform the state‐of‐art online fountain codes in terms of overhead factors ...
Yin Zhang +7 more
wiley +1 more source
Design of network-coding based multi-edge type LDPC codes for multi-source relaying systems [PDF]
arXiv, 2009 In this paper we investigate a multi-source LDPC scheme for a Gaussian relay system, where M sources communicate with the destination under the help of a single relay (M-1-1 system). Since various distributed LDPC schemes in the cooperative single-source system, e.g.
arxiv
, 2012 9 pages with Pseudo code and matrix correction ...
Mink, Alan, Nakassis, Anastase
openaire +2 more sources
Classical channel bandwidth requirements in continuous variable quantum key distribution systems
IET Quantum Communication, Volume 5, Issue 4, Page 601-611, December 2024.The reconciliation method for continuous variable quantum key distribution (CV‐QKD) systems is usually chosen based on its reconciliation efficiency. Nonetheless, one must also consider the requirements of each reconciliation method in terms of the amount of information transmitted on the classical channel. Such may limit the achievable key rates.
Margarida Almeida +3 more
wiley +1 more source
A Linear Fitting Density Peaks Clustering Algorithm for Image Segmentation
Tehnički Vjesnik, 2018 Clustering by fast search and finding of density peaks algorithm (DPC) is a recently developed method and can obtain promising results. However, DPC needs users to determine the number of clusters in advance, thus the clustering results are unstable and ...
You Zhou +4 more
doaj +1 more source
Study of Structured Root-LDPC Codes and PEG Techniques for Block-Fading Channels [PDF]
arXiv, 2015 In this work, we propose structured Root-Low-Density Parity-Check (LDPC) codes and design techniques for block-fading channels. In particular, Quasi-Cyclic Root-LDPC codes, Irregular repeat-accumulate Root-LDPC codes and Controlled Doping Root-LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels are proposed.
arxiv
High speed error correction for continuous-variable quantum key distribution with multi-edge type LDPC code [PDF]
Scientific Reports, 2017 Error correction is a significant step in postprocessing of continuous-variable quantum key distribution system, which is used to make two distant legitimate parties share identical corrected keys.
Xiangyu Wang +3 more
semanticscholar +1 more source
International Journal of Satellite Communications and Networking, Volume 42, Issue 6, Page 481-492, November/December 2024.ABSTRACT In this paper, simultaneous transmission on two orthogonal antenna polarizations in a polarization division multiplexing (PDM) fashion is studied for wideband satellite communication links using dual‐polarization satellite receivers for the purpose of doubling the data rate. In order to mitigate the cross‐polarization interference (XPI), a new
Svilen Dimitrov +2 more
wiley +1 more source
Non binary LDPC codes over the binary erasure channel: density evolution analysis [PDF]
arXiv, 2008 In this paper we present a thorough analysis of non binary LDPC codes over the binary erasure channel. First, the decoding of non binary LDPC codes is investigated. The proposed algorithm performs on-the-fly decoding, i.e. it starts decoding as soon as the first symbols are received, which generalizes the erasure decoding of binary LDPC codes. Next, we
arxiv