Concepedia

Packing Lemma

Packing Lemma is a fundamental theorem in information theory that establishes the maximum number of statistically distinguishable sequences achievable under a given probability threshold, thereby characterizing the limits of reliable communication over noisy channels.

14

Publications

501

Citations

17

Authors

16

Institutions

Publications per year

2017–2026

2

Parents

Publications

14

The packing problem in statistics, coding theory and finite projective spaces

J. W. P. Hirschfeld, Leo Storme · Journal of Statistical Planning and Inference · 1998 · 115 citations

, , +13

Packing regularity of sets in <i>n</i>-space

Xavier Saint Raymond, Claude Tricot · Mathematical Proceedings of the Cambridge Philosophical Society · 1988 · 87 citations

, , +8

Non-asymptotic achievability bounds in multiuser information theory

Sergio Verdú · 2012 · 74 citations

, , +11

Universal Coding for Classical-Quantum Channel

Communications in Mathematical Physics · 2009 · 55 citations · Full text

, , +17

The density theorem and Hausdorff inequality for packing measure in general metric spaces

Colleen D. Cutler · Illinois Journal of Mathematics · 1995 · 45 citations

, , +10

1–5 of 14

Authors

17

  1. HH
    Henryk Hudzik

    Adam Mickiewicz University in Poznań, Poland

    2 publications · 37 citations

    2

    h-index

  2. SS
    S. Sandeep Pradhan

    University of Michigan, United States

    1 publications · 10 citations

    1

    h-index

  3. MH
    Mohsen Heidari

    University of Michigan, United States

    1 publications · 10 citations

    1

    h-index

  4. YY
    Y. Ye

    1 publications · 14 citations

    1

    h-index

  5. DA
    Dov Aharonov

    Technion – Israel Institute of Technology, Israel

    1 publications · 18 citations

    1

    h-index

1–5 of 17

Institutions

16

  1. Université du Québec à Montréal

    Montreal, Canada

    1 h-index

    1 publications

    87 citations

  2. QuSoft

    Amsterdam, Netherlands

    1 h-index

    1 publications

    11 citations

  3. University of Amsterdam

    Amsterdam, The Netherlands

    1 h-index

    1 publications

    11 citations

  4. Princeton University

    Princeton, United States

    1 h-index

    1 publications

    74 citations

  5. University of Michigan

    Ann Arbor, United States

    1 h-index

    3 publications

    30 citations

  6. Tata Institute of Fundamental Research

    Mumbai, India

    1 h-index

    1 publications

    10 citations

  7. Technion – Israel Institute of Technology

    Haifa, Israel

    1 h-index

    1 publications

    18 citations

  8. Korea Advanced Institute of Science and Technology

    Daejeon, South Korea

    1 h-index

    1 publications

    11 citations

1–8 of 16

Venues

  1. IEEE Transactions on Information Theory

    2 publications · 29 citations

    2

    h-index

  2. Revista Matemática Complutense

    1 publications · 14 citations

    1

    h-index

  3. 1

    h-index

  4. Canadian Mathematical Bulletin

    CMB · 1 publications · 18 citations

    1

    h-index

  5. Illinois Journal of Mathematics

    IJM · 1 publications · 45 citations

    1

    h-index

1–5