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

Authors

19

  1. RN
    Rajai Nasser

    École Polytechnique Fédérale de Lausanne, Switzerland

    2 publications · 44 citations

    2

    h-index

  2. EN
    Elie Najm

    École Polytechnique Fédérale de Lausanne, Switzerland

    2 publications · 44 citations

    2

    h-index

  3. ET
    Emre Telatar

    École Polytechnique Fédérale de Lausanne, Switzerland

    2 publications · 44 citations

    2

    h-index

  4. TB
    Thomas Berger

    Cornell University, United States

    1 publications · 28 citations

    1

    h-index

  5. IC
    Ignacio Cascudo

    Leiden University, Netherlands

    1 publications · 62 citations

    1

    h-index

1–5 of 19

Venues

  1. IEEE Transactions on Information Theory

    5 publications · 210 citations

    5

    h-index

  2. ArXiv.org

    Repository · 1 publications · 18 citations

    1

    h-index

1–2