Universal Coding is a source coding methodology in information theory that designs codes to achieve asymptotically optimal compression performance, up to vanishing or uniformly bounded redundancy, for every source in a given class without prior knowledge of the source statistics.
410
Publications
33K
Citations
565
Authors
303
Institutions
Publications per year
2017–2026
41
Publications
410
Amin Shokrollahi · IEEE Transactions on Information Theory · 2006 · 2.1K citations · Full text
Amin Shokrollahi · Information Theory Workshop · 2007 · 1.3K citations
1–5 of 410
Authors
565
- NM
13
h-index
- JZ
10
h-index
- MF
10
h-index
- JC
8
h-index
- TW
8
h-index
1–5 of 565
Institutions
303
Technion – Israel Institute of Technology
Haifa, Israel
20 h-index
34 publications
12.6K citations
Stanford University
Stanford, United States
13 h-index
22 publications
1.1K citations
University of Illinois Urbana-Champaign
Urbana, United States
13 h-index
21 publications
1.3K citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
12 h-index
19 publications
4.3K citations
Tel Aviv University
Tel Aviv, Israel
12 h-index
19 publications
1.3K citations
California Institute of Technology
Pasadena, United States
11 h-index
12 publications
779 citations
University of California, Berkeley
Berkeley, United States
10 h-index
17 publications
1.4K citations
University of Waterloo
Waterloo, Canada
10 h-index
16 publications
815 citations
1–8 of 303
Venues
- IEEE Transactions on Information Theory
162 publications · 23.3K citations
60
h-index
- Designs Codes and Cryptography
12 publications · 379 citations
12
h-index
- Discrete Mathematics
8 publications · 197 citations
8
h-index
- arXiv (Cornell University)
Repository · 7 publications · 224 citations
7
h-index
- ArXiv.org
Repository · 4 publications · 182 citations
4
h-index
1–5