Alexander Barg  Home/Search
Context
Related
| rutgers.edu/pub/dimacs/...200232.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rutgers.edu/TechnicalRepor...2002 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A class of codes is said to reach capacity C of the binary symmetric channel if for any rate R < C and any " > 0 there is a suciently large N such that codes of length N and rate R from this class provide error probability of decoding at most ", under some decoding algorithm. (Update)
Active bibliography (related documents): More All
0.5: Linear-Time Decodable, Capacity Achieving Binary Codes With .. - Barg, Zémor (2000) (Correct)
0.5: Complexity Issues in Coding Theory - Barg (1997) (Correct)
0.4: Near-Optimal Linear-Time Codes for Unique Decoding and New.. - Guruswami, Indyk (2002) (Correct)
Similar documents based on text: More All
0.7: A Hypergraph Approach to the Identifying Parent.. - Barg, Cohen.. (2000) (Correct)
0.6: On Expander Codes - Zemor (1999) (Correct)
0.6: Binary B_2-Sequences: a new upper bound - Cohen, Litsyn, al. (Correct)
BibTeX entry: (Update)
@misc{ barg-error,
author = "Alexander Barg",
title = "Error Exponents of Expander Codes Under Linear-Complexity Decoding",
url = "citeseer.ist.psu.edu/barg02error.html" }
Citations (may not include all citations):559 Near Shannon limit error-correcting coding and decoding: Tur.. (context) - Berrou, Glavieux et al. - 1993
372 Information Theory and Reliable Communication (context) - Gallager - 1968
341 Low-Density Parity-Check Codes (context) - Gallager - 1963
88 Concatenated Codes (context) - Forney - 1966
88 A recursive approach to low-complexity codes (context) - Tanner - 1981
58 Expander codes - Sipser, Spielman - 1996
24 Ramanujan graphs (context) - Lubotsky, Philips et al. - 1988
15 Explicit constructions of graphs without short cycles and lo.. (context) - Margulis - 1982
15 Coding for noisy channels (context) - Elias - 1955
10 Complexity issues in coding theory - Barg - 1998
5 Linear Concatenated Codes (context) - Blokh, Zyablov - 1982
4 Concatenated codes and their multilevel generalizations (context) - Dumer - 1998
3 the error-correcting capabilities of cycle codes of graphs - Decreusefond, emor - 1997
2 Estimation of the error-correcting complexity of Gallager lo.. (context) - Zyablov, Pinsker - 1975
2 On expander codes (context) - emor - 2001
1 Error exponents of expander codes (context) - Barg, emor - 2002
Documents on the same site (http://dimacs.rutgers.edu/TechnicalReports/2002.html): More
Expected Rank in Antimatroids - Gordon (2002) (Correct)
A Classification of Antichains of Finite Tournaments - Latka (2002) (Correct)
Deferred Assignment Scheduling in Clustered Web Servers - Ungureanu (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC