Results 211 to 220 of about 37,023 (238)
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 (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

Aging and osteoporosis in breast and prostate cancer

Ca-A Cancer Journal for Clinicians, 2011
Ari VanderWalde
exaly  

Home - About - Disclaimer - Privacy