ITW 2015

Full Program

Sunday 26 April – Day 0

6:00-10:00 (evening) Registration and Welcome Reception — Mishkenot Sha’ananim (conference venue)

Monday 27 April – Day 1

8:30-9:30 Plenary Session — Auditorium
Plenary talk: Neri Merhav (Technion)
Information and Physics – Better Together
9:40-11:00 I1: New applications of lattice codes — Auditorium
Organizers: B. Nazer, M. Gastpar
C1: Graphical and algebraic models — Djanogly Hall
Chair: Dan Costello
9:40-10:00 Or Ordentlich, Uri Erez, Bobak Nazer. On Compute-and-Forward with feedback David Forney. Unique factorization and controllability of tail-biting trellis realizations via controller granule decompositions
10:00-10:20 SongNam Hong, Ivana Maric, Dennis Hui, Giuseppe Caire. Multihop virtual full-duplex relay channels Sarah Allen, Ryan O’Donnell. Conditioning and covariance on caterpillars
10:20-10:40 Jean-Claude Belfiore, Yi Hong, Emanuele Viterbo. Harmonic analysis of binary functions Yatao Bian, Alexey Gronskiy, Joachim Buhmann. Greedy MAX-CUT algorithms and their information content
10:40-11:00 Shashank Vatedka,Navin Kashyap. Nested lattice codes for secure bidirectional relaying with asymmetric channel gains Sihem Mesnager, Gérard Cohen. Cyclic codes and algebraic immunity of Boolean functions

11:00-11:20 Break                                                             
11:20-12:40  I2: Interactive communication and computation — Auditorium
Organizer: Alexander Barg
 C2: Interference channels — Djanogly Hall
Chair: Haim Permuter
11:20-11:40 Ignacio Cascudo. Powers of codes and applications to cryptography  Michèle Wigger, Roy Timo, Shlomo Shamai (Shitz). Conferencing in Wyner’s asymmetric interference network: effect of number of rounds
11:40-12:00 Rotem Oshman. Information complexity for massively parallel computation Alex Dytso, Daniela Tuninetti, Natasha Devroye. The Gaussian interference channel with lack of codebook knowledge at one receiver: symmetric capacity to within a gap with a PAM input
12:00-12:20 Vinod Prabhakaran. Tension bounds for interactive systems Inaki Aguerri, Deniz Gündüz. Gaussian joint source-channel coding for the strong interference channel
12:20-12:40 Ofer Shayevitz, Assaf Ben-Yishai. The AWGN BC with MAC feedback: A reduction to noiseless feedback via interaction Meryem Benammar, Pablo Piantanida, Shlomo Shamai (Shitz). Capacity results for the multicast cognitive interference channel
12:40-2:00 Lunch on site                                                    
2:00-3:20 I3: Advances in multi-terminal information — Auditorium
Organizer: Amos Lapidoth
 C3:  Wireless communication and quantization — Djanogly Hall
Chair: Joseph Boutros
2:00-2:20 Benjamin Larousse, Samson Lasaulce, Michèle Wigger. Coordinating partially-informed agents over state-dependent networks Jithin R, Bikash Dey, Emanuele Viterbo. Oblivious transfer over OFDM and MIMO channels
2:20-2:40 Gerhard Kramer. Capacity of deterministic, half-duplex, line networks with two sources Zhao Wang, Ming Xiao, Mikael Skoglund, H. Vincent Poor. Secrecy degrees of freedom of the two-user MISO broadcast channel with mixed CSIT
2:40-3:00 Prakash Narayan. Interactive multi-terminal communication Mainak Chowdhury, Alexandros Manolakos, Felipe Gómez-Cuba, Elza Erkip, Andrea Goldsmith. Capacity scaling in noncoherent wideband massive SIMO systems
3:00-3:20 Sudeep Kamath, Young-Han Kim. The role of directed information in network capacity Alon Kipnis, Andrea Goldsmith, Yonina Eldar. Sub-Nyquist sampling achieves optimal rate-distortion
3:20-3:40 Break                                                             
3:40-5:00  I4: Information theory for optical communication — Auditorium
Organizer: Meir Feder
 C4: Multi-terminal communication — Djanogly Hall
Chair: Antonia Tulino
3:40-4:00 Erik Agrell, Giuseppe Durisi, Pontus Johannisson. Information-theory-friendly models for fiber-optic channels: A primer Jonathan Ponniah, Liang-Liang Xie, P. R. Kumar. The two-way multi-relay channel
4:00-4:20 Cristian Antonelli. Challenges in fiber-optic space division multiplexing Martina Cardone, Daniela Tuninetti, Raymond Knopp. The approximate optimality of simple schedules for half-duplex multi-relay networks
4:20-4:40 Gerhard Kramer. Upper bound on the capacity of a cascade of  nonlinear and noisy channels Ronit Bustin, Rafael Schaefer, H. Vincent Poor, Shlomo Shamai (Shitz). On MMSE properties of optimal codes for the Gaussian wiretap channel
4:40-5:00 Ronen Dar. Shaping in the nonlinear fiber-optic channel Tara Javidi, Yonatan Kaspi, Himanshu Tyagi. Gaussian estimation under attack uncertainty
5:00-8:00 (evening)  Walking tour to the old city

Tuesday 28 April – Day 2

8:30-9:30 Plenary Session — Auditorium
Plenary talk: Andrea Montanari (Stanford)
The Hidden Submatrix Problem
9:40-11:00  C5: Broadcast channels — Auditorium
Chair: Prakash Narayan
C6: Applications of polarization — Djanogly Hall
Chair: Ido Tal
HDPCC Workshop I — Fostell Hall
Chair: David Forney
9:40-10:00 Yonathan Murin, Yonatan Kaspi, Ron Dabora, Deniz Gündüz. On the transmission of a bivariate Gaussian source over the Gaussian broadcast channel with feedback Talha Gulcu, Alexander Barg. Achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component Xishuo Liu, Stark Draper. ADMM decoding of error correction codes: from geometries to algorithms – Part 1
10:00-10:20 Sibi Pillai, Vinod Prabhakaran. On the noisy feedback capacity of Gaussian broadcast channels Remi Chou, Matthieu Bloch. Polar coding for the broadcast channel with confidential messages Xishuo Liu, Stark Draper. ADMM decoding of error correction codes: from geometries to algorithms – Part 2
10:20-10:40 Ziv Goldfeld, Haim Permuter, Gerhard Kramer. Broadcast channels with cooperation: capacity and duality for the semi-deterministic case Yi-Peng Wei, Sennur Ulukus. Polar coding for the general wiretap channel Alex Yufit, Yair Be'ery.On ADMM decoding of HDPC codes
10:40-11:00 Andrea Grigorescu, Holger Boche, Rafael Schaefer, H. Vincent Poor. Capacity region continuity of the compound broadcast channel with confidential messages Ling Liu, Yanfei Yan, Cong Ling. Secrecy-good polar lattices with optimal shaping for the Gaussian wiretap channels Florian Gensheimer, Stefan Ruzika. Towards hardware-efficient LP decoding
11:00-11:20 Break                                                             
11:20-12:40  C7: Network coding — Auditorium
Chair: Elza Erkip
 C8: Source and channel coding — Djanogly Hall
Chair: Ertem Tuncel
HDPCC Workshop II — Fostell Hall
Chair: Alexander Vardy
11:20-11:40 Jingge Zhu, Michael Gastpar. Compute-and-Forward using nested linear codes for the Gaussian MAC Or Ordentlich, Ofer Shayevitz. Subset-universal lossy compression Aman Bhatia, Veeresh Taranalli, Paul Siegel, Shafa Dahandeh, Anantha Krishnan, Patrick Lee, Dahua Qin, Moni Sharma, Teik Yeo. Polar codes for magnetic recording channels
11:40-12:00 Yunyan Chang, Slawomir Stanczak, Chan Zhou. Throughput scaling for random hybrid wireless networks with physical-layer network coding Sergey Tridenski, Ram Zamir. Stochastic interpretation for the Arimoto algorithm Michael Helmling, Eirik Rosnes, Stefan Ruzika. On maximum-likelihood decoding of polar codes
12:00-12:20 Shenghao Yang, Yi Chen, Soung Liew, Lizhao You. Coding for network-coded slotted ALOHA Nir Elkayam, Meir Feder. Achievable and converse bounds over a general channel and general decoding metric Jinwoo Shin, Sungsoo Ahn, Sejun Park, Misha Chertkov. Exact distributed algorithm for maximum weight matching: Blossom-BP
12:20-12:40 Nir Weinberger, Wasim Huleihel, Neri Merhav. Erasure/list random coding error exponents are not universally achievable Eirik Rosnes, Michael Helmling. On adaptive linear programming decoding of ternary linear codes
12:40-2:40 Lunch break (on own)                                            
2:40-4:20  I5: Coding with finite block-length, zero delay, multicasting, or feedback — Auditorium
Organizer/Chair: T. Weissman / A. Ozgur
 C9: Combinatorial coding theory — Djanogly Hall
Chair: Gérard Cohen
2:40-3:00 Paul Cuff. Zero-delay distortion-inducing secure source coding Marcelo Firer, Jerry Pinheiro. Bounds for complexity of syndrome decoding for poset metrics
3:00-3:20 Aditya Mahajan. Distortion-transmission trade-off in real-time transmission of Markov sources HanMao Kiah, Gregory Puleo, Olgica Milenkovic. Codes for DNA storage channels
3:20-3:40 D. Shaviv, Ayfer Ozgur, Haim Permuter. Can feedback increase the capacity of the energy harvesting channel? Xishuo Liu, Stark Draper. Encoding and decoding algorithms for LP-decodable multipermutation codes
3:40-4:00 Sergio Verdú. Non-asymptotic covering lemmas Abhinav Ganesan, Sidharth Jaggi, Venkatesh Saligrama. Non-adaptive group testing with inhibitors
4:00-4:20 Antonia Tulino. Caching and coded multicasting: multiple requests with random demands
4:20-4:40 Break                                                             
4:40-6:20  I6: Information theory-inspired signal compression and processing — Auditorium
Organizers: K. Rose, R. Zamir
C10: Coding for distributed storage — Djanogly Hall
Chair: Yuval Cassuto
4:40-5:00 Ying-zong Huang, Gregory Wornell. Separation architectures for lossy compression Alexander Zeh, Eitan Yaakobi. Optimal linear and cyclic locally repairable codes over small fields
5:00-5:20  Erman Köken, Ertem Tuncel, Deniz Gündüz. On the distortion-energy tradeoff for zero-delay transmission of a Gaussian source over the AWGN channel Kaushik Senthoor, Birenjith Sadsidharan, P. Vijay Kumar. Improved layered regenerating codes characterizing the exact-repair storage-repair bandwidth tradeoff for certain parameter sets
5:20-5:40 Kannan Ramchandran. Sparse-graph codes for sub-linear time processing of big data Abhishek Agarwal, Arya Mazumdar. Security in locally repairable storage
5:40-6:00 Kenneth Rose. Common information and the future of scalable coding in content delivery over networks Pengfei Huang, Eitan Yaakobi, Hironori Uchikawa, Paul Siegel. Cyclic linear binary locally repairable codes

Wednesday 29 April – Day 3

8:30-9:30 Plenary Session — Auditorium
Plenary talk:  Abbas El Gamal (Stanford)
Binary Broadcast Channel


9:45-late evening Conference trip to the Dead Sea and Masada

Thursday 30 April – Day 4

8:30-9:30 Plenary Session — Auditorium
Plenary talk: Andrew Barron (Yale)
Information Theory and Statistics
9:40-10:40 Special Session — Auditorium
History of Information Theory Panel
Participants: David Forney, Robert Gallager, Sergio Verdú, Andrew Viterbi, Jacob Ziv
Moderator: Antony Ephremides
10:40-11:00 Break                                                             
11:00-12:40  I7: "Big data" and learning — Auditorium
Organizer: Alon Orlitsky
C11: Lattice codes — Djanogly Hall
Chair: Arya Mazumdar
11:00-11:20 Ronitt Rubinfeld. Testing properties of distributions over very large domains Nicola di Pietro, Nour Basha, Joseph Boutros. Non-binary GLD codes and their lattices
11:20-11:40 Prasad Santhanam. Information aggregation with slow mixing Markov setups Shashank Vatedka, Navin Kashyap. Some "goodness" properties of LDA lattices
11:40-12:00 Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Suresh. Learning spherical Gaussian mixtures Amin Sakzad, Anna-Lena Trautmann, Emanuele Viterbo. Cross-packing lattices for the Rician fading channel
12:00-12:20 Naftali Tishby, Noga Zaslavsky. Deep learning and the information bottleneck principle Lakshmi Natarajan, Yi Hong, Emanuele Viterbo. Lattice index coding for the broadcast channel
12:20-12:40 Yishay Mansour. Robust inference and local algorithms Alex Karrila, Camilla Hollanti. A comparison of skewed and orthogonal lattices in Gaussian wiretap channels
12:40-2:00 Lunch on site                                                    
2:00-3:20  I8: Communication over non-standard channel models — Auditorium
Organizer: Negar Kiyavash
 C12: Prediction, belief sharing and zero error — Djanogly Hall
Chair: Shun Watanabe
2:00-2:20 Ryan Gabrys, Olgica Milenkovic. Asymmetric Lee distance codes: new bounds and constructions Joel Ratsaby. On complexity and randomness of Markov-chain prediction
2:20-2:40 Eitan Yaakobi, Alexander Vardy. Codes for RAID solutions based upon SSDs Aditya Vempaty, Lav Varshney. CEO problem for belief sharing
2:40-3:00 Arya Mazumdar.  Associative memories with linear neural networks Shlomo Engelberg, Osnat Keren. Zero-latency zero-error codes for parallel asynchronous channels with arbitrary skews
3:00-3:20 Daniel Cullina,Negar Kiyavash. Combinatorial channels from partially ordered sets Jithin R, Bikash Dey. Zero-error function computation through a bidirectional relay
3:20-3:40 Break                                                             
3:40-5:00  C13: Secrecy — Auditorium
Chair: Shlomo Shamai (Shitz)
 C14: Lossless source coding — Djanogly Hall
Chair: Marcelo Weinberger
3:40-4:00 Shaofeng Zou, Yingbin Liang, Lifeng Lai, Shlomo Shamai (Shitz). Degraded broadcast channel: secrecy outside of a bounded range Jacob Ziv. A Constrained-dictionary version of LZ78 asymptotically achieves the finite-state compressibility with a distortion measure
4:00-4:20 Zhijie Ren, Jasper Goseling, Jos Weber, Michael Gastpar. Secure transmission using an untrusted relay with scaled compute-and-forward Ayush Jain, Rakesh Bansal. Point-wise analysis of redundancy in SWLZ algorithm for $\phi$-mixing sources
4:20-4:40 Qiaosheng Zhang, Swanand Kadhe, Mayank Bakshi, Sidharth Jaggi, Alex Sprintson. Talking reliably, secretly, and efficiently: a "complete" characterization   Marcelo Weinberger. One-to-one lossless codes in the variable input-length regime: back to Kraft's inequality
4:40-5:00 Gilles Brassard, Benno Salwey, Stefan Wolf. Non-locality distillation as cryptographic game Ayush Jain, Rakesh Bansal. Exponential rates of convergence for waiting times and generalized AEP


5:30-10:00 (evening)  Banquet at the Israel Museum

Friday 1 May – Day 5

8:30-9:30 Plenary Session — Auditorium
Plenary talk: Nati Linial (Hebrew University)
A Glimpse of High-Dimensional Combinatorics
9:40-11:00 C15: LDPC codes– Auditorium
Chair: Alexey Frolov
 C16: Capacity — Djanogly Hall
Chair: Stark Draper
9:40-10:00 Yauhen Yakimenka, Vitaly Skachek. Refined upper bounds on stopping redundancy of binary linear codes Christos Kourtellaris, Charalambos Charalambous. Capacity of binary state symmetric channel with and without feedback and transmission cost
10:00-10:20 Rami Cohen, Yuval Cassuto. Design of LDPC codes for the q-ary partial erasure channel Sang-Woon Jeon, SongNam Hong, Mingyue Ji, Giuseppe Caire. On the capacity of multihop device-to-device caching networks
10:20-10:40 Kechao Huang, David Mitchell, Xiao Ma, Daniel J. Costello Jr. Asymptotic distance properties of protograph-based spatially coupled LDPC codes over GF(q) Luca Barletta, Gerhard Kramer. Upper bound on the capacity of discrete-time wiener phase noise channels
10:40-11:00 Igal Sason. Tight bounds for symmetric divergence measures Oron Sabag, Haim Permuter, Navin Kashyap. Capacity of the $(1,\infty)$-RLL input-constrained erasure channel with feedback
11:00-11:20 Break                                                             


11:20-12:40 I9: Finite block length information theory — Auditorium
Organizers: Y. Polyanskiy,S. Verdú
C17: Information theory and multi-user systems — Djanogly Hall
Chair: Shraga Bross
11:20-11:40 Victoria Kostina, Yury Polyanskiy, Sergio Verdú. Transmitting k samples over the Gaussian channel: energy-distortion tradeoff Cupjin Huang, Zihan Tan, Shenghao Yang. Upper bound on function computation in directed acyclic networks
11:40-12:00 William Matthews. Zero-error channel capacity and simulation assisted by non-local correlations Alexey Frolov, Victor Zyablov. A new coding method for a multiple-access system with a large number of active users
12:00-12:20 Oliver Kosut. Boosting output distributions in finite blocklength channel coding converse bounds Dusan Jakovetic, Aleksandar Minja, Dragana Bajovic, Dejan Vukobratovic. Distributed storage allocations for neighborhood-based data access
12:20-12:40 Wei Yang, Giuseppe Durisi, Yury Polyanskiy. Energy and spectral efficiency in fading channels
12:40-2:00 Lunch on site                                                    
2:00-3:40  I10: Physical layer security and its connections to cryptography — Auditorium
Organizer: Matthieu Bloch
 C18: Data processing applications — Djanogly Hall
Chair: Anxiao Jiang
2:00-2:20 Peter Gazi, Stefano Tessaro. Secret-key cryptography from ideal primitives: A systematic overview Muxi Yan, Alex Sprintson. Approximation algorithms for erasure correcting data exchange
2:20-2:40 Aylin Yener. New directions in information theoretic security: benefits of bidirectional signaling Anxiao Jiang, Yue Li, Jehoshua Bruck. Error correction through language processing
2:40-3:00 Renato Renner. Why classical cryptographers should care about quantum adversaries Qiwen Wang, Viveck Cadambe, Sidharth Jaggi, Moshe Schwartz, Muriel Médard. File updates under random/arbitrary insertions and deletions
3:00-3:20 Himanshu Tyagi, Shun Watanabe. Information theoretic secrecy and independence testing Michal Horovitz, Eitan Yaakobi. WOM codes with uninformed encoder
3:40- Mediterranean farewell event