Between Shannon and Hamming: Network Information Theory and Combinatorics
Videos from BIRS Workshop
Michael Langberg, State University of New York at Buffalo
Monday Mar 2, 2015 09:55 - 10:31
Between Shannon and Hamming: point to point communication
Sidharth (Sid) Jaggi, The Chinese University of Hong Kong
Monday Mar 2, 2015 11:03 - 11:34
Causal Channels
Anand Sarwate, Rutgers University
Monday Mar 2, 2015 11:34 - 12:03
Myopic Channels
Bikash Kumar Dey, Indian Institute of Technology Bombay
Monday Mar 2, 2015 14:16 - 14:49
Sufficiently Myopic Adversaries are Blind
Michael Gastpar, Ecole Polytechnique Fédérale (EPFL)
Monday Mar 2, 2015 14:50 - 15:21
Algebraic structure in network information theory: Recent results
Alex Sprintson, Texas A & M University
Monday Mar 2, 2015 15:43 - 16:17
MDS Codes with Constrained Generator Matrices and Related Problems
Arya Mazumdar, University of Minnesota
Monday Mar 2, 2015 16:21 - 16:59
On the Capacity of Memoryless Adversary
Young-Han Kim, University of California, San Diego
Tuesday Mar 3, 2015 09:32 - 10:12
Index coding and fractional graph theory.
Lawrence Ong, The University of Newcastle
Tuesday Mar 3, 2015 11:05 - 11:38
Linear index codes are optimal up to five nodes
Sudeep Kamath, Princeton University
Tuesday Mar 3, 2015 11:39 - 12:13
Improving the Cutset bound
Gabor Simonyi, Alfred Renyi Institute of Mathematics, HAS (and Budapest University of Technology and Economics)
Tuesday Mar 3, 2015 13:31 - 14:03
On the local chromatic number of graphs
Karthikeyan Shanmugam, University of Texas at Austin
Tuesday Mar 3, 2015 14:03 - 14:34
On Approximating the Sum-Rate for Multiple-Unicasts
Lele Wang, University of California - San Diego
Tuesday Mar 3, 2015 14:59 - 15:30
Universal polar coding
Kenneth W Shum, Chinese University of Hong Kong
Tuesday Mar 3, 2015 15:31 - 15:59
Some Combinatorial Packing Problems Arising from Multiple-Access Collision Communications
Vinod Prabhakaran, Tata Institute of Fundamental Research
Tuesday Mar 3, 2015 16:00 - 16:27
Secure Function Computation and Information Inequalities for Networks
Michelle Effros, California Institute of Technology
Wednesday Mar 4, 2015 09:36 - 10:11
Reductive arguments in network information theory
Ming Fai Wong, Caltech
Wednesday Mar 4, 2015 10:11 - 10:37
Network Reductions
Parham Noorzad, California Institute of Technology
Wednesday Mar 4, 2015 11:04 - 11:35
Network Cooperation: The Why, The When, The How
Michael Langberg, State University of New York at Buffalo
Wednesday Mar 4, 2015 11:36 - 12:11
The edge removal problem
Aditya Ramamoorthy, Iowa State University
Thursday Mar 5, 2015 09:42 - 10:14
Fractional repetition codes and some very recent results on coded caching. Part 1.
Asaf Cohen, Ben-Gorion University
Thursday Mar 5, 2015 10:16 - 10:48
Coded Retransmission in Wireless Networks Via MDPs: Theory and Algorithms
Zongpeng Li, University of Calgary
Thursday Mar 5, 2015 11:14 - 11:49
Recent work on multicast network coding and multiple unicast network coding.
Kliewer Joerg, New Jersey Institute of Technology
Thursday Mar 5, 2015 14:05 - 14:38
Network equivalence for arbitrarily varying and compound channels (Joerg Kliewer and Oliver Kosut)
Oliver Kosut, Arizona State University
Thursday Mar 5, 2015 14:38 - 15:15
Is network error correction harder than network coding?
Kliewer Joerg, New Jersey Institute of Technology
Thursday Mar 5, 2015 15:38 - 16:05
Coordination in networks: An information-theoretic approach
