Monday, December 15, 2003 8:00 - 8:50 Registration - First Floor Lobby of the CoRE Building Breakfast - 4th Floor, Lounge, CoRE Building 8:50 - 9:00 Welcome and Opening Remarks - First Floor Auditorium, CoRE Building Alexander Barg, DIMACS 9:00 - 9:30 Expander graphs and their codes Ian Blake, University of Toronto and KennethShum 9:30 - 10:00 Graph covers and iterative decoding of finite length codes Pascal Vontobel, University of Illinois 10:00 - 10:30 Transform Codes on Graphs Jonathan Yedidia, Mitsubishi Electric, Boston 10:30 - 11:00 Break - 4th Floor, Lounge, CoRE Building 11:00 - 11:40 General Properties of Optimal Decoding: EXIT function characterization of MAP decoding Alexei Ashikhmin, Bell Labs, Lucent Technologies 11:40 - 12:10 List Decoding of Concatenated Codes Andrew McGregor, University of Pennsylvania 12:10 - 1:40 Lunch - 4th Floor, Lounge, CoRE Building 1:40 - 2:20 Minimal-span generator matrices, linear system theory, and the invariant factor theorem G. David Forney, MIT 2:20 - 2:50 A Classification of Posets Admitting MacWilliams Identity Hyun Kwang Kim, Pohang University, Korea 2:50 - 3:20 A duality principle in network coding Ralf Koetter, UIUC 3:20 - 3:40 Break - 4th Floor, Lounge, CoRE Building 3:40 - 4:10 Codes for Network Multicast: A Combinatorial Approach Emina Soljanin, Bell Labs, Lucent Technologies 4:10 - 4:40 On Networks of Two-Way Channels Gerhard Kramer, Bell Labs, Lucent Technologies Tuesday, December 16, 2003 8:15 - 9:00 Registration - 4th Floor Vestibule (across from elevators) Breakfast - 4th Floor, Lounge, CoRE Building 9:00 - 9:40 Error Correcting Codes and Data Compression Sergio Verdu, Princeton University 9:40 - 10:20 Secrecy Capacities and Multiterminal Source Coding Prakash Narayan, University of Maryland 10:20 - 10:50 Applications of Random Coding and Algebraic Coding Theories to Universal Lossless Source Coding Performance Bounds Gil Shamir, University of Utah 10:50 - 11:20 Break - 4th Floor, Lounge, CoRE Building 11:20 - 11:50 Multiple Description Coding and Distributed Compression: Unexplored Connections in Information Theory and Code Constructions Sandeep Pradhan, Ann Arbor, Michigan 11:50 - 12:20 Difference Set Noise and its Implications on Side Information Problems Aaron Cohen, Brown University 12:30 - 2:00 Lunch - 4th Floor, Lounge, CoRE Building 2:00 - 2:30 Biological Coding Theory: The Emerging Paradigm? Manish K. Gupta, Arizona State University 2:30 - 3:00 Nonintersecting Subspaces Based on Finite Alphabets with Applications to Noncoherent Multiple-Antenna Systems Neil J. A. Sloane, AT&T Shannon Labs 3:00 - 3:30 Survey on Separating Codes Gerard Cohen, ENST, Paris 3:30 - 4:00 Break - 4th Floor, Lounge, CoRE Building 4:00 - 4:30 Covering Codes with Improved Density Benny Sudakov, Princeton University 4:30 - 5:00 Difficulties in Obtaining Good Lower Bounds for Locally Decodable Codes Alex Samorodnitsky, Hebrew University, Jerusalem 5:30 - 7:00 Dinner, DIMACS - 4th Floor, Lounge, CoRE Building Wednesday, December 17, 2003 8:15 - 9:00 Registration - 4th Floor Vestibule (across from elevators) Breakfast - 4th Floor, Lounge, CoRE Building 9:00 - 9:40 A Unified Construction of Space-Time Codes with Optimal Rate-Diversity Tradeoff P. Vijay Kumar, USC 9:40 - 10:20 Random Matrices and Some Integrals That Come up in Space-Time Code design Babak Hassibi, Caltech 10:20 - 10:50 Design of Coherent Space-Time Codes Joseph Boutros, ENST, Paris 10:50 - 11:20 Break - 4th Floor, Lounge, CoRE Building 11:20 - 11:50 A Four Dimensional Generalization of the 2x2 Alamouti Space-Time Code Robert Calderbank, Princeton University 11:50 - 12:20 Non-Coherent Space-Time Codes Jean-Claude Belfiore, ENST, Paris 12:30 - 2:00 Lunch - 4th Floor, Lounge, CoRE Building 2:00 - 2:30 A New Mathematical Approach for the Design of Digital Communication Systems Reginaldo Palazzo, University of Campinas, Brazil 2:30 - 3:00 A New Construction of 16-QAM Golay Complementary Sequences Raman Venkataramani and Vahid Tarokh, Harvard University 3:00 - 3:20 Break - 4th Floor, Lounge, CoRE Building 3:20 - 3:50 On the PAPR Problem Simon Litsyn, Tel Aviv University 3:50 - 4:20 Algebraic Constructions of Lattice Constellations for Fading Channels Emanuele Viterbo, Politecnico di Torino, Italy 4:20 - 4:50 Combinatorial Problems of Traitor Tracing Gregory Kabatiansky, IPPI, Moscow 4:50 - OPEN DISCUSSION: Current Trends in Coding Theory Thursday, December 18, 2003 8:15 - 9:00 Registration - 4th Floor Vestibule (across from elevators) Breakfast - 4th Floor, Lounge, CoRE Building 9:00 - 9:30 Interpolation Multiplicity Assignments for Sudan-Guruswami Decoding of Reed Solomon Codes Robert J. McEliece, Caltech 9:30 - 10:00 Bombieri Inner Product and MacWilliams Duality Iwan Duursma, UIUC 10:00 - 10:30 On Computing Largest Correcting Codes and their Estimates Using Optimization on Specially Constructed Graphs Sergiy Butenko, Texas A&M University 10:30 - 10:50 Break - 4th Floor, Lounge, CoRE Building 11:00 - 11:40 Estimation and Compression Over Large Alphabets Alon Orlitsky, UCSD 11:40 - 12:20 Interleavers for Turbo Codes that Yield a Minimum Distance Growing with Blocklength Gilles Zemor, ENST, Paris 12:20 - 12:50 Low Density Parity Check Lattices Mohammad R. Sadeghi and Daniel Panario, Carleton U., Canada 12:50 Lunch - 4th Floor, Lounge, CoRE Building