Results 181 to 190 of about 12,374 (228)

Design of Low-Latency Layered Normalized Minimum Sum Low-Density Parity-Check Decoding Based on Entropy Feature for NAND Flash-Memory Channel. [PDF]

Entropy (Basel)
Li Y, Hu H.
europepmc   +1 more source

Optimization by decoded quantum interferometry. [PDF]

Nature
Jordan SP, Shutty N, Wootters M, Zalcman A, Schmidhuber A, King R, Isakov SV, Khattar T, Babbush R.   +8 more
europepmc   +1 more source

Performance analysis of concatenated Reed-Solomon and next generation polar codes for 6G communication systems. [PDF]

Sci Rep
Wondimu E, Annamalai P, Gared F.
europepmc   +1 more source

Estimation of the Impulse Response of the AWGN Channel with ISI within an Iterative Equalization and Decoding System That Uses LDPC Codes. [PDF]

Entropy (Basel)
Cuc AM, Morgoș FL, Grava AM, Grava C.
europepmc   +1 more source

Pragmatic soft-decision data readout of encoded large DNA. [PDF]

Brief Bioinform
Ge Q, Qin R, Liu S, Guo Q, Han C, Chen W.   +5 more
europepmc   +1 more source

Generalized Adaptive Diversity Gradient Descent Bit-Flipping with a Finite State Machine. [PDF]

Entropy (Basel)
Milojković J, Brkić S, Ivaniš P, Vasić B.   +3 more
europepmc   +1 more source

LDPC-cat codes for low-overhead quantum computing in 2D. [PDF]

Nat Commun
Ruiz D, Guillaud J, Leverrier A, Mirrahimi M, Vuillot C.   +4 more
europepmc   +1 more source

Quasi-cyclic generalized ldpc codes with low error floors

IEEE Transactions on Communications, 2008
In this paper, a novel methodology for designing structured generalized LDPC (G-LDPC) codes is presented. The proposed design results in quasi-cyclic G-LDPC codes for which efficient encoding is feasible through shift-register-based circuits.
Gianluigi Liva, W E Ryan, Marco Chiani   +2 more
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Enumerators for Protograph-Based Ensembles of LDPC and Generalized LDPC Codes

IEEE Transactions on Information Theory, 2011
Protograph-based LDPC and generalized LDPC (G-LDPC) codes have the advantages of a simple design procedure and highly structured encoders and decoders. The design of such “protograph-based codes” relies on what is effectively a computer-based search. As such, following Gallager, it is prudent to restrict the search to a “good ensemble,” for example, an
Shadi Abu-Surra, Dariush Divsalar, W E Ryan   +2 more
exaly   +2 more sources

Deriving Good LDPC Convolutional Codes from LDPC Block Codes [PDF]

IEEE Transactions on Information Theory, 2011
Low-density parity-check (LDPC) convolutional codes are capable of achieving excellent performance with low encoding and decoding complexity. In this paper we discuss several graph-cover-based methods for deriving families of time-invariant and time-varying LDPC convolutional codes from LDPC block codes and show how earlier proposed LDPC convolutional ...
Ali Emre Pusane, Roxana Smarandache, Daniel J Costello   +2 more
exaly   +3 more sources