Birs- 15w5130: Between Shannon and Hamming: Network Information Theory and Combinatorics

  1. Title:
    Between Shannon and Hamming: point to point communication

    Speaker:

    Link:

  2. Title:
    Causal Channels

    Speaker:

    Link:

  3. Title:
    Myopic Channels

    Speaker:

    Link:

  4. Title:
    Sufficiently Myopic Adversaries are Blind

    Speaker:

    Link:

  5. Title:
    Algebraic structure in network information theory: Recent results

    Speaker:

    Link:

  6. Title:
    MDS Codes with Constrained Generator Matrices and Related Problems

    Speaker:

    Link:

  7. Title:
    On the Capacity of Memoryless Adversary

    Speaker:

    Link:

  8. Title:
    Index coding and fractional graph theory.

    Speaker:

    Link:

  9. Title:
    Linear index codes are optimal up to five nodes

    Speaker:

    Link:

  10. Title:
    Improving the Cutset bound

    Speaker:

    Link:

  11. Title:
    On the local chromatic number of graphs

    Speaker:

    Link:

  12. Title:
    On Approximating the Sum-Rate for Multiple-Unicasts

    Speaker:

    Link:

  13. Title:
    Universal polar coding

    Speaker:

    Link:

  14. Title:
    Some Combinatorial Packing Problems Arising from Multiple-Access Collision Communications

    Speaker:

    Link:

  15. Title:
    Secure Function Computation and Information Inequalities for Networks

    Speaker:

    Link:

  16. Title:
    Reductive arguments in network information theory

    Speaker:

    Link:

  17. Title:
    Network Reductions

    Speaker:

    Link:

  18. Title:
    Network Cooperation: The Why, The When, The How

    Speaker:

    Link:

  19. Title:
    The edge removal problem

    Speaker:

    Link:

  20. Title:
    Fractional repetition codes and some very recent results on coded caching. Part 1.

    Speaker:

    Link: