Between Shannon and Hamming: Network Information Theory and Combinatorics

Videos from BIRS Workshop

, State University of New York at Buffalo
- 10:31
Between Shannon and Hamming: point to point communication
Watch video | Download video: 201503020955-Langberg.mp4 (168M)
, The Chinese University of Hong Kong
- 11:34
Causal Channels
Watch video | Download video: 201503021103-Jaggi.mp4 (75M)
, Rutgers University
- 12:03
Myopic Channels
Watch video | Download video: 201503021134-Sarwate.mp4 (71M)
, Indian Institute of Technology Bombay
- 14:49
Sufficiently Myopic Adversaries are Blind
Watch video | Download video: 201503021416-Dey.mp4 (91M)
, Ecole Polytechnique Fédérale (EPFL)
- 15:21
Algebraic structure in network information theory: Recent results
Watch video | Download video: 201503021450-Gastpar.mp4 (135M)
, Texas A & M University
- 16:17
MDS Codes with Constrained Generator Matrices and Related Problems
Watch video | Download video: 201503021543-Sprintson.mp4 (148M)
, University of Minnesota
- 16:59
On the Capacity of Memoryless Adversary
Watch video | Download video: 201503021621-Mazumdar.mp4 (65M)
, University of California, San Diego
- 10:12
Index coding and fractional graph theory.
Watch video | Download video: 201503030932-Kim.mp4 (109M)
, The University of Newcastle
- 11:38
Linear index codes are optimal up to five nodes
Watch video | Download video: 201503031105-Ong.mp4 (99M)
, Princeton University
- 12:13
Improving the Cutset bound
Watch video | Download video: 201503031139-Kamath.mp4 (108M)
, Alfred Renyi Institute of Mathematics, HAS (and Budapest University of Technology and Economics)
- 14:03
On the local chromatic number of graphs
Watch video | Download video: 201503031331-Simonyi.mp4 (122M)
, University of Texas at Austin
- 14:34
On Approximating the Sum-Rate for Multiple-Unicasts
Watch video | Download video: 201503031403-Shanmugam.mp4 (97M)
, University of California - San Diego
- 15:30
Universal polar coding
Watch video | Download video: 201503031459-Wang.mp4 (82M)
, Chinese University of Hong Kong
- 15:59
Some Combinatorial Packing Problems Arising from Multiple-Access Collision Communications
Watch video | Download video: 201503031531-Shum.mp4 (75M)
, Tata Institute of Fundamental Research
- 16:27
Secure Function Computation and Information Inequalities for Networks
Watch video | Download video: 201503031600-Prabhakaran.mp4 (69M)
, California Institute of Technology
- 10:11
Reductive arguments in network information theory
Watch video | Download video: 201503040936-Effros.mp4 (103M)
, Caltech
- 10:37
Network Reductions
Watch video | Download video: 201503041011-Wong.mp4 (58M)
, California Institute of Technology
- 11:35
Network Cooperation: The Why, The When, The How
Watch video | Download video: 201503041104-Noorzad.mp4 (100M)
, State University of New York at Buffalo
- 12:11
The edge removal problem
Watch video | Download video: 201503041136-Langberg.mp4 (140M)
, Iowa State University
- 10:14
Fractional repetition codes and some very recent results on coded caching. Part 1.
Watch video | Download video: 201503050942-Ramamoorthy.mp4 (84M)
, Ben-Gorion University
- 10:48
Coded Retransmission in Wireless Networks Via MDPs: Theory and Algorithms
Watch video | Download video: 201503051016-Cohen.mp4 (91M)
, University of Calgary
- 11:49
Recent work on multicast network coding and multiple unicast network coding.
Watch video | Download video: 201503051114-Li.mp4 (106M)
, New Jersey Institute of Technology
- 14:38
Network equivalence for arbitrarily varying and compound channels (Joerg Kliewer and Oliver Kosut)
Watch video | Download video: 201503051405-Kliewer.mp4 (99M)
, Arizona State University
- 15:15
Is network error correction harder than network coding?
Watch video | Download video: 201503051438-Kosut.mp4 (118M)
, New Jersey Institute of Technology
- 16:05
Coordination in networks: An information-theoretic approach
Watch video | Download video: 201503051538-Kliewer.mp4 (78M)