Results 41 to 50 of about 23,935 (248)

Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes

open access: yes, 2008
In this paper, a simple, general-purpose and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented.
Chiani, M., Paolini, E.
core   +1 more source

Optical Neuromorphic Technology Catalyzes the Next‐Generation Mobile Communication Technology

open access: yesAdvanced Intelligent Systems, Volume 7, Issue 11, November 2025.
Advancements in optical computing could revolutionize next‐generation wireless communication. The review highlights the role of photonic integrated circuits in implementing neural network operations and discusses their benefits, such as high computational density.
Xiaoxiong Song   +6 more
wiley   +1 more source

Digital image information hiding algorithm research based on LDPC code

open access: yesEURASIP Journal on Image and Video Processing, 2018
LDPC (low-density parity-check code) is a parity check code, and its performance is very close to Shannon limit. It is a sort of good channel code which has good ability of error correction. The coding can be introduced to an information-hiding algorithm
Zhong-xun Wang, Xiang-cai Meng
doaj   +1 more source

PERBANDINGAN KINERJA LDPC PADA KANAL AWGN DENGAN MODULASI QPSK DAN BPSK [PDF]

open access: yes, 2011
Low Density Parity Check (LDPC) codes are one class of linear block coding techniques. The name comes from the characteristics of the LDPC parity check matrix was that only contain a little bit of '1 'if compared with the number of bits of '0'.
ILMIAWAN, SHAHIH, Moegiharto, Yoedy
core  

Analysis of reaction and timing attacks against cryptosystems based on sparse parity-check codes

open access: yes, 2019
In this paper we study reaction and timing attacks against cryptosystems based on sparse parity-check codes, which encompass low-density parity-check (LDPC) codes and moderate-density parity-check (MDPC) codes.
A Becker   +16 more
core   +1 more source

Dynamic Continuous Variable Quantum Key Distribution for Securing a Future Global Quantum Network

open access: yesAdvanced Quantum Technologies, Volume 8, Issue 10, October 2025.
The article explores securing a dynamic global quantum network using continuous variable QKD, proposing a unified three‐layer network architecture for integrating existing QKD networks. It evaluates secret key rates across various channels and introduces the link capacity as a metric for determining the optimum path for secret key distribution in a ...
Mikhael T. Sayat   +4 more
wiley   +1 more source

Spatially-Coupled Random Access on Graphs [PDF]

open access: yes, 2012
In this paper we investigate the effect of spatial coupling applied to the recently-proposed coded slotted ALOHA (CSA) random access protocol. Thanks to the bridge between the graphical model describing the iterative interference cancelation process of ...
Chiani, Marco   +4 more
core   +1 more source

Acceleration of low density parity check code (LDPC) decoding by successive overrelaxations [PDF]

open access: yesElectronics Letters, 2018
Belief propagation and variants are the usual decoding algorithms for low‐density parity check codes. The successive overrelaxations are applied to increase the convergence speed of the decoding process. Performances are reported and improvements over the reference algorithms are observed.
openaire   +2 more sources

QMM‐Enhanced Error Correction: Demonstrating Reversible Imprinting and Retrieval for Robust Quantum Computation

open access: yesAdvanced Quantum Technologies, Volume 8, Issue 9, September 2025.
Hardware experiments show a single‐layer Quantum Memory Matrix booster cuts logical error sixfold and, when prepended to a [3,1,3]$[3,1,3]$ repetition code, attains 94 % logical fidelity without extra CX gates. QMM dressing also lowers variational‐training loss by 35 %, offering a measurement‐free, resource‐light route to error suppression on NISQ ...
Florian Neukart   +3 more
wiley   +1 more source

An Efficient Method to Construct Parity-Check Matrices for Recursively Encoding Spatially Coupled LDPC Codes †

open access: yesEntropy, 2016
Spatially coupled low-density parity-check (LDPC) codes have attracted considerable attention due to their promising performance. Recursive encoding of the codes with low delay and low complexity has been proposed in the literature but with constraints ...
Zhongwei Si, Sijie Wang, Junyang Ma
doaj   +1 more source

Home - About - Disclaimer - Privacy