Results 31 to 40 of about 18,127 (206)
Nonbinary Spatially-Coupled LDPC Codes on the Binary Erasure Channel [PDF]
We analyze the asymptotic performance of nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group, when the transmission takes place over the binary erasure channel.
Amat, Alexandre Graell i +2 more
core +2 more sources
Qudit low-density parity-check codes [PDF]
Qudits offer significant advantages over qubit-based architectures, including more efficient gate compilation, reduced resource requirements, improved error-correction primitives, and enhanced capabilities for quantum communication and cryptography. Yet,
Daniel J. Spencer +4 more
doaj +1 more source
An optimized initialization for LDPC decoding over GF(q) in impulsive noise environments.
Modern navigation satellite communication has the characteristic of high transmitting rate. To avoid bit errors in data transmission, low density parity check (LDPC) codes are widely recognized as efficient ways for navigation communication ...
Haoqiang Liu +3 more
doaj +1 more source
Tanner
Girth plays an important role in the design of low-density parity-check (LDPC) codes. Motivated by the works on the girth of some classes of Tanner quasi-cyclic (QC) LDPC codes, e.g., Tanner (3, 5), (3, 7), (3, 11), and (5, 7) codes, we, in this paper ...
Hengzhou Xu +4 more
doaj +1 more source
ANALYSIS OF CORRECTIVE PROPERTIES OF ULTRA-LONG LDPC CODES
The ultra-long LPDC codes are examined. The errors correction by ultra-long LDPC codes is analyzed. The error-correcting capability research method for ultra-long LDPC codes is described in details. The main results in table and graph representations are
Leonid Uryvskyi, Serhii Osypchuk
doaj +1 more source
Non-Binary LDPC Codes with Large Alphabet Size
We study LDPC codes for the channel with input ${x}\in \mathbb{F}_q^m$ and output ${y}={x}+{z}\in \mathbb{F}_q^m$. The aim of this paper is to evaluate decoding performance of $q^m$-ary non-binary LDPC codes for large $m$.
Kasai, Kenta +2 more
core +1 more source
Entanglement-assisted quantum low-density parity-check codes [PDF]
This paper develops a general method for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory.
C. J. Colbourn +25 more
core +4 more sources
Improving the efficiency of the LDPC code-based McEliece cryptosystem through irregular codes
We consider the framework of the McEliece cryptosystem based on LDPC codes, which is a promising post-quantum alternative to classical public key cryptosystems.
Baldi, Marco +3 more
core +1 more source
A Resource Efficient Ising Model‐Based Quantum Sudoku Solver
ABSTRACT Background Quantum algorithms exploit superposition and parallelism to address complex combinatorial problems, many of which fall into the non‐polynomial (NP) class. Sudoku, a widely known logic‐based puzzle, is proven to be NP‐complete and thus presents a suitable testbed for exploring quantum optimization approaches.
Wen‐Li Wang +5 more
wiley +1 more source
An unequal error protection scheme for non-binary LDPC using statistical QAM and prioritized mapping [PDF]
Low Density Parity Check (LDPC) codes are among the most popular channel codes used nowadays because of their ability to achieve near channel capacity performances.
Indoonundon Madhavsingh +1 more
doaj +1 more source

