Mathematical Sciences Research Institute

Home » Information Theory


Information Theory February 25, 2002 - March 01, 2002
Registration Deadline: March 01, 2002 over 17 years ago
To apply for Funding you must register by: November 25, 2001 over 17 years ago
Parent Program: --
Organizers Elwyn Berlekamp, Joe Buhler, Dave Forney, Abraham Lempel, Gadiel Seroussi (co-chair), Sergio Verdu (co-chair), Andy Viterbi, and Marcelo Weinberger

Show List of Speakers

This workshop will focus on the exciting current developments in source and channel coding, as well as such new areas in information theory as quantum error correction and bioinformatics. Sergio Verdu will be visiting MSRI for the Spring Semester as Hewlett Packard Visiting Research Professor. Efforts will be made to expose some of the topics at a level suitable for a broad audience of mathematicians, computer scientists, and engineers. Computational and algorithmic themes permeate this area and will figure prominently. There will be a discussion of current open problems. The program is also available at the following URL: http://www.ee.princeton.edu/~verdu/ITMSRI.html group photo of participants
Keywords and Mathematics Subject Classification (MSC)
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Funding & Logistics Show All Collapse

Show Funding

To apply for funding, you must register by the funding application deadline displayed above.

Students, recent Ph.D.'s, women, and members of underrepresented minorities are particularly encouraged to apply. Funding awards are typically made 6 weeks before the workshop begins. Requests received after the funding deadline are considered only if additional funds become available.

Show Lodging

MSRI does not hire an outside company to make hotel reservations for our workshop participants, or share the names and email addresses of our participants with an outside party. If you are contacted by a business that claims to represent MSRI and offers to book a hotel room for you, it is likely a scam. Please do not accept their services.

MSRI has preferred rates at the Hotel Shattuck Plaza, depending on room availability. Guests can call the hotel's main line at 510-845-7300 and ask for the MSRI- Mathematical Science Research Institute discount. To book online visit this page (the MSRI rate will automatically be applied).

MSRI has preferred rates at the Graduate Berkeley, depending on room availability. Reservations may be made by calling 510-845-8981. When making reservations, guests must request the MSRI preferred rate. Enter in the Promo Code MSRI123 (this code is not case sensitive).

MSRI has preferred rates at the Berkeley Lab Guest House, depending on room availability. Reservations may be made by calling 510-495-8000 or directly on their website. Select "Affiliated with the Space Sciences Lab, Lawrence Hall of Science or MSRI." When prompted for your UC Contact/Host, please list Chris Marshall (coord@msri.org).

MSRI has a preferred rates at Easton Hall and Gibbs Hall, depending on room availability. Guests can call the Reservations line at 510-204-0732 and ask for the MSRI- Mathematical Science Research Inst. rate. To book online visit this page, select "Request a Reservation" choose the dates you would like to stay and enter the code MSRI (this code is not case sensitive).

Additional lodging options may be found on our short term housing page.

Show Directions to Venue

Show Visa/Immigration

Schedule, Notes/Handouts & Videos
Show Schedule, Notes/Handouts & Videos
Show All Collapse
Feb 25, 2002
08:00 AM - 05:00 PM
  Stochastic Processes on Graphs with Cycles: Approximate Inference and Bounds
Martin Wainwright
09:00 AM - 10:00 AM
  MDL ideas in lossy data compression
Ioannis Kontoyiannis
10:30 AM - 11:30 AM
  On large-deviations tradeoff between code-length and distortion in certain lossy source coding problems
Neri Merhav
11:30 AM - 12:30 PM
  Scalar vs. vector quantization
Alon Orlitsky
02:00 PM - 03:00 PM
  On a boolean maximization problem
Solomon Golomb (University of Southern California)
Feb 26, 2002
09:00 AM - 10:00 AM
  MDL theory as a foundation for statistical modeling
Jorma Rissanen
10:30 AM - 11:30 AM
  New settings for the sequential decision problem
Marcelo Weinberger (Hewlett-Packard Laboratories)
11:30 AM - 12:30 PM
  An efficient universal prediction algorithm for unknown sources with limited training data
Jacob Ziv
01:30 PM - 02:30 PM
  Multi-antenna communications: Information theory and algorithms
Babak Hassibi
02:30 PM - 03:30 PM
  Diversity and freedom: A fundamental tradeoff in multiple antenna wireless communications
David Tse
03:45 PM - 04:45 PM
  Weighting and waiting
Frans Willems
04:45 PM - 05:45 PM
  Analytic combinatorics, information theory, and algorithmics: Precise redundancy rate problem
Wojtek Szpankowski (Purdue University)
Feb 27, 2002
09:00 AM - 10:00 AM
  Efficient content delivery and low complexity codes
Amin Shokrollahi
10:30 AM - 11:30 AM
  Generalized belief propagation and free energy minimization
Jonathan Yedidia
11:30 AM - 12:30 PM
  Approximate estimation of stochastic processes on graphs with cycles: The reparameterization viewpoint
Martin Wainwright
Feb 28, 2002
09:00 AM - 10:00 AM
  Covers, codes, flows, and team strategies for guessing hat colors
Elwyn Berlekamp (Elwyn & Jennifer Berlekamp Foundation)
10:00 AM - 11:00 AM
  The Komogolrov sampler
10:00 AM - 11:00 AM
  Quantum data compression: Tutorial and recent results
10:00 AM - 11:00 AM
  The Komogolrov sampler
10:00 AM - 10:30 AM
10:30 AM - 11:30 AM
  The Komogolrov sampler
David Donoho (Stanford University)
11:30 AM - 12:30 PM
  Quantum data compression: Tutorial and recent results
Emina Soljanin
12:30 PM - 01:30 PM
  Information theoretic energy reduction in deep submicron computation modules
Vahid Tarokh
01:30 PM - 02:30 PM
  Capacity-achieving distributions that escape to infinity and the fading number
Amos Lapidoth
02:30 PM - 03:30 PM
  Information theoretic aspects of constrained systems
Shlomo Shamai
03:30 PM - 04:30 PM
  Information theory and spread spectrum communications
Chris Heegard
Mar 01, 2002
09:00 AM - 10:00 AM
  Common randomness and secret key capacities
Prakash Narayan
10:30 AM - 11:30 AM
  The role of side information in communication and data compression
Tom Cover
11:30 AM - 12:30 PM
  Duality between source coding and channel coding with side information
Kannan Ramchandran
02:00 PM - 03:00 PM
  Coding for storage systems
Jack Wolf
03:30 PM - 04:30 PM
  Concatenation of modulation encoders and ECC encoders
Brian Marcus