Jump to other IT Society Websites:

Connect

Shilpi
Bhattacharyya

Stony Brook University

Zouheir
Rezki

Assistant Professor

University of Idaho, Moscow, Idaho, USA

Onur
Günlü

M.Sc.

Chair of Communications Engineering, TU Munich

Follow us on:

Discover

Latest Paper Awards

Information Theory Society Paper Award
C. Bennett , I. Devetak , A. Harrow , P. Shor , A. Winter , "The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels", IEEE Transactions on Information Theory, May. 2014
Jack Keil Wolf ISIT Student Paper Award
O. Peled , O. Sabag , H. Permuter , "Feedback Capacity and Coding for the (0,k)-RLL Input-Constrained BEC", Proceedings of the 2017 IEEE International Symposium on Information Theory, Aachen, Germany, Jun. 2017
Jack Keil Wolf ISIT Student Paper Award
J. Li , X. Tang , C. Tian , "A Generic Transformation for Optimal Repair Bandwidth and Rebuilding Access in MDS Codes", Proceedings of the 2017 IEEE International Symposium on Information Theory, Aachen, Germany, Jun. 2017
Jack Keil Wolf ISIT Student Paper Award
Q. Yu , M. Maddah-Ali , S. Avestimehr , "The Exact Rate-Memory Tradeoff for Caching with Uncoded Prefetching", Proceedings of the 2017 IEEE International Symposium on Information Theory, Aachen, Germany, Jun. 2017
Communications Society & Information Theory Society Joint Paper Award
I. Tal , A. Vardy , "List Decoding of Polar Codes", IEEE Transactions on Information Theory, May. 2015
Thomas M. Cover Dissertation Award
L. Wang , "Channel Coding Techniques for Network Communication", Ph.D. Thesis, University of California, San Diego, Dec. 2015
cs.IT updates on arXiv.org
Weight hierarchies of a family of linear codes associated with degenerate quadratic forms. (arXiv:1804.06866v1 [cs.IT])
Approximation of Meta Distribution and Its Moments for Poisson Cellular Networks. (arXiv:1804.06881v1 [cs.IT])
Distributed Simulation and Distributed Inference. (arXiv:1804.06952v1 [cs.DS])
Defining Pathway Assembly and Exploring its Applications. (arXiv:1804.06972v1 [cs.IT])
A Simple Capacity Lower Bound for Communication with Superimposed Pilots. (arXiv:1804.07114v1 [cs.IT])

See our tech topics in: