Paper · 2011 · Open access
Physical limits of Communication (Invited Talk)
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · Published 1 January 2011 · DOI 10.4230/lipics.fsttcs.2011.4
In brief
“Physical limits of Communication (Invited Talk)” is a 2011 paper by Madhu Sudan, published in DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). OpenAlex counts 0 citations as of 15 November 2026. It is open access under a CC BY-NC-ND licence: the full text is free to read at DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
- Citations
- 0
- Authors
- 1
Abstract
We describe recent work with Sanjeev Khanna (U.\ Penn.) where we explore potential axioms about the mechanics of information transmission with a view to understanding whether continuous signals can carry more information than analog signals.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Sudan, M. (2011). Physical limits of Communication (Invited Talk). DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). https://doi.org/10.4230/lipics.fsttcs.2011.4
MLA 9
Sudan, Madhu. “Physical limits of Communication (Invited Talk).” DROPS (Schloss Dagstuhl – Leibniz Center for Informatics), 2011. https://doi.org/10.4230/lipics.fsttcs.2011.4.
Chicago
Sudan, Madhu. 2011. “Physical limits of Communication (Invited Talk).” DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). https://doi.org/10.4230/lipics.fsttcs.2011.4.
Harvard
Sudan, M. (2011) ‘Physical limits of Communication (Invited Talk)’, DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). doi:10.4230/lipics.fsttcs.2011.4.
IEEE
M. Sudan, “Physical limits of Communication (Invited Talk),” DROPS (Schloss Dagstuhl – Leibniz Center for Informatics), 2011, doi: 10.4230/lipics.fsttcs.2011.4.
BibTeX
@article{sudan2011physical,
title = {{Physical limits of Communication (Invited Talk)}},
author = {Sudan, Madhu},
journal = {DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)},
year = {2011},
doi = {10.4230/lipics.fsttcs.2011.4},
url = {https://doi.org/10.4230/lipics.fsttcs.2011.4}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- information transmission
- continuous-time signals
- analog signals
- information capacity
- channel capacity
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Sudan, M. (2011). Physical limits of Communication (Invited Talk). DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). https://doi.org/10.4230/lipics.fsttcs.2011.4
How many times has this paper been cited?
0 times, according to OpenAlex on 15 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access: read the free full text at DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
Who wrote this paper?
Madhu Sudan.
What is the DOI of this paper?
10.4230/lipics.fsttcs.2011.4. The permanent link is https://doi.org/10.4230/lipics.fsttcs.2011.4.
Bibliographic data from OpenAlex (CC0), last checked 15 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.