The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
On coding for reliable communication over packet networks
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior
Laneman, J. N., Tse, D. N. C., & Wornell, G. W. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.838089 · Cited by 12,193
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
Li, S.-Y. R., Yeung, R. W., & Cai, N. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.807285 · Cited by 3,378
Elements of Information Theory
Jacobs, K. (1992) · Discrete Stochastics · doi:10.1007/978-3-0348-8645-1_7 · Cited by 2,918
Luby, M. (2003) · The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. · doi:10.1109/sfcs.2002.1181950 · Cited by 2,757
A Random Linear Network Coding Approach to Multicast
Ho, T., Medard, M., Koetter, R., Karger, D. R., Effros, M., Shi, J., & Leong, B. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.881746 · Cited by 2,553
Self-citationAn algebraic approach to network coding
Koetter, R., & Medard, M. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818197 · Cited by 2,356
Self-citationReversibility and Stochastic Networks
Cohen, J. E., & Kelly, F. P. (1981) · Technometrics · doi:10.1080/00401706.1981.10486278 · Cited by 2,212
Shokrollahi, A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874390 · Cited by 2,154
Finite-state Markov channel-a useful model for radio communication channels
Wang, H. S., & Moayeri, N. (1995) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.350282 · Cited by 1,647
On the Achievable Diversity–Multiplexing Tradeoff in Half-Duplex Cooperative Channels
Azarian, K., ElGamal, H., & Schniter, P. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858920 · Cited by 1,117
Network coding for large scale content distribution
Gkantsidis, C., & Rodriguez, P. R. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498511 · Cited by 1,051
Principles and practice of information theory
Blahut, R. E. (1987) · Medical Entomology and Zoology · Cited by 1,008
Bertsekas, D. P., & Gallager, R. G. (1992) · Prentice-Hall, Inc eBooks · Cited by 852
Network Optimization: Continuous and Discrete Models
Bertsekas, D. P. (1998) · Cited by 738
A simple derivation of the coding theorem and some applications
Gallager, R. (1965) · IEEE Transactions on Information Theory · doi:10.1109/tit.1965.1053730 · Cited by 687
Reversibility and stochastic networks
Kingmán, J. F. C. (1980) · European Journal of Operational Research · doi:10.1016/0377-2217(80)90150-2 · Cited by 547
Capacity of wireless erasure networks
Dana, A. F., Gowaikar, R., Palanki, R., Hassibi, B., & Effros, M. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864424 · Cited by 389
Self-citationNetworking from a network coding perspective
Ho, T. (2004) · Cited by 55
Cited by
Yeung, R. W., Li, S.-Y. R., Cai, N., & Zhang, Z. (2006) · Foundations and Trends® in Communications and Information Theory · doi:10.1561/0100000007 · Cited by 381
Digital Twin of Wireless Systems: Overview, Taxonomy, Challenges, and Opportunities
Khan, L. U., Han, Z., Saad, W., Hossain, E., Guizani, M., & Hong, C. S. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3198273 · Cited by 322
Communication-Efficient and Distributed Learning Over Wireless Networks: Principles and Applications
Park, J., Samarakoon, S., Elgabli, A., Kim, J., Bennis, M., Kim, S.-L., & Debbah, M. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2021.3055679 · Cited by 25
Metadata
- Authors
- Lun, D. S., Médard, M., Koetter, R., & Effros, M.
- Venue
- Physical Communication
- Publisher
- Elsevier BV
- Published
- 2008-03
- Volume
- 1
- Issue
- 1
- Pages
- 3-20
- ISSN
- 1874-4907 (ISSN-L)
- OpenAlex
- W2099805730
- Cited by
- 559
- References
- 22
- FWCI
- 107.54
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
