Results 121 to 130 of about 1,780 (149)
Some of the next articles are maybe not open access.

Low-density parity check codes over GF(q)

IEEE Communications Letters, 1998
Gallager's (1962) low-density binary parity check codes have been shown to have near-Shannon limit performance when decoded using a probabilistic decoding algorithm. We report the empirical results of error-correction using the analogous codes over GF(q) for q>2, with binary symmetric channels and binary Gaussian channels.
M.C. Davey, D.J.C. MacKay
openaire   +1 more source

Low-Density Parity-Check Code Constructions

2014
Low-density parity-check (LDPC) codes are a class of linear block code capable of performing extremely close to the capacity of a channel as defined by Shannon. The purpose of this chapter is to provide an overview of the basic ideas, as well as the main results, in the field of LDPC code construction. No attempt could possibly be made to include every
PAOLINI, ENRICO, M. Flanagan
openaire   +1 more source

Low-Density Parity-Check (LDPC) Codes

2012
In this chapter, low-density parity-check (LDPC) codes, a class of powerful iteratively decodable error correcting codes, are introduced. The chapter first reviews some basic concepts and results in information theory such as Shannon’s channel capacity and channel coding theorem. It then overviews the Flash memory channel model.
openaire   +2 more sources

Low-density parity-check codes

IEEE Transactions on Information Theory, 1962
openaire   +2 more sources

Clinical and epidemiological issues in mammographic density

Nature Reviews Clinical Oncology, 2011
Valentina Assi   +2 more
exaly  

Computational predictions of energy materials using density functional theory

Nature Reviews Materials, 2016
Anubhav Jain   +2 more
exaly  

Home - About - Disclaimer - Privacy