1999
DOI: 10.1109/18.748992
|View full text |Cite
|
Sign up to set email alerts
|

Good error-correcting codes based on very sparse matrices

Abstract: We study two families of error-correcting codes defined in terms of very sparse matrices. "MN" (MacKay-Neal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties. The decoding of both codes can be tackled with a practical sum-product algorithm. We prove that these codes are "very good," in that sequences of codes exist which, when optimally decoded, achieve information rates up to the Shannon limit. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

15
1,918
0
12

Year Published

2002
2002
2021
2021

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 3,136 publications
(2,006 citation statements)
references
References 63 publications
15
1,918
0
12
Order By: Relevance
“…The signal noise ratio is set to be 20 dB to attain a packet error ratio of 3 10 − against the value fractional bandwidth. The curves in Fig.3 show that newly obtained codes cater a gain of 2.1 dB compared with RS codes at the worst condition of partial band ρ =1.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…The signal noise ratio is set to be 20 dB to attain a packet error ratio of 3 10 − against the value fractional bandwidth. The curves in Fig.3 show that newly obtained codes cater a gain of 2.1 dB compared with RS codes at the worst condition of partial band ρ =1.…”
Section: Resultsmentioning
confidence: 99%
“…Low-density parity-check codes [1] have acquired considerable attention due to its near-capacity error execution and powerful channel coding technique with an adequately long codeword length. The performance of LDPC codes has been investigated in [2,3], and are encountered to outperform turbo codes.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…This equation can be partitioned into M checks associated with M rows of H. When the parity check equation is not satisfied, then the error correction decoding is applied by means of the iterative message passing algorithm [1].…”
Section: Structured Ldpc Codes Over Galois Fieldsmentioning
confidence: 99%
“…Low-density parity-check (LDPC) codes, after their "rediscovery" in late 90's [1], have attracted great research attention due to their excellent error-correcting performance and highly parallel iterative decoding scheme. They have become the industry standard for error correction coding, adopted for instance in the ETSI Digital Video Broadcasting (DVB) and the IEEE WiMAX.…”
Section: Introductionmentioning
confidence: 99%