Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 8380 results
Sort by: relevance publication year

Strong converse to the quantum channel coding theorem

JOURNAL ARTICLE published 1999 in IEEE Transactions on Information Theory

Authors: T. Ogawa | H. Nagaoka

https://doi.org/10.1109/18.796386 Actions

A note on the multiple access channel with correlated sources (Corresp.)

JOURNAL ARTICLE published March 1981 in IEEE Transactions on Information Theory

Authors: G. Dueck

https://doi.org/10.1109/tit.1981.1056323 Actions

Converse coding theorem for the identification via multiple access channels

PROCEEDINGS ARTICLE published in Proceedings of the IEEE Information Theory Workshop

Authors: Y. Oohama

https://doi.org/10.1109/itw.2002.1115441 Actions

Coding theorem and strong converse for quantum channels

JOURNAL ARTICLE published 1999 in IEEE Transactions on Information Theory

Authors: A. Winter

https://doi.org/10.1109/18.796385 Actions

Universal coding for the Slepian-Wolf data compression system and the strong converse theorem

JOURNAL ARTICLE published 1994 in IEEE Transactions on Information Theory

Authors: Y. Oohama

https://doi.org/10.1109/18.340465 Actions

A Proof of the Strong Converse Theorem for Gaussian Multiple Access Channels

JOURNAL ARTICLE published August 2016 in IEEE Transactions on Information Theory

Research funded by NUS (R-263-000-A98-750/133) | Ministry of Education Tier 2, Singapore (R-263-000-B61-112) | National University of Singapore Young Investigator Award (R-263-000-B37-133)

Authors: Silas L. Fong | Vincent Y. F. Tan

https://doi.org/10.1109/tit.2016.2570243 Actions

A per letter converse to the channel coding theorem

JOURNAL ARTICLE published October 1966 in IEEE Transactions on Information Theory

Authors: B. Reiffen

https://doi.org/10.1109/tit.1966.1053928 Actions

A proof of the strong converse theorem for Gaussian multiple access channels

PROCEEDINGS ARTICLE published October 2015 in 2015 IEEE Information Theory Workshop - Fall (ITW)

Authors: Silas L. Fong | Vincent Y. F. Tan

https://doi.org/10.1109/itwf.2015.7360756 Actions

A note on the strong converse of the coding theorem for the general discrete finite-memory channel

JOURNAL ARTICLE published March 1960 in Information and Control

Authors: J. Wolfowitz

https://doi.org/10.1016/s0019-9958(60)90317-x Actions

The Strong Converse To The Identification Coding Theorem

PROCEEDINGS ARTICLE published in Proceedings. 1991 IEEE International Symposium on Information Theory

Authors: S. Verdu

https://doi.org/10.1109/isit.1991.695324 Actions

A Strong Converse Theorem for Quantum Multiple Access Channels

JOURNAL ARTICLE published August 2005 in Electronic Notes in Discrete Mathematics

Authors: Rudolf Ahlswede | Ning Cai

https://doi.org/10.1016/j.endm.2005.07.011 Actions

On the converse to the coding theorem for the continuous time white Gaussian channel with feedback (Corresp.)

JOURNAL ARTICLE published March 1984 in IEEE Transactions on Information Theory

Authors: I. McKeague

https://doi.org/10.1109/tit.1984.1056874 Actions

Bounds on the achievable rates of block coding for a memoryless multiple-access channel

JOURNAL ARTICLE published March 1978 in IEEE Transactions on Information Theory

Authors: T. Kasami

https://doi.org/10.1109/tit.1978.1055860 Actions

Converse proof of the channel coding theorem

OTHER published 19 February 2009 in Classical and Quantum Information Theory

https://doi.org/10.1017/cbo9780511803758.039 Actions

Asymptotic Neyman-Pearson games for converse to the channel coding theorem

PROCEEDINGS ARTICLE published July 2013 in 2013 IEEE International Symposium on Information Theory

Authors: Pierre Moulin

https://doi.org/10.1109/isit.2013.6620485 Actions

Strong converse of the coding theorem for semicontinuous channels

JOURNAL ARTICLE published 1 December 1959 in Illinois Journal of Mathematics

Authors: J. Wolfowitz

https://doi.org/10.1215/ijm/1255455455 Actions

Divergence Radii and the Strong Converse Exponent of Classical-Quantum Channel Coding With Constant Compositions

JOURNAL ARTICLE published March 2021 in IEEE Transactions on Information Theory

Research funded by Japan Society for the Promotion of Science (JP16K00012 (TO)) | National Research Development and Innovation Office of Hungary within the Quantum Technology National Excellence Program (2017-1.2.1-NKP-2017-00001,K124152,KH129601)

Authors: Milan Mosonyi | Tomohiro Ogawa

https://doi.org/10.1109/tit.2020.3041205 Actions

Universal coding for multiple access channels

JOURNAL ARTICLE published November 1981 in IEEE Transactions on Information Theory

Authors: M. Ohkubo

https://doi.org/10.1109/tit.1981.1056423 Actions

A Second-Order Converse Bound for the Multiple-Access Channel via Wringing Dependence

JOURNAL ARTICLE published June 2022 in IEEE Transactions on Information Theory

Research funded by National Science Foundation (CCF-1453718,CCF-1908725)

Authors: Oliver Kosut

https://doi.org/10.1109/tit.2022.3151711 Actions

A Strong Converse Theorem for Quantum Multiple Access Channels

BOOK CHAPTER published 2006 in Lecture Notes in Computer Science

Authors: R. Ahlswede | N. Cai

https://doi.org/10.1007/11889342_26 Actions
Feedback: support@crossref.org