MSRI Workshop on Information Theory
Berkeley, California
February 25- March 1, 2002

Organizing Committee:


Elwyn Berlekamp
Joe Buhler
Dave Forney
Abraham Lempel
Gadiel Seroussi (Co-chair)
Sergio Verdú (Co-Chair)
Andy Viterbi
Marcelo Weinberger

Technical Program

Morning 9:00am-12:30pm Afternoon 2:00pm-6:00pm
Monday Morning Monday Afternoon
Lossy Data Compression
  1. MDL Ideas in Lossy Data Compression
    Ioannis Kontoyiannis (Brown)
  2. On large-deviations tradeoffs between code-length and distortion in certain lossy source coding problems
    Neri Merhav (Technion)
  3. Scalar vs. vector quantization
    Alon Orlitsky (San Diego)
Multidisciplinary
  1. On a Boolean Maximization Problem
    Sol Golomb (USC)
MSRI-Evans Talk
  1. Large random matrices and wireless communication
    Sergio Verdú (Princeton)
Tuesday Morning Tuesday Afternoon
Statistics and Information Theory
  1. MDL Theory as a foundation for Statistical Modeling
    Jorma Rissanen
  2. New settings for the sequential decision problem
    Marcelo Weinberger (Hewlett-Packard)
  3. An Efficient Universal Prediction Algorithm For Unknown Sources With Limited Training Data
    Jacob Ziv (Technion)
Multiantenna Channels
  1. Multi-antenna communications: Information theory and algorithms
    Babak Hassibi (Caltech)
  2. Diversity and Freedom: A Fundamental Tradeoff in Multiple AntennaWireless Communications
    David Tse (Berkeley)
Lossless Data Compression
  1. Weighting and Waiting
    Frans Willems (Eindhoven)
  2. Analytic Combinatorics, Information Theory, and Algorithmics: Precise Redundancy Rate Problem
    Wojtek Szpankowski (Purdue)
Wednesday Morning Wednesday Afternoon
Low-Density Parity-Check Codes
  1. Efficient Content Delivery and Low Complexity Codes
    Amin Shokrollahi (Digital Fountain)
  2. Generalized Belief Propagation and Free Energy Minimization
    Jonathan Yedidia (MERL)
  3. Approximate estimation of stochastic processes on graphs with cycles: The reparameterization viewpoint
    Martin Wainwright (MIT)
Planned Outing
Thursday Morning Thursday Afternoon
Multidisciplinary
  1. Covers, Codes, Flows, and Team Strategies for Guessing Hat Colors
    Elwyn Berlekamp (Berkeley)
  2. The Kolmogorov Sampler
    David Donoho (Stanford)
  3. Quantum Data Compression: Tutorial and Recent Results
    Emina Soljanin (Lucent)
Channel Capacity
  1. Information Theoretic Energy Reduction in Deep Submicron Computation Modules
    Vahid Tarokh (MIT)
  2. Capacity-achieving distributions that escape to infinity and the fading number
    Amos Lapidoth (ETH)
  3. Information Theoretic Aspects of Constrained Systems
    Shlomo Shamai (Technion)
  4. Information theory and Spread Spectrum Communications
    Chris Heegard (Texas Instruments)
Friday Morning Friday Afternoon
Shannon Theory
  1. Common randomness and secret key capacities
    Prakash Narayan (Maryland)
  2. The role of side information in communication and data compression
    Tom Cover (Stanford)
  3. Duality between source coding and channel coding with side information
    Kannan Ramchandran (Berkeley)
Codes for Recording
  1. Coding for Storage Systems
    Jack Wolf (San Diego)
  2. Concatenation of modulation encoders and ECC encoders
    Brian Marcus (IBM)