TECHNICAL PROGRAM Sunday, June 27 8:00 RECEPTION Monday June 28 09:00-10:00 PLENARY SPEAKER John Kieffer, kieffer@ece.umn.edu: Universal Lossless Data Compression via Grammatical Inference. 10:00-10:30 COFFEE BREAK 10:30-13:00 NETWORKS AND SHANNON THEORY Organizers: A. Lapidoth and Z. Zhang Toby Berger: berger@ee.cornell.edu Tight Typicality and the Generalized Billiard Ball Channel Thomas M. Cover: cover@isl.stanford.edu Conflicts between state information, side information and intended information. Te-sun Han: han@toraja.hn.is.uec.ac.jp Weak variable-length source coding theorems S. Shamai: sshlomo@ee.technion.ac.il and Emre Telatar: Some information theoretic aspects of decentralized power control in multiple access fading channels S. Verdu: verdu@ee.princeton.edu Capacity of CDMA Fading Channels (Joint work with S. Shamai) R. Yeung: whyeung@ie.cuhk.edu.hk Linear codes for network information flow (joint work with S.-Y. Robert Li) 13:00-- 15:30 Lunch 15:30-18:00 COMMUNICATION/CODING Organizers: D. Forney, A. Vardy. Tom Hoeholdt, Technical University of Denmark, tom@mat.dtu.dk: Advances in algebraic-geometry codes Claude Berrou, ENST - Bretagne, Claude.Berrou@enst-bretagne.fr: Multidimensional turbo codes Ralf Koetter, U. Illinois, koetter@rainier.csl.uiuc.edu: Factor graphs and iterative decoding Dan Costello, U. Notre Dame, costello.2@nd.edu: On the packet error rate performance of convolutional codes Ronny Roth, Technion, ronny@cs.technion.ac.il: Constrained codes and systems 18:00-18:30 COFFEE BREAK 18:30-20:00 PANEL: ROLE OF IT in MULTIMEDIA Organizers: G. Seroussi and M. Weinberger Panelists: Abraham Lempel, Jacov Ziv, Martin Vetterli, Rabiner, Farvardin, Mike Orchard 22:00 OPEN PROBLEM SESSION Tuesday June 29 09:00-10:00 PLENARY SPEAKER Philippe Flajolet, Philippe.Flajolet@inria.fr Analytic Aspects of the Digital Tree Process 10:00-10:30 COFFEE BREAK 10:30-13:00 SOURCE CODING Organizers: Y. Kontoyiannis and N. Merhav Tamas Linder (linder@mast.queensu.ca), Queen's University and Ram Zamir (zamir@eng.tau.ac.il), Tel-Aviv University Title: High-Resolution Rate-Distortion Theory Gil Shamir (gshamir@gershwin.helios.nd.edu), University of Notre Dame, Daniel J. Costello (Daniel.J.Costello.2@nd.edu), University of Notre Dame Title: Asymptotically Optimal Threshold Based Low Complexity Sequential Lossless Coding for Piecewise Stationary Memoryless Sources Tjalling Tjalkens (tjalling@ei.ele.tue.nl), Eindhoven Univ of Technology and Frans Willems (frans@ei.ele.tue.nl), Eindhoven Univ of Technology Title: Variable-to-Fixed length source codes: a geometrical approach to low complexity codes Marcelo Weinberger (marcelo@hpl.hp.com), E. Ordentlich, HP Labs Title: LZ-based prediction for a class of loss functions Bin Yu (binyu@stat.berkeley.edu), UC Berkeley and Bell Labs and Mark Hansen (cocteau@research.bell-labs.com), Bell Labs Title: Assessing MDL in Wavelet Compression and Denoising 13:00-- 15:30 Lunch 15:30-18:00 FUNDAMENTALS OF COMMUNICATION NETWORKS Organizers: L. Tassiulas C. Courcoubetis, V. Siris and R. Weber Cell and Burst Scale Effects in Multiplexing Periodic Sources James Giles and Bruce Hajek The Jamming Game for Timing Channels R. Poovendran, J. S. Baras An Information Theoretic Approach to Secure Multicast Key Management Kihong Park Noncooperative network games for multi-class QoS provision Israel Cidon TBA 18:00-18:30 COFFEE BREAK 18:30-20:00 PANEL: ROLE OF IT IN NETWORKING Organizers: R. Rao and T. Ephremides Panelists: Venkat Anantharam, Toby Berger, Bob Gallager, Bruce Hajek, Jack Wolf 22:00-23:00 RECENT RESULT SESSIONS (two parallel sessions) ``On the design of Space-Time codes,'' H. El Gamal. ``On the modified Niederreiter cryptosystem,'' E. Gabidulin, A. Ourivski, V. Pavlouchkov. ``Performance of the turbo hybrid automatic repeat request system type II,'' Jozef. Hamorsky, Lajos Hanzo. ``Constructing low parity-checkcodes with circulant matrices,'' S. Hui, J. Bond, H. Schmidt. ``Representing group codes as permutation codes,'' J. Karlof, E. Biglieri, E. Viterbo. ``Strong converse theorems in the quantum information theory,'' Tomohiro Ogawa Hiroshi Nagaoka. ``Variable-to-fixed length codes and plurally parsable dictionaries,'' S. Savari. ``Traffic multiplexing networks,'' M. Shalmon. ``Overflow and underflow probabilities of fixed-to-variable codeword lengths for general sources,'' O. Uchida, T. Han. ``Interleaver design for turbo codes based on divisibility,'' M. Wang, A. Sheikh, F. Qi. ``Basic properties of fix-free codes,'' R. Yeung, C. Ye. ``Noise prediction for channels with side information at the transmitter: error exponents,'' R. Zamir, U. Erez. POSTER SESSION ``A combinatorial approach to information inequalities,'' H. Chan, R. W. Yeung. ``On a BEP of a generalised concatenated code,'' X. Feng. ``An information-spectrum approach to degraded broadcast channels,'' K. Iwata, M. Morii. ``Asymptotic properties on codeword length distribution of FV codes for general sources,'' H. Koga, H. Yamamoto, N. Yamaguchi. ``Near optimal voice-data integration over third generation wireless TDMA channel,'' P. Koutsakis, M. Paterakis. ``Algorithms for finding good column permutation of codes,'' C. Papadopoulos. ``Stack algorithms for random multiple access in the presence of asymmetric channel feedback erasures,'' M. Paterakis, C. Harizakis. ``Zigzag codes and concatenated Zigzag codes,'' Li Ping, Nam Phamdo. ``The behavior of stochastic process arising in window protocols,'' S. Savari, E. Telatar. ``Efficient hierarchical broadcasting using multilevel codes,'' D. Schill, D. Yuan, J. Huber. ``A separation principle of communication network,'' L. Song, R. Yeung. ``The $k$th order nonhomomorphicity of S-boxes,'' Y. Zheng, X. Zhang. ``Multiparty videoconferencing on multi-drop VP based SONET-ATM rings performance analysis,'' G. Feng, T. Yum. ``The method of statistical hypothesis testing based on stochastic polynomial use,'' Y. Kuchenko. Wednesday June 30 09:00-10:00 PLENARY SPEAKER Pravin Varaiya, varaiya@eecs.berkeley.edu: Pricing and Provisioning of Quality-Differentiated Interent Access. 10:00-10:30 COFFEE BREAK 10:30-13:00 CRYPTOGRAPHY AND INFORMATION SECURITY Organizers: Henk van Tilborg and C. Cachin Moni Naor, naor@wisdom.weizmann.ac.il How to Distribute A Key Distribution Center, Don Beaver (beaverd@certco.com): Imperfections in Perfectly Secure Key Exchange Christian Cachin, cca@zurich.ibm.com Security Against Memory-bounded Adversaries, Claude Crepeau, crepeau@cs.McGill.ca Cryptography in the Quantum World. Gadiel Seroussi, seroussi@hpl.hp.com Elliptic curve cryptography. 13:00-- 15:30 Lunch 15:30-18:00 IT AND QUEUEING NETWORKS Organizers: V. Anantharam and D. Tse Bob Gallager and Balaji Prabhakar The Entropies of Queue Arrivals and Queue Departures Joy Thomas (jat@watson.ibm.com): On the Information Capacity of Queueing Networks Lewis, J.T. (lewis@synge.stp.dias.ie), Pfister, C.-E., Sullivan, W.G.: Information Theory and Large Deviation Theory Anand S. Bedeker and Murat Azigoglu: On random message arrivals in multiaccess communication George Kesidis and Takis Konstantopoulos: Extremal behavior and bounds for a network buffer fed by deterministically shaped random processes Balaji Prabhakar A two-bit scheme for address lookup 18:00-18:30 COFFEE BREAK 18:30-20:00 PANEL: PRICING IN NETWORKS Organizers: C. Courcoubetis and B. Prabhakar: Panelists: John Tsitsiklis, Pravin Varaiya, Richard Weber. 21:00 BANQUET Thursday July 1 Day trip to Zagorohoria