Random Coding Arguments
Random Coding Arguments is a methodological framework in information theory that employs probabilistic constructions of codebooks to establish the existence of reliable communication codes by analyzing average performance over an ensemble of randomly generated codewords.
11
Publications
391
Citations
19
Authors
15
Institutions
Publications per year
2017–2026
2
Parents
11
Reliable deniable communication with channel uncertainty
Pak Hou, Mayank Bakshi, Chung Chan et al. · 2014 · 88 citations
Squares of Random Linear Codes
Ignacio Cascudo, Ronald Cramer, Diego Mirandola et al. · IEEE Transactions on Information Theory · 2015 · 62 citations · Full text
Thomas Berger · IEEE Transactions on Information Theory · 1971 · 28 citations
Optimal Age over Erasure Channels
Elie Najm, Emre Telatar, Rajai Nasser · 2019 · 26 citations · Full text
1–5 of 11
19
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 19
15
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
2 h-index
4 publications
88 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
1 h-index
4 publications
352 citations

Claremont Colleges
Claremont, United States
1 h-index
1 publications
89 citations
Université de Bordeaux
Bordeaux, France
1 h-index
2 publications
124 citations

University of Notre Dame
Notre Dame, United States
1 h-index
2 publications
44 citations

Chongqing University
Chongqing, China
1 h-index
1 publications
13 citations

Aarhus University
Aarhus, Denmark
1 h-index
1 publications
62 citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
1 h-index
3 publications
186 citations
1–8 of 15
5 publications · 210 citations
5
h-index
Repository · 1 publications · 18 citations
1
h-index
1–2