Name
Abstract | ||
|---|---|---|
We show that expander codes attain the capacity of the binary-symmetric channel under iterative decoding. The error probability has a positive exponent for all rates between zero and the channel capacity. The decoding complexity grows linearly with the code length |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1109/TIT.2002.1003853 | Information Theory, IEEE Transactions |
Keywords | Field | DocType |
channel capacity,codes,error statistics,iterative decoding,binary-symmetric channel capacity,code length,code rate,decoding complexity,error exponents,error probability,expander codes,large minimum distance,circuits,binary codes,graph theory,concatenated codes,entropy,error exponent,indexing terms | Discrete mathematics,Concatenated error correction code,Combinatorics,Sequential decoding,Exponent,Code rate,Low-density parity-check code,Expander code,Decoding methods,Channel capacity,Mathematics | Journal |
Volume | Issue | ISSN |
48 | 6 | 0018-9448 |
Citations | PageRank | References |
42 | 3.64 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Barg | 1 | 910 | 85.90 |
| G. Zemor | 2 | 232 | 16.71 |
| alexander barg gilles | 3 | 42 | 3.64 |