Birs- 15w5130: Between Shannon and Hamming: Network Information Theory and Combinatorics
-
Title: Between Shannon and Hamming: point to point communication
Speaker:
Link:
-
Title: Causal Channels
Speaker:
Link:
-
Title: Myopic Channels
Speaker:
Link:
-
Title: Sufficiently Myopic Adversaries are Blind
Speaker:
Link:
-
Title: Algebraic structure in network information theory: Recent results
Speaker:
Link:
-
Title: MDS Codes with Constrained Generator Matrices and Related Problems
Speaker:
Link:
-
Title: On the Capacity of Memoryless Adversary
Speaker:
Link:
-
Title: Index coding and fractional graph theory.
Speaker:
Link:
-
Title: Linear index codes are optimal up to five nodes
Speaker:
Link:
-
Title: Improving the Cutset bound
Speaker:
Link:
-
Title: On the local chromatic number of graphs
Speaker:
Link:
-
Title: On Approximating the Sum-Rate for Multiple-Unicasts
Speaker:
Link:
-
Title: Universal polar coding
Speaker:
Link:
-
Title: Some Combinatorial Packing Problems Arising from Multiple-Access Collision Communications
Speaker:
Link:
-
Title: Secure Function Computation and Information Inequalities for Networks
Speaker:
Link:
-
Title: Reductive arguments in network information theory
Speaker:
Link:
-
Title: Network Reductions
Speaker:
Link:
-
Title: Network Cooperation: The Why, The When, The How
Speaker:
Link:
-
Title: The edge removal problem
Speaker:
Link:
-
Title: Fractional repetition codes and some very recent results on coded caching. Part 1.
Speaker:
Link: