Construction of Quantum LDPC Codes From Classical Row-Circulant QC-LDPCs [PDF]
Classical row-circulant quasi-cyclic (QC) low-density parity check (LDPC) matrices are known to generate efficient high-rate short and moderate-length QC-LDPC codes, while the comparable random structures exhibit numerous short cycles of length-4. Therefore, we conceive a general formalism for constructing nondual-containing Calderbank–Shor–Steane (CSS)
Babar, Zunaira +4 more
openaire +3 more sources
OpenCL/CUDA Algorithms for Parallel Decoding of any Irregular LDPC Code using GPU
This article provides a scalable parallel approach of an iterative LDPC decoder. The proposed approach can be implemented in applications supporting massive parallel computing. The proposed mapping is suitable for decoding any irregular LDPC code without
J. Broulim +3 more
doaj +1 more source
ON THE CLASS OF ARRAY-BASED APM-LDPC CODES [PDF]
We construct an explicit class of affine permutation matrix low-density parity-check (APM-LDPC) codes based on the array parity-check matrix by using two affine maps f (x) = x-1 and g(x) = 2x-1 on Z_m, where m is an odd prime number, with girth 6 and ...
A. Nassaj, A. R. Naghipour
doaj +1 more source
Low-Density Parity-Check Codes From Transversal Designs With Improved Stopping Set Distributions [PDF]
This paper examines the construction of low-density parity-check (LDPC) codes from transversal designs based on sets of mutually orthogonal Latin squares (MOLS). By transferring the concept of configurations in combinatorial designs to the level of Latin
Er Gruner, Michael Huber, Student Member
core +1 more source
New Combinatorial Construction Techniques for Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes [PDF]
This paper presents several new construction techniques for low-density parity-check (LDPC) and systematic repeat-accumulate (RA) codes. Based on specific classes of combinatorial designs, the improved code design focuses on high-rate structured codes ...
Gruner, Alexander, Huber, Michael
core +1 more source
Full-Length Row-Multiplier QC-LDPC Codes With Girth Eight and Short Circulant Sizes
As a special case of a quasi-cyclic (QC) low-density parity-check (LDPC) code, a full-length row-multiplier (FLRM) QC-LDPC code is described by a compact exponent matrix based on two sequences of integers.
Juhua Wang +3 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
Fast Software Polar Decoders [PDF]
Among error-correcting codes, polar codes are the first to provably achieve channel capacity with an explicit construction. In this work, we present software implementations of a polar decoder that leverage the capabilities of modern general-purpose ...
Giard, Pascal +3 more
core +1 more source
Effective identification of dominant fully absorbing sets for Raptor-like LDPC codes
The error-rate floor of low-density parity-check (LDPC) codes is attributed to the trapping sets of their Tanner graphs. Among them, fully absorbing sets dominantly affect the error-rate performance, especially for short blocklengths.
Woncheol Cho +3 more
doaj +1 more source
Beyond 100 Gbit/s Pipeline Decoders for Spatially Coupled LDPC Codes
Low-density parity-check (LDPC) codes are a well-established class of forward error correction codes that provide excellent error correction performance for large code block sizes.
Matthias Herrmann, Norbert Wehn
doaj +1 more source

