3.7k citations
- University of California San DiegoUS25 papers
- The University of Texas at AustinUS14 papers
- Qualcomm (United Kingdom)GB11 papers
- University of California, IrvineUS10 papers
- University of California, Los AngelesUS10 papers
- École Polytechnique Fédérale de LausanneCH9 papers
- Market MattersUS9 papers
- Princeton UniversityUS9 papers
- University of California, BerkeleyUS9 papers
- University of TorontoCA9 papers
- Texas A&M UniversityUS8 papers
- University of Illinois Urbana-ChampaignUS8 papers
Showing 2004 · cs.ITShow all
3 papers · 2 filters
cs.IT2004
Capacity and Random-Coding Exponents for Channel Coding with Side Information
Pierre Moulin, Ying Wang
Capacity formulas and random-coding exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic upper bounds on the achieva…
cs.IT2004★ 3 cited
Bounds on the decoding complexity of punctured codes on graphs
H. Pfister, I. Sason, R. Urbanke
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bin…
cs.IT2004★ 164 cited
Capacity-achieving ensembles for the binary erasure channel with bounded complexity
H. Pfister, I. Sason, R. Urbanke
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bin…