Results 41 to 50 of about 2,460,873 (298)
LDPC Codes Achieve List Decoding Capacity [PDF]
We show that Gallager's ensemble of Low-Density Parity Check (LDPC) codes achieves list-decoding capacity with high probability. These are the first graph-based codes shown to have this property.
Jonathan Mosheiff+4 more
semanticscholar +1 more source
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
This paper presents four different integer sequences to construct quasi-cyclic low-density parity-check (QC-LDPC) codes with mathematical theory. The paper introduces the procedure of the coding principle and coding.
Yan Zhang, Feng-fan Yang, Weijun Song
doaj +1 more source
New Construction of Low-Density Parity-Check Codes Based on Vector Space Over Finite Fields
Low-Density Parity-Check (LDPC) codes have low linear decoding complexity, which is a kind of good codes with excellent performance. Therefore, LDPC codes have great research value.
Xuemei Liu, Lihua Jia
doaj +1 more source
Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights [PDF]
We present a tree-based construction of LDPC codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding.
Kelley, Christine+2 more
core +4 more sources
Partitioning qubits in hypergraph product codes to implement logical gates [PDF]
The promise of high-rate low-density parity check (LDPC) codes to substantially reduce the overhead of fault-tolerant quantum computation depends on constructing efficient, fault-tolerant implementations of logical gates on such codes.
Armanda O. Quintavalle+2 more
doaj +1 more source
Augmented decoders for LDPC codes [PDF]
Abstract The performance of a belief propagation decoder for low-density parity-check codes is limited by the presence of trapping sets in the code’s graph. This leads to an error floor at higher signal-to-noise ratios. We propose the use of an augmented decoder which operates by iteratively decoding on a set of graphs which have a subset of repeated ...
Alex R. Rigby+4 more
openaire +4 more sources
On fuzzy syndrome hashing with LDPC coding [PDF]
The last decades have seen a growing interest in hash functions that allow some sort of tolerance, e.g. for the purpose of biometric authentication. Among these, the syndrome fuzzy hashing construction allows to securely store biometric data and to perform user authentication without the need of sharing any secret key.
Baldi M.+4 more
openaire +4 more sources
Block Markov superposition transmission of LDPC codes
In this paper, based on the block Markov superposition transmission (BMST) technique, we present a new class of coupled low-density parity-check (LDPC) codes for the transport block (TB)-based transmission to improve the error-correcting performance. For
Qianfan Wang, Kongjing Guo, Xiao Ma
doaj
On the Minimum Distance of Generalized Spatially Coupled LDPC Codes [PDF]
Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes.
Costello Jr, Daniel J.+2 more
core +2 more sources