Results 71 to 80 of about 9,106 (209)
This paper evaluates Cascade and LDPC codes for information reconciliation in industrial quantum key distribution systems. We highlight efficient methods for minimising key mismatches and optimising performance by analysing often overlooked aspects and proposing new metrics.
Ronny Mueller +7 more
wiley +1 more source
Doped low-density parity-check codes
In this paper, we propose a doping approach to lower the error floor of Low-Density Parity-Check (LDPC) codes. The doping component is a short block code in which the information bits are selected from the coded bits of the dominant trapping sets of the ...
Yong Li +5 more
doaj +1 more source
Implementation for Two-Stage Hybrid Decoding for Low Density Parity Check (LDPC) Codes
ABSTRACT LDPC codes are gaining high attention in Channel Coding field these days. However, one of the main problems facing usage of these codes in communication systems is the high complexity decoding scheme that results in high decoding delay. Such delay is not acceptable in some applications that depend on time such as video transmission. This paper
G. Gomah, A. Zekry, Hend A.Orabi
openaire +1 more source
A novel secure image transmission scheme has been proposed using the logistic chaos map and the Ekert protocol. The quantum key distribution can be used to generate seed parameters for classical chaos, thus ensuring a strong encryption method. ABSTRACT The emergence of quantum computing has introduced unprecedented security challenges to conventional ...
Raiyan Rahman +4 more
wiley +1 more source
An Efficient Construction Method for Quasi-Cyclic Low Density Parity Check Codes
In this paper, we propose an optimized belief propagation (OBP) based progressive edge-growth (PEG) method for constructing quasi-cyclic low density parity check (QC-LDPC) codes. In this proposed method, Tanner graphs are built by progressively appending
Yiming Lei, Mingke Dong
doaj +1 more source
Delay-Exponent of Bilayer Anytime Code
In this paper, we study the design and the delay-exponent of anytime codes over a three terminal relay network. We propose a bilayer anytime code based on anytime spatially coupled low-density parity-check (LDPC) codes and investigate the anytime ...
Lechner, Gottfried +2 more
core +1 more source
Methods of Sparse Measurement Matrix Optimization for Compressed Sensing
In compressed sensing (CS), a sparse measurement matrix with few nonzero entries is more competitive than a dense matrix in reducing the number of multiplication units. Recent studies indicate that an optimized measurement matrix having low coherence with a specified dictionary can significantly improve the reconstruction performance.
Renjie Yi +5 more
wiley +1 more source
Perbandingan Kinerja LDPC (Low Densiti Parity Check) Dengan Metode Decoding Bit Flip Pada Kanal AWGN dengan Multipath Fading [PDF]
As an effect of the globalization era, telecomunication technology, especially in wireless comunication system is forced to prepare high data rate with reliable Quality of Services (QOS) with Low Bit Error Rate (BER) and very small power.
Moegiharto, Yoedy, PRASETYO, BENY NUR
core
Shortened Array Codes of Large Girth
One approach to designing structured low-density parity-check (LDPC) codes with large girth is to shorten codes with small girth in such a manner that the deleted columns of the parity-check matrix contain all the variables involved in short cycles. This
Kashyap, Navin +2 more
core +2 more sources
Blind Recognition Algorithm of Convolutional Code via Convolutional Neural Network
Pointing at the vexed question of blind recognition in the convolutional code class, this paper proposes a convolutional code blind identification method via convolutional neural networks (CNNs). First, this algorithm uses the traditional method to generate different convolutional codes, and the feature extraction algorithm adopts the theorem of Euclid’
Pan Deng +6 more
wiley +1 more source

