The birthday problem and zero-error list codes

Parham Noorzad; Michelle Effros; Michael Langberg; Victoria Kostina

doi:10.1109/ISIT.2017.8006809

The birthday problem and zero-error list codes

Parham Noorzad, Michelle Effros, Michael Langberg, Victoria Kostina

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

As an attempt to bridge the gap between classical information theory and the combinatorial world of zero-error information theory, this paper studies the performance of randomly generated codebooks over discrete memoryless channels under a zero-error constraint. This study allows the application of tools from one area to the other. Furthermore, it leads to an information-theoretic formulation of the birthday problem, which is concerned with the probability that in a given population, a fixed number of people have the same birthday. Due to the lack of a closed-form expression for this probability when the distribution of birthdays is not uniform, the resulting computation is not feasible in some applications; the information-theoretic formulation, however, can be analyzed for all distributions.

Original language	English
Title of host publication	2017 IEEE International Symposium on Information Theory, ISIT 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1648-1652
Number of pages	5
ISBN (Electronic)	9781509040964
DOIs	https://doi.org/10.1109/ISIT.2017.8006809
State	Published - 9 Aug 2017
Externally published	Yes
Event	2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany Duration: 25 Jun 2017 → 30 Jun 2017

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	2017 IEEE International Symposium on Information Theory, ISIT 2017
Country/Territory	Germany
City	Aachen
Period	25/06/17 → 30/06/17

Bibliographical note

Publisher Copyright:
© 2017 IEEE.

Access to Document

10.1109/ISIT.2017.8006809

Cite this

Noorzad, P., Effros, M., Langberg, M., & Kostina, V. (2017). The birthday problem and zero-error list codes. In 2017 IEEE International Symposium on Information Theory, ISIT 2017 (pp. 1648-1652). Article 8006809 (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2017.8006809

@inproceedings{54c0435c34124638bc8b95d54fef7cef,

title = "The birthday problem and zero-error list codes",

abstract = "As an attempt to bridge the gap between classical information theory and the combinatorial world of zero-error information theory, this paper studies the performance of randomly generated codebooks over discrete memoryless channels under a zero-error constraint. This study allows the application of tools from one area to the other. Furthermore, it leads to an information-theoretic formulation of the birthday problem, which is concerned with the probability that in a given population, a fixed number of people have the same birthday. Due to the lack of a closed-form expression for this probability when the distribution of birthdays is not uniform, the resulting computation is not feasible in some applications; the information-theoretic formulation, however, can be analyzed for all distributions.",

author = "Parham Noorzad and Michelle Effros and Michael Langberg and Victoria Kostina",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE International Symposium on Information Theory, ISIT 2017 ; Conference date: 25-06-2017 Through 30-06-2017",

year = "2017",

month = aug,

day = "9",

doi = "10.1109/ISIT.2017.8006809",

language = "אנגלית",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1648--1652",

booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",

address = "ארצות הברית",

}

Noorzad, P, Effros, M, Langberg, M & Kostina, V 2017, The birthday problem and zero-error list codes. in 2017 IEEE International Symposium on Information Theory, ISIT 2017., 8006809, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 1648-1652, 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, 25/06/17. https://doi.org/10.1109/ISIT.2017.8006809

The birthday problem and zero-error list codes. / Noorzad, Parham; Effros, Michelle; Langberg, Michael et al.
2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 1648-1652 8006809 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The birthday problem and zero-error list codes

AU - Noorzad, Parham

AU - Effros, Michelle

AU - Langberg, Michael

AU - Kostina, Victoria

PY - 2017/8/9

Y1 - 2017/8/9

N2 - As an attempt to bridge the gap between classical information theory and the combinatorial world of zero-error information theory, this paper studies the performance of randomly generated codebooks over discrete memoryless channels under a zero-error constraint. This study allows the application of tools from one area to the other. Furthermore, it leads to an information-theoretic formulation of the birthday problem, which is concerned with the probability that in a given population, a fixed number of people have the same birthday. Due to the lack of a closed-form expression for this probability when the distribution of birthdays is not uniform, the resulting computation is not feasible in some applications; the information-theoretic formulation, however, can be analyzed for all distributions.

AB - As an attempt to bridge the gap between classical information theory and the combinatorial world of zero-error information theory, this paper studies the performance of randomly generated codebooks over discrete memoryless channels under a zero-error constraint. This study allows the application of tools from one area to the other. Furthermore, it leads to an information-theoretic formulation of the birthday problem, which is concerned with the probability that in a given population, a fixed number of people have the same birthday. Due to the lack of a closed-form expression for this probability when the distribution of birthdays is not uniform, the resulting computation is not feasible in some applications; the information-theoretic formulation, however, can be analyzed for all distributions.

UR - https://www.scopus.com/pages/publications/85034035788

U2 - 10.1109/ISIT.2017.8006809

DO - 10.1109/ISIT.2017.8006809

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85034035788

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1648

EP - 1652

BT - 2017 IEEE International Symposium on Information Theory, ISIT 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2017 IEEE International Symposium on Information Theory, ISIT 2017

Y2 - 25 June 2017 through 30 June 2017

ER -

The birthday problem and zero-error list codes

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this