IZS 2016 Conference Program

Tuesday, March 1

16:00 – 18:00 Registration desk open

Wednesday, March 2

07:30 Registration desk opens
08:25 Opening address
08:30 – 09:30   Keynote Lecture by Martin Bossert (Universität Ulm)
Coffee break
10:00 – 12:00 Session 1: Topics in Shannon Theory
Lunch break
13:20 – 15:00 Session 2: Invited Session: Codes on Graphs and Lattices
Coffee break
15:30 – 16:50 Session 3: Invited Session: Wireless Communication (with emphasis on
Finite Blocklength Information Theory)
Short break
17:00 – 18:00 Session 4: Privacy and Secrecy

Thursday, March 3

08:30 – 09:30   Keynote Lecture by Shlomo Shamai (Shitz) (Technion)
Coffee break
10:00 – 12:00 Session 5: Communication Techniques
Lunch break
13:20 – 15:00 Session 6: Invited Session: Information Theoretic Security
Coffee break
15:30 – 17:30 Session 7: Network Information Theory
19:00 – end Conference Banquet at Restaurant Belvoirpark

Friday, March 4

08:30 – 09:30   Keynote Lecture by Prakash Narayan (University of Maryland)
Coffee break
10:00 – 12:00 Session 8: Coding Techniques
Lunch break
13:20 – 15:00 Session 9: Invited Session: Shannon Theory
Coffee break
15:30 – 16:50 Session 10: Invited Session: Hypothesis Testing and Converse Bounds

All talks are 20 min.

Keynote Lecture (Wednesday 08:30 – 09:30)

  • On Decoding Reed-Solomon Codes Beyond Half the Minimum Distance
    Martin Bossert (Universität Ulm)

Session 1: Topics in Shannon Theory (Wednesday 10:00 – 12:00)
Chaired by Yuval Kochman (Hebrew University of Jerusalem)

  • Channel Detection in Coded Communication
    N. Weinberger, N. Merhav
  • A Converse for Lossy Source Coding in the Finite Blocklength Regime
    L. Palzer, R. Timo
  • Frequency Hopping does not Increase Anti-Jamming Resilience of Wireless Channels
    M. Wiese, P. Papadimitratos
  • Tracking Unstable Autoregressive Sources over Discrete Memoryless Channels
    R. Timo, B. N. Vellambi, A. Grant, K. D. Nguyen
  • Strong Converse for General Compound Channels
    S. Loyka, C. D. Charalambous
  • Refined Error Probability Approximations in Quasi-Static Erasure Channels
    J. Font-Segura, A. Martinez, A. Guillén i Fàbregas

Session 2: Codes on Graphs and Lattices (Wednesday 13:20 – 15:00)
Invited Session by Joseph J. Boutros (Texas A & M University at Qatar)

  • A Deterministic Construction and Density Evolution Analysis for Generalized Product Codes
    C. Häger, H. D. Pfister, A. Graell i Amat, F. Brännström, E. Agrell
  • Locally Repairable Codes with Availability and Hierarchy: Matroid Theory via Examples
    R. Freij-Hollanti, T. Westerbäck, C. Hollanti
  • Reed-Muller Codes: Thresholds and Weight Distribution
    M. Mondelli, S. Kudekar, S. Kumar, H. D. Pfister, E. Şaşoğlu, R. Urbanke
  • From LDPC Codes to LDA Lattices: A Capacity Result
    N. di Pietro, G. Zémor, J. J. Boutros
  • Multilevel Coded Modulation and Lattice Construction D
    R. Zamir

Session 3: Wireless Communication (with emphasis on Finite Blocklength Information Theory) (Wednesday 15:30 – 16:50)
Invited Session by Giuseppe Durisi (Chalmers University of Technology)

  • Design Considerations for Downlink Broadcast Frame with Short Data Packets
    K. F. Trillingsgaard, P. Popovski
  • The Dispersion of Nearest-Neighbor Decoding for Additive Non-Gaussian Channels
    J. Scarlett, V. Y. F. Tan, G. Durisi
  • Resource-Aware Incremental Redundancy in Feedback and Broadcast
    R. D. Wesel, K. Vakilinia, S. V. S. Ranganathan, T. Mu, D. Divsalar
  • A Beta-Beta Achievability Bound with Applications
    W. Yang, A. Collins, G. Durisi, Y. Polyanskiy, H. V. Poor

Session 4: Privacy and Secrecy (Wednesday 17:00 – 18:00)
Chaired by Roy Timo (Technische Universität München)

  • Pairwise Secret Key Agreement based on Location-derived Common Randomness
    S. Salimi, P. Papadimitratos
  • Strong Secrecy for Cooperative Broadcast Channels
    Z. Goldfeld, G. Kramer, H. H. Permuter, P. Cuff
  • Context Trees for Privacy-Preserving Modeling of Genetic Data
    L. Kusters, T. Ignatenko

Keynote Lecture (Thursday 08:30 – 09:30)

  • An Information Theoretic View of Fronthaul-Constrained Cloud Radio Access Networks
    Shlomo Shamai (Shitz) (Technion – Israel Institute of Technology)

Session 5: Communication Techniques (Thursday 10:00 – 12:00)
Chaired by Richard Wesel (University of California, Los Angeles)

  • Hybrid DF-CF-DT for Buffer-Aided Relaying
    M. Shaqfeh, A. Zafar, H. Alnuweiri, M.-S. Alouini
  • Extended Delivery Time Analysis for Opportunistic Secondary Packet Transmission without Work-preserving
    M. Usman, H.-C. Yang, M.-S. Alouini
  • Beamforming towards Regions of Interest for Multi-Site Mobile Networks
    P. Hurley, M. Simeoni
  • EXIT Chart Analysis of the UMTS Turbo Code in VLF Channels
    A. Hamilton
  • Channel Vector Subspace Estimation from Sample Covariance of Low-Dimensional Projections
    S. Haghighatshoar, G. Caire
  • Factorization Approaches in Lattice-Reduction-Aided and Integer-Forcing Equalization
    R. F. H. Fischer, M. Cyran, S. Stern

Session 6: Information Theoretic Security (Thursday 13:20 – 15:00)
Invited Session by Ashish Khisti (University of Toronto)

  • Recent Results on Broadcast Networks with Layered Decoding and Secrecy: An Overview
    S. Zou, Y. Liang, L. Lai, H. V. Poor, S. Shamai
  • Semantic Security using a Stronger Soft-Covering Lemma
    P. Cuff, Z. Goldfeld, H. H. Permuter
  • The Gap to Practical MIMO Wiretap Codes
    A. Khina, Y. Kochman, A. Khisti
  • On Secure Broadcasting Over Parallel Channels with Independent Secret Keys
    R. F. Schaefer, A. Khisti, H. V. Poor
  • Privacy Preserving Rechargeable Battery Policies for Smart Metering Systems
    S. Li, A. Khisti, A. Mahajan

Session 7: Network Information Theory (Thursday 15:30 – 17:30)
Chaired by Elza Erkip (New York University)

  • A Rate-Distortion Approach to Caching
    R. Timo, S. Saeedi Bidokhti, M. Wigger, B. C. Geiger
  • Improving on the Cut-Set Bound via a Geometric Analysis of Typical Sets
    X. Wu, A. Özgür
  • The Capacity of the State-Dependent Semideterministic Relay Channel
    R. Kolte, A. Özgür, H. H. Permuter
  • Random Coding Error Exponents for the Two-User Interference Channel
    W. Huleihel, N. Merhav
  • A Necessary and Sufficient Condition for the Asymptotic Tightness of the Shannon Lower Bound
    T. Koch
  • Rate-Distortion of a Heegard-Berger Problem with Common Reconstruction Constraint
    M. Benammar, A. Zaidi

Keynote Lecture (Friday 08:30 – 09:30)

  • Common Randomness, Querying and Large Probability Sets
    Prakash Narayan (University of Maryland)

Session 8: Coding Techniques (Friday 10:00 – 12:00)
Chaired by Erik Agrell (Chalmers University of Technology)

  • On the Burst Erasure Correctability of Spatially Coupled LDPC Ensembles
    N. Rengaswamy, L. Schmalen, V. Aref
  • The Fractality of Polar Codes
    B. C. Geiger
  • Sampling Algorithms for Lattice Gaussian Codes
    A. Campello, J.-C. Belfiore
  • Fixed-Energy Random Coding with Rescaled Codewords at the Transmitter
    D. Fehr, J. Scarlett, A. Martinez
  • Quantization and LLR Computation for Physical Layer Security
    O. Graur, N. Islam, A. Filip, W. Henkel
  • An Importance Sampling Algorithm for the Ising Model with Strong Couplings
    M. Molkaraie

Session 9: Shannon Theory (Friday 13:20 – 15:00)
Invited Session by Anelia Somekh-Baruch (Bar-Ilan University)

  • Capacity Scaling Bounds in Wideband Cellular Networks
    F. Gómez-Cuba, S. Rangan, E. Erkip, F. J. González-Castaño
  • On the Secrecy Capacity of the Z-Interference Channel
    R. Bustin, M. Vaezi, R. F. Schaefer, H. V. Poor
  • Two Applications of the Gaussian Poincaré Inequality in the Shannon Theory
    S. L. Fong, V. Y. F. Tan
  • Cooperation Strategies for the Broadcast and Multiple Access Channels
    Y. Steinberg
  • Mismatched Decoding: DMC and General Channels
    A. Somekh-Baruch

Session 10: Hypothesis Testing and Converse Bounds (Friday 15:30 – 16:50)
Invited Session by Albert Guillén i Fàbregas (Universitat Pompeu Fabra, Barcelona)

  • Classical and Classical-Quantum Sphere Packing Bounds: Rényi vs Kullback and Leibler
    M. Dalai
  • Converses from Non-Signalling Codes and their Relationship to Converses from Hypothesis Testing
    W. Matthews
  • Combining Detection with Other Tasks of Information Processing
    N. Merhav
  • Hypothesis Testing and Quasi-Perfect Codes
    G. Vazquez-Vilar, A. Guillén i Fàbregas, S. Verdú

Back to the IZS 2016 home page.