IZS 2012 Conference Program

Tuesday, February 28

16:00 – 18:00 Registration desk open

Wednesday, February 29

08:00 Registration desk opens
08:55 Opening address
09:00 – 10:00   Keynote Lecture by Gerhard Kramer (TU München)
10:00 – 10:20 Coffee break
10:20 – 12:00 Session 1: Invited Session on Network Information Theory
12:00 – 13:20 Lunch break
13:20 – 15:00 Session 2: Shannon Theory
15:00 – 15:30 Coffee break
15:30 – 16:50 Session 3: Invited Session on Information Theory, Statistics, and Probability

Thursday, March 1

09:00 – 10:00   Keynote Lecture by Peter Winzer (Alcatel-Lucent)
10:00 – 10:20 Coffee break
10:20 – 12:00 Session 4: Invited Session on Coding Theory
12:00 – 13:20 Lunch break
13:20 – 15:00 Session 5: Coding I
15:00 – 15:30 Coffee break
15:30 – 17:10 Session 6: Coding II
19:00 – end Conference Banquet at Restaurant Belvoirpark

Friday, March 2

09:00 – 10:00   Keynote Lecture by Mitchell Trott (HP Labs)
10:00 – 10:20 Coffee break
10:20 – 12:00 Session 7: Invited Session on Streaming, Relaying, and Rateless-Coding
12:00 – 13:20 Lunch break
13:20 – 15:00 Session 8: Invited Session on Coding for Wireless Communication
15:00 – 15:30 Coffee break
15:30 – 17:10 Session 9: Communication Theory

All talks are 20 min.

Keynote Lecture (Wednesday 09:00 – 10:00)

  • Gerhard Kramer
    • Progress on Relaying and Noisy Network Coding

Session 1: Network Information Theory (Wednesday 10:20 – 12:00)
Invited Session by Michèle Wigger

  • E. Amir and Y. Steinberg
    • The Multiple Access Channel with Correlated Sources and Cribbing Encoders
  • P. Cuff
    • The Source Coding Side of Secrecy
  • D. Tuninetti
    • A Comparative Study of Cooperation for the Two-User Interference Channel
  • Y. Altuğ and A. B. Wagner
    • Refinement of the Random Coding Bound
  • Michèle Wigger
    • Source Coding with Side-Information at the Receivers and an Application

Session 2: Shannon Theory (Wednesday 13:20 – 15:00)
Chaired by Michael Gastpar

  • R. Bustin and S. Shamai (Shitz)
    • On Gaussian Channels with MMSE Interference
  • S. I. Bross and H. Permuter
    • On the Gaussian Listening-Helper Source-Coding Problem
  • M. Dörpinghaus, M. Rüngeler, and R. Mathar
    • Upper-Bounding Rate Distortion Functions based on the Minimum Mean-Square Error
  • B. C. Geiger and G. Kubin
    • On the Information Loss in Memoryless Systems: The Multivariate Case
  • T. Koch and A. Lapidoth
    • One-Bit Quantizers for Fading Channels

Session 3: Information Theory, Statistics, and Probability (Wednesday 15:30 – 16:50)
Invited Session by Ioannis Kontoyiannis

  • S. de Rooij
    • Model Switching and other Unconventional Fun with Experts
  • K. Venkat and T. Weissman
    • Some Old and New Relations between Information and Estimation
  • E. Abbe
    • Polar Martingales of Maximal Spread
  • I. Kontoyiannis
    • Sumset Differential Entropy Bounds

Keynote Lecture (Thursday 09:00 – 10:00)

  • Peter Winzer
    • Spatial Multiplexing and MIMO for Fiber Capacities beyond 100 Tb/s

Session 4: Coding Theory (Thursday 10:20 – 12:00)
Invited Session by Emmanuel Abbe

  • R. Urbanke
    • Latest and Greatest on Spatially Coupled Codes
  • A. Saber Tehrani and A. G. Dimakis
    • Coding Theory and Compressed Sensing through Convex Relaxations
  • Y.-H. Kim
    • Hybrid Coding
  • E. Telatar
    • Polar Coding
  • A. Orlitsky
    • Competitive Classification

Session 5: Coding I (Thursday 13:20 – 15:00)
Chaired by Hans-Andrea Loeliger

  • N. Goela, E. Abbe, and M. Gastpar
    • Polar Codes for the Deterministic Broadcast Channel
  • R. Blasco-Serrano, R. Thobaben, and M. Skoglund
    • Polar Codes for Coordination in Cascade Networks
  • M. Karzand
    • Polar Codes for Degraded Relay Channels
  • A. Zeh, A. Wachter, and M. Bossert
    • Unambiguous Decoding of Generalized Reed–Solomon Codes beyond Half the Minimum Distance
  • A. Grant, I. Land, and G. Wang
    • Iteration-Constrained Design of IRA Codes

Session 6: Coding II (Thursday 15:30 – 17:10)
Chaired by Alex Grant

  • R. Subramanian
    • The Relation between Block Length and Reliability for a Cascade of AWGN Links
  • X. Li and R. Matsumoto
    • Secure Multiplex Coding over Interference Channel with Confidential Messages
  • N. Macris and M. Vuffray
    • Polymer Expansions for Cycle LDPC Codes
  • D. Conti and N. Boston
    • Factoring Linear Trellises
  • M. Huber
    • Information Theoretic Authentication and Secrecy Codes in the Splitting Model

Keynote Lecture (Friday 09:00 – 10:00)

  • Mitchell Trott
    • Why is Wyner-Ziv coding for video so difficult?

Session 7: Streaming, Relaying, and Rateless-Coding (Friday 10:20 – 12:00)
Invited Session by Uri Erez

  • R. Zamir
    • Anti-Structure Problems
  • A. Khisti, F. Etezadi, and M. Trott
    • Real-Time Coding of Markov Sources over Erasure Channels: When is Binning Optimal?
  • D. Shah
    • Spinal Codes
  • U. Erez and G. W. Wornell
    • SuperNyquist Rateless Coding for Intersymbol Interference Channels
  • B. Nazer
    • Successive Compute-and-Forward

Session 8: Coding for Wireless Communication (Friday 13:20 – 15:00)
Invited Session by Emanuele Viterbo

  • E. Soljanin
    • What are Good Coding Schemes for Multicast in Heterogeneous Wireless Networks?
  • S. Feizi, D. E. Lucani, and M. Médard
    • Tunable Sparse Network Coding
  • M. Bossert
    • Coding for Wireless Communications
  • J.-C. Belfiore and C. Ling
    • The Flatness Factor in Lattice Network Coding: Design Criterion and Decoding Algorithm
  • E. Viterbo
    • Wideband non-coherent Wireless Communications

Session 9: Communication Theory (Friday 15:30 – 17:10)
Chaired by Tobias Koch

  • M. L. Jakobsen, T. Pedersen, and B. H. Fleury
    • Analysis of the Stochastic Channel Model by Saleh & Valenzuela via the Theory of Point Processes
  • A. Schenk and R. F. H. Fischer
    • Low-Complexity Soft-Output Detection for Impulse-Radio Ultra-Wideband Systems via Combining Multiple Observations
  • G. Levin and S. Loyka
    • Amplify-and-Forward versus Decode-and-Forward Relaying: Which Is Better?
  • A. Singh, P. Elia, and J. Jaldén
    • Complexity Analysis for ML-based Sphere Decoder Achieving a Vanishing Performance-Gap to Brute-Force ML Decoding
  • J. Freudenberger and U. Kaiser
    • Symbol-by-Symbol APP Decoding based on Supercode Decoding