Technical Program


Time Event Hall Rosa Huset, Lower Floor Rosa Huset, Upper Floor

Sunday, August 25

19:00-22:00 Welcome Reception (at Gotland Museum)

Monday, August 26

08:00-09:00 Plenary: Anant Sahai    
09:00-10:15 Poster Session I & Coffee    
10:15-12:15 MoAM1: Entropy MoAM2: Spatially Coupled Codes and Polar Codes MoAM3: Privacy
12:15-13:15 Lunch    
13:15-14:15 Plenary: Ilya Dumer    
14:20-16:00 MoPM1: Security and Privacy MoPM2: Algebraic Coding and Lattices MoPM3: Multi Terminal Information Theory
16:00-16:20 Coffee break    
16:20-18:00   MoInv1: Entropy, Information and Control 1 MoInv2: Polar Codes
18:15-20:00 City Walking Tour (meet outside the Event Hall at Donners at 18:15)

Tuesday, August 27

08:00-09:00 Plenary: Aylin Yener    
09:00-10:15 Poster Session II & Coffee    
10:15-12:15 TuAM1: Coordination, Information and Statistics TuAM2: Caching and Index Coding TuAM3: Coding for Memories
12:15-13:15 Lunch    
13:15-14:15 Plenary: Angelia Nedic    
14:20-16:00 TuPM1: Distributed Computing TuPM2: Source Coding TUPM3: Detection, Estimation and Classification
16:00-16:20 Coffee break    
16:20-18:00   TuInv1: Privacy and Security 1 TuInv2: Entropy, Information and Control 2
19:00-22:00 Workshop Banquet (at Event Hall)

Wednesday, August 28

08:00-09:00 Plenary: Olgica Milenkovic    
09:00-10:15 Poster Session III & Coffee    
10:15-11:55 WeAM1: Graph Based Codes and Message Passing WeAM2: Multi User Communications WeAM3: Error Exponents
11:55-12:55 Lunch    
12:55-13:55 Plenary: Syed Jafar    
14:00-15:40 WePM1: Coding Theory and Practice WePM2: Capacity and Mutual Information WePM3: Security
15:40-16:00 Coffee break    
16:00-17:40   WeInv1: Graph Based Codes and Spatial Coupling WeInv2: Privacy and Security 2

Monday, August 26

Monday, August 26 8:00 - 9:00

Plenary: Anant Sahai

Room: Event Hall
Harmless interpolation in learning

A continuing mystery in understanding the empirical success of deep neural networks has been in their ability to achieve zero training error and yet generalize well, even when the training data is noisy and there are many more parameters than data points. Following the information-theoretic tradition of seeking understanding, this talk will share our three-part approach to shedding light on this phenomenon. First, following the tradition of such distilled toy models like the BSC and AWGN channels, the Gaussian source, or scalar linear control systems, we zoom in on the classical linear regression problem in the underdetermined setting with more parameters than training data. Here, the solutions that minimize training error interpolate the data, including noise. Second, following the tradition of converse bounds, we give a genie-aided bound on how well such interpolative solutions can generalize to fresh test data, and show that this bound generically decays to zero with the number of extra features, thus characterizing an explicit benefit of overparameterization. Third, we talk about what it takes to achieve such harmless interpolation in appropriately overparameterized limits. For appropriately sparse linear models, we provide a hybrid interpolating scheme (combining classical sparse recovery schemes with harmless noise-fitting) to achieve generalization error close to the bound on interpolative solutions. Along the way, we call out certain key concepts that we call "signal bleed" and "crab-pot regularization" that help us understand what is required to achieve harmless interpolation in general.

Monday, August 26 9:00 - 10:15

Poster Session I & Coffee

Room: Event Hall
Relative Age of Information: A New Metric for Status Update Systems
Peng Zou, Omur Ozel, and Suresh Subramaniam (George Washington University, USA)
On The Sample Complexity of HGR Maximal Correlation Functions
Shao-Lun Huang (Tsinghua-Berkeley Shenzhen Institute, P.R. China) and Xiangxiang Xu (Tsinghua University, P.R. China)
The Additive Noise Channel with a Helper
Amos Lapidoth (ETHZ, Switzerland) and Shraga Bross (Bar-Ilan University, Israel)
Source coding with side information for binary memoryless sources
Boris D. Kudryashov and Irina Bocharova (St. Petersburg University of Information Technologies, Mechanics and Optics, Russia)
Empirical coordination subject to a fidelity criterion
Michail Mylonakis, Photios A. Stavrou, and Mikael Skoglund (KTH Royal Institute of Technology, Sweden)
Estimation of Bounded Normal Mean: An Alternative Proof for the Discreteness of the Least Favorable Prior
Semih Yagli, Alex Dytso, and H. Vincent Poor (Princeton University, USA)
A Mismatched Decoding Perspective of Channel Output Quantization
Mehdi Dabirnia and Alfonso Martinez (Universitat Pompeu Fabra, Spain), Albert Guillén i Fàbregas (ICREA and Universitat Pompeu Fabra & University of Cambridge, Spain)
Secrecy and Error Exponents of $k$-Transmitter Multiple Access Wire-tap Channel
Masahito Hayashi (Nagoya University, Japan) and Yanling Chen (University of Duisburg-Essen, Germany)
Benefits of Coding on Age of Information in Broadcast Networks
Xingran Chen and Shirin Saeedi Bidokhti (University of Pennsylvania, USA)
Differential Power Analysis Attacks from an Information-Theoretic Perspective
Andrea Grigorescu and Holger Boche (Technical University Munich, Germany)
On Designing Probabilistic Supports to Map the Entropy Region
John M. Walsh and Alejandro Erick Trofimoff (Drexel University, USA)
On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth (moved from poster session on Wed to poster session on Mon)
Ali Dehghan and Amir Banihashemi (Carleton University, Canada)

Monday, August 26 10:15 - 12:15

MoAM1: Entropy

Room: Event Hall
10:15 Guesswork for Inference in Machine Translation with Seq2seq Model
Litian Liu, Derya Malak, and Muriel Médard (MIT, USA)
10:35 Coding for Non-IID Sources and Channels: Entropic Approximations and a Question of Ahlswede
Holger Boche (Technical University Munich, Germany), Rafael F. Schaefer (Technische Universität Berlin, Germany), and H. Vincent Poor (Princeton University, USA)
10:55 A Tight Upper Bound on Mutual Information
Michal Hledík, Thomas Sokolowski, and Gašper Tkačik (IST Austria, Austria)
11:15 Mutual Information for Low-Rank Even-Order Symmetric Tensor Factorization
Clement Luneau and Nicolas Macris (EPFL, Switzerland), Jean Barbier (The Abdus Salam International Center for Theoretical Physics, Italy)
11:35 Intrinsic Randomness Problem with Respect to a Subclass of f-divergence
Ryo Nomura (Waseda University, Japan)
11:55 Stochastic stability of nonlinear dynamical systems under information constraints
Christoph Kawan (Ludwig-Maximilians-Universität München, Germany) and Serdar Yüksel (Queen's University, Canada)

MoAM2: Spatially Coupled Codes and Polar Codes

Room: Rosa Huset, Lower Floor
10:15 A Refined Scaling Law for Spatially Coupled LDPC Codes Over the Binary Erasure Channel
Roman Sokolovskii, Fredrik Brännström, and Alexandre Graell i Amat (Chalmers University of Technology, Sweden)
10:35 Optimization of Nested Array-based LDPC Codes Via Spatial Coupling
Salman Habib (New Jersey Insitute of Technology, USA), David G. M. Mitchell (New Mexico State University, USA), and Joerg Kliewer (New Jersey Institute of Technology, USA)
10:55 Density Evolution Analysis of Partially Information Coupled Turbo Codes on the Erasure Channel
Min Qiu, Xiaowei Wu, Yixuan Xie, and Jinhong Yuan (University of New South Wales, Australia)
11:15 Improved List Decoding of Polar Codes by Shifted-pruning
Mohammad Rowshan and Emanuele Viterbo (Monash University, Australia)
11:35 Purely Quantum Polar Codes
Frédéric Dupuis (Université de Lorraine, CNRS, Inria, LORIA, France), Ashutosh Goswami (University Grenoble Alpes & LIG, University Grenoble Alpes, France), Mehdi Mhalla (University of Grenoble Alpes, CNRS, Grenoble INP, LIG, France), and Valentin Savin (CEA LETI, France)
11:55 Construction of binary polarization kernels for low complexity window processing
Grigorii Trofimiuk and Peter Trifonov (ITMO University, Russia)

MoAM3: Privacy

Room: Rosa Huset, Upper Floor
10:15 On the Capacity of Private Nonlinear Computation for Replicated Databases
Sarah Obead (New Jersey Institute of Technology, USA), Hsuan-Yin Lin and Eirik Rosnes (Simula UiB, Norway), and Joerg Kliewer (New Jersey Institute of Technology, USA)
10:35 On an Equivalence Between Single-Server PIR with Side Information and Locally Recoverable Codes
Swanand Kadhe (University of California, Berkeley, USA), Anoosheh Heidarzadeh and Alex Sprintson (Texas A&M University, USA), and O. Ozan Koyluoglu (University of California, Berkeley, USA)
10:55 Capacity of Quantum Private Information Retrieval with Collusion of All But One of Servers
Seunghoan Song and Masahito Hayashi (Nagoya University, Japan)
11:15 Context Aware Laplacian Mechanism for Local Information Privacy
Mohamed Seif Eldin Mohamed, Ravi Tandon, and Ming Li (University of Arizona, USA)
11:35 Anonymity Mixes as (Partial) Assembly Queues: Modeling and Analysis
Mehmet Aktas and Emina Soljanin (Rutgers University, USA)
11:55 Private Authentication: Optimal Information Theoretic Schemes
Narges Kazempour, Mahtab Mirmohseni, and Mohammad Reza Aref (Sharif University of Technology, Iran)

Monday, August 26 12:15 - 13:15

Lunch

Room: Event Hall

Monday, August 26 13:15 - 14:15

Plenary: Ilya Dumer

Room: Event Hall
Polarization Process from a Geometric Perspective

We first describe successive cancellation (SC) decoding on a binary-input symmetric memoryless channel using the Plotkin (u,u+v) construction. Here we also briefly address the complexity and performance characteristics of SC decoding and turn to its polarization properties. Any synthetic channel is then represented as some ensemble {qi,pi} of the binary symmetric channels BSC(pi) that occur in the decoding process with different probabilities qi and have different crossover probabilities pi. We then map each BSC(pi) onto a planar unit vector (sin ai,cos ai), where sin ai=(1-pi)/2. Polarization process then becomes a pairwise angle-modifying transformation in the ensemble {qi,ai} of unit vectors that occur with different probabilities qi and have different angles ai. In the upgrading process, two ordered vectors that have angles a and b produce a unit vector that has a smaller angle arcsin(sin a sin b). Similarly, a pairwise degrading of two BSC channels yields a unit vector with a larger angle arccos(cos a cos b). We study the properties of the angles ai and estimate how they change in the upgrading-degrading process. In particular, any two input angles produce two output angles that have a larger mutual separation. We also study some other quantities associated with pairwise angle transformations. As a result, different angles polarize and tend to 0 or π/2 with probability 1. This also proves the polarizing behavior of synthetic channels.

Monday, August 26 14:20 - 16:00

MoPM1: Security and Privacy

Room: Event Hall
14:20 Can Marton Coding Alone Ensure Individual Secrecy?
in Yeong Tan, Lawrence Ong, and Behzad Asadi (The University of Newcastle, Australia)
14:40 Secrecy Capacity of a Gaussian Wiretap Channel with One-bit ADCs is Always Positive
Seung-Hyun Nam and Si-Hyeon Lee (POSTECH, Korea)
15:00 Multiple Access Channels with Byzantine Users
Neha Sangwan (Tata Institute of Fundamental Research, India), Mayank Bakshi (The Chinese University of Hong Kong, Hong Kong), Bikash K Dey (Indian Institute of Technology Bombay, India), and Vinod M Prabhakaran (Tata Institute of Fundamental Research, India)
15:20 Private Pliable Index Coding
Tang Liu and Daniela Tuninetti (University of Illinois at Chicago, USA)
15:40 Private Authentication with Physical Identifiers Through Broadcast Channel Measurements
Onur Günlü and Rafael F. Schaefer (Technische Universität Berlin, Germany), and Gerhard Kramer (Technical University of Munich, Germany)

MoPM2: Algebraic Coding and Lattices

Room: Rosa Huset, Lower Floor
14:20 Design of Guruswami-Sudan List Decoding for Elliptic Codes
Li Chen, Yunqi Wan, and Fangguo Zhang (Sun Yat-sen University, P.R. China)
14:40 New Bounds for GLD Lattices and Codes
Maiara F Bollauf (Texas A&M University at Qatar, Qatar), Joseph Jean Boutros (Texas A&M University, USA), and Nordine Mir (Texas A&M University at Qatar, Qatar)
15:00 On the Optimality of Gauss's Algorithm over Euclidean Imaginary Quadratic Fields
Christian Porter (Imperial College London, United Kingdom (Great Britain)), Shanxiang Lyu (Jinan University, P.R. China), and Cong Ling (Imperial College London, United Kingdom (Great Britain))
15:20 Gabidulin Codes with Support Constraints
Hikmet Yildiz and Babak Hassibi (California Institute of Technology, USA)
15:40 Fast Root Finding for Interpolation-Based Decoding of Interleaved Gabidulin Codes
Hannes Bartz and Thomas Jerkovits (German Aerospace Center (DLR), Germany), Sven Puchinger (Technical University of Munich, Germany), and Johan S. H. Rosenkilde (Technical University of Denmark, Denmark)

MoPM3: Multi Terminal Information Theory

Room: Rosa Huset, Upper Floor
14:20 Optimal Broadcast Rate of a Class of Two-Sender Unicast Index Coding Problems
Chinmayananda Arunachala (Indian Institute of Science, India), Vaneet Aggarwal (Purdue University, USA), and B. Sundar Rajan (Indian Institute of Science, India)
14:40 Capacity Results for Erasure Broadcast Channels with Intermittent Feedback
Alireza Vahid (University of Colorado Denver, USA), I-Hsiang Wang (National Taiwan University, Taiwan), and Shih-Chun Lin (National Taiwan University of Science and Technology, Taiwan)
15:00 Capacity of Wideband Multipath Fading Networks with Physically Degraded Broadcast
Diana C. González and Salman Salamatian (MIT, USA), Michel Daoud Yacoub (State University of Campinas, Brazil), and Muriel Médard (MIT, USA)
15:20 Rate loss in the Gaussian CEO problem
Victoria Kostina (California Institute of Technology, USA)
15:40 Achievable Rate-Distortion Region for Robust Distributed Source Coding
Arun Padakandla (University of Tennessee, USA)

Monday, August 26 16:00 - 16:20

Coffee break

Room: Event Hall

Monday, August 26 16:20 - 18:00

MoInv1: Entropy, Information and Control 1

Invited Session
Room: Rosa Huset, Lower Floor
16:20 On the continuity of the invariance entropy for hyperbolic linear control systems on Lie groups
Adriano Da Silva (University of Campinas, Brazil)
16:40 Invariance pressure for linear discrete-time systems
Fritz Colonius (Augsburg University, Germany), Alexandre Santana and Joao Cossich (State University of Maringa, Brazil)
17:00 Coding theorems for non-stochastic information
Anshuka Rangi and Massimo Franceschetti(University of California, San Diego, USA)
17:20 Stabilizing a linear system using phone calls
Mohammad Javad Khojasteh and Massimo Franceschetti (University of California, San Diego, USA), and Gireeja Ranade (University of California, Berkeley, USA)
17:40 Zero-Error Capacity of Multiple Access Channels via Nonstochastic Information
Girish N. Nair, Ghassen Zafzouf, and Jamie S Evans (University of Melbourne, Australia)

MoInv2: Polar Codes

Invited Session
Room: Rosa Huset, Upper Floor
16:20 Erasures in channel polarization
Mine Alsan (National University of Singapore, Singapore)
16:40 Partially Information Coupled Bit-Interleaved Polar Coded Modulation for 16-QAM
Xiaowei Wu and Jinhong Yuan (University of New South Wales, Australia)
17:00 Rate-Flexible Fast Polar Decoders
Seyyed Ali Hashemi (Stanford University, USA), Carlo Condo (Huawei Technologies Co. Ltd., France), Marco Mondelli (Stanford University, USA), and Warren Gross (McGill University, Canada)
17:20 Trellis-based decoding techniques for polar codes with large kernels
Peter Trifonov (Saint-Petersburg Polytechnic University & ITMO University, Russia)
17:40 Polar Code Design Aspects and Future Challenge
Wen Tong (Huawei Technologies Canada Co., Ltd., Canada)

Tuesday, August 27

Tuesday, August 27 8:00 - 9:00

Plenary: Aylin Yener

Room: Event Hall
Information Security in the All-Connected World

An all-wireless vision connecting billions of devices is finally in sight with the Internet-of-Everything paradigm. This vision entails large networks with dynamic connectivity, ad hoc formation and heterogeneous nodes. Central to be able to integrate all our lives to this massive virtual domain is security and privacy of the information that flows through it. Current wireless systems have security of information as an add-on to current design, and rely on application layer protocols, which have worked well for the scale and the resources of the systems to date. Going forward however, with massive scale formation of networks of asymmetric resources, these protocols involving key exchanges and shared randomness for security may prove to be less than practical.

Securing information at the foundation of system design can alleviate these issues by replacing or strengthening the present cryptographic solutions. This foundational design approach brings us to information theoretic security for the all-connected world. In this talk, we will provide an overview of this approach that relies on local randomness and produces information theoretic security guarantees, e.g, for confidentiality and authentication, utilizing the properties of the transmission medium. We will review the insights that have emerged when information security is included as a design primitive and provide the state of the art directions towards realizing the potential of this approach. We will also introduce models where this approach can be integrated with encryption for nodes with local memory storage.

Tuesday, August 27 9:00 - 10:15

Poster Session II & Coffee

Room: Event Hall
Second-Order Asymptotics of the Continuous-Time Poisson Channel
Yuta Sakai (National University of Singapore, Singapore), Mladen Kovačević (University of Novi Sad, Serbia), and Vincent Y. F. Tan (National University of Singapore, Singapore)
Interval Algorithm for Random Number Generation: Information Spectral Approach
Shun Watanabe (Tokyo University of Agriculture and Technology, Japan) and Te Sun Han (University of Electro-Communications, Japan)
Strongly Secure Ramp Secret Sharing Schemes from Any Linear Secret Sharing Schemes
Reo Eriguchi and Noboru Kunihiro (The University of Tokyo, Japan)
On Characterization of Entropic Vectors at the Boundary of Almost Entropic Cones
Hitika Tiwari and Satyajit Thakor (Indian Institute of Technology Mandi, India)
An Upper Bound on the Capacity of the DNA Storage Channel
Andreas Lenz (Technical University of Munich, Germany), Paul H. Siegel (University of California, San Diego, USA), Antonia Wachter-Zeh (Technical University of Munich, Germany), and Eitan Yaakobi (Technion, Israel)
A Submodularity-based Clustering Algorithm for the Information Bottleneck and Privacy Funnel
Ni Ding (Data61, The Commonwealth Scientific and Industrial Research Organisation, Australia) and Parastoo Sadeghi (The Australian National University, Australia)
On Error Decoding of Locally Repairable and Partial MDS Codes
Lukas Holzbaur, Sven Puchinger, and Antonia Wachter-Zeh (Technical University of Munich, Germany)
On Code Design for Wireless Channels with Additive Radar Interference
Federico Brunero, Daniela Tuninetti, and Natasha Devroye (University of Illinois at Chicago, USA)
Non-malleable Coding for Arbitrary Varying Channels
Fuchun Lin (Nanyang Technological University, Singapore), San Ling (NTU, Singapore), Reihaneh Safavi-Naini (University of Calgary, Canada), and Huaxiong Wang (Nanyang Technological University, Singapore)
Age of Information for Updates with Distortion
Melih Bastopcu and Sennur Ulukus (University of Maryland, USA)
From the Spectrum of the Adjacency Matrix to the Spectrum of Directed Edge Matrix: Counting Cycles of a Bipartite Graph Through a Simple Equation (moved from WeAM1 to poster session on Tue)
Ali Dehghan and Amir Banihashemi (Carleton University, Canada)

Tuesday, August 27 10:15 - 12:15

TuAM1: Coordination, Information and Statistics

Room: Event Hall
10:15 Some Results on Distributed Source Simulation with no Communication
Tomer Berg and Ofer Shayevitz (Tel Aviv University, Israel), Young-Han Kim (UCSD, USA), and Lele Wang (University of British Columbia, Canada)
10:35 Coordination Coding with Causal Decoder for Vector-valued Witsenhausen Counterexample Setups
Tobias J. Oechtering (KTH Royal Institute of Technology, Sweden) and Mael Le Treust (ETIS UMR 8051, Université Cergy-Pontoise, ENSEA, CNRS, France)
10:55 Fixed-Length Strong Coordination
Giulia Cervia, Tobias J. Oechtering, and Mikael Skoglund (KTH Royal Institute of Technology, Sweden)
11:15 Coordination via Shared Randomness
Gowtham R Kurri and Vinod M Prabhakaran (Tata Institute of Fundamental Research, India)
11:35 Learning and Adaptive Data Analysis via Maximal Leakage
Amedeo R Esposito and Michael Gastpar (EPFL, Switzerland), and Ibrahim Issa (American University of Beirut, Lebanon)
11:55 On the Information-Theoretic Limits of Noisy Sparse Phase Retrieval
Lan V. Truong and Jonathan Scarlett (National University of Singapore, Singapore)

TuAM2: Caching and Index Coding

Room: Rosa Huset, Lower Floor
10:15 On the Fundamental Limit of Coded Caching Systems with a Single Demand Type
Shuo Shao (Shanghai Jiaotong University, P.R. China), Jesús Gómez-Vilardebó (CTTC, Spain), Kai Zhang, and Chao Tian (Texas A&M University, USA)
10:35 Coded Caching with Optimized Shared-Cache Sizes
Emanuele Parrinello and Petros Elia (EURECOM, France)
10:55 Centralized Coded Caching with User Cooperation
Jiahui Chen (Shanghaitech University, P.R. China), Haoyu Yin and Xiaowen You (ShanghaiTech University, P.R. China), Yanlin Geng (State Key Lab. of ISN, Xidian University, P.R. China), and Youlong Wu (ShanghaiTech University, P.R. China)
11:15 Multi-access coded caching: gains beyond cache-redundancy
Berksan Serbetci, Emanuele Parrinello, and Petros Elia (EURECOM, France)
11:35 Embedded Index Coding
Alexandra Porter and Mary Wootters (Stanford University, USA)
11:55 A Field-Size Independent Code Construction for Groupcast Index Coding Problems
Mahesh Babu Vaddi and B. Sundar Rajan (Indian Institute of Science, India)

TuAM3: Coding for Memories

Room: Rosa Huset, Upper Floor
10:15 Coded Trace Reconstruction
Mahdi Cheraghchi (Imperial College London, United Kingdom (Great Britain)), Ryan Gabrys (SPAWAR Pacific, USA), Olgica Milenkovic (University of Illinois at Urbana-Champaign (UIUC), USA), João Ribeiro (Imperial College London, United Kingdom (Great Britain))
10:35 A New Family of Constrained Codes with Applications in Data Storage
Ahmed Hareedy and Robert Calderbank (Duke University, USA)
10:55 Increasing the Lifetime of Flash Memories Using Multi-Dimensional Graph-Based Codes
Ahmed Hareedy, Rohith Kuditipudi, and Robert Calderbank (Duke University, USA)
11:15 Iterative Programming of Noisy Memory Cells
Michal Horovitz (Tel-Hai College, Upper Galilee & The Galilee Research Institute - Migal, Upper Galilee, Israel), Eitan Yaakobi (Technion, Israel), Eyal En Gad (Micron Technology, USA), and Jehoshua Bruck (California Institute of Technology, USA)
11:35 Endurance-Limited Memories with Informed Decoder
Michal Horovitz (Tel-Hai College, Upper Galilee & The Galilee Research Institute - Migal, Upper Galilee, Israel), Yeow Meng Chee (National University of Singapore, Singapore), Alexander Vardy (University of California San Diego, USA), Van Khu Vu (Nanyang Technological University, Singapore), and Eitan Yaakobi (Technion, Israel)
11:55 Reconstruction and Error-Correction Codes for Polymer-Based Data Storage
Srilakshmi Pattabiraman (University of Illinois at Urbana-Champaign, USA), Ryan Gabrys (University of California, San Diego), and Olgica Milenkovic (University of Illinois at Urbana-Champaign (UIUC), USA)

Tuesday, August 27 12:15 - 13:15

Lunch

Room: Event Hall

Tuesday, August 27 13:15 - 14:15

Plenary: Angelia Nedic

Room: Event Hall
Distributed Algorithms for Optimization in Networks

We will overview the distributed optimization algorithms starting with the basic underlying idea illustrated on a prototype problem in machine learning. In particular, we will focus on convex minimization problem where the objective function is given as the sum of convex functions, each of which is known by an agent in a network. The agents communicate over the network with a task to jointly determine a minimum of the sum of their objective functions. The communication network can vary over time, which is modeled through a sequence of graphs over a static set of nodes (representing the agents in a system). In this setting, the distributed first-order methods will be discussed that make use of an agreement protocol, which is a mechanism replacing the role of a coordinator. We will discuss some refinements of the basic method and conclude with more recent developments of fast methods that can match the performance of centralized methods (up to a logarithmic factor).

Tuesday, August 27 14:20 - 16:00

TuPM1: Distributed Computing

Room: Event Hall
14:20 Stochastic Gradient Coding for Flexible Straggler Mitigation in Distributed Learning
Rawad Bitar (Rutgers University, USA), Mary Wootters (Stanford University, USA), and Salim El Rouayheb (Rutgers University, USA)
14:40 Coded Distributed Computing: Performance Limits and Code Designs
Mohammad Vahid Jamali, Mahdi Soleymani, and Hessam Mahdavifar (University of Michigan, USA)
15:00 Collaborative Decoding of Polynomial Codes for Distributed Computation
Adarsh M Subramaniam, Anoosheh Heidarzadeh, and Krishna Narayanan (Texas A&M University, USA)
15:20 Non-Colluding Attacks Identification in Distributed Computing
Arnav Solanki, Martina Cardone, and Soheil Mohajer (University of Minnesota, USA)
15:40 Degree Tables for Secure Distributed Matrix Multiplication
Rafael Lucas D'Oliveira and Salim El Rouayheb (Rutgers University, USA), Daniel Heinlein (Aalto University, Finland), and David Karpuk (Universidad de los Andes, Colombia)

TuPM2: Source Coding

Room: Rosa Huset, Lower Floor
14:20 Block Source Coding with Sequential Encoding
Hamid Ghourchian, Photios A. Stavrou, Tobias J. Oechtering, and Mikael Skoglund (KTH Royal Institute of Technology, Sweden)
14:40 Mismatched Guesswork and One-to-One Codes
Salman Salamatian, Litian Liu, Ahmad Beirami, and Muriel Médard (MIT, USA)
15:00 On Enhancing the Fixed Block-Length Coding Scheme for Joint source-channel communication
Arun Padakandla (University of Tennessee, USA)
15:20 An Explicit Construction of Optimal Streaming Codes for Channels with Burst and Arbitrary Erasures
Damian Dudzicz (Ecole Polytechnique Federale de Lausanne, Switzerland), Silas L. Fong, and Ashish Khisti (University of Toronto, Canada)
15:40 An Explicit Rate-Optimal Streaming Code for Channels with Burst and Arbitrary Erasures
Elad Domanovitz (Tel Aviv University, Israel), Silas L. Fong, and Ashish Khisti (University of Toronto, Canada)

TUPM3: Detection, Estimation and Classification

Room: Rosa Huset, Upper Floor
14:20 Distributed Detection with Empirically Observed Statistics
Haiyun He (National University of Singapore, Singapore), Lin Zhou (University of Michigan, Ann Arbor), and Vincent Y. F. Tan (National University of Singapore, Singapore)
14:40 Sequential Classification with Empirically Observed Statistics
Mahdi Haghifam (University of Toronto, Canada), Vincent Y. F. Tan (National University of Singapore, Singapore), and Ashish Khisti (University of Toronto, Canada)
15:00 Properties of The Conditional Mean Estimator in Poisson Noise
Alex Dytso and H. Vincent Poor (Princeton University, USA)
15:20 The Metagenomic Binning Problem: Clustering Markov Sequences
Grant Greenberg (University of Illinois Urbana-Champaign, USA) and Ilan Shomorony (University of Illinois at Urbana-Champaign, USA)
15:40 Coding for Crowdsourced Classification with XOR Queries
James (Chin-Jen) Pang, Hessam Mahdavifar, and S. Sandeep Pradhan (University of Michigan, USA)

Tuesday, August 27 16:00 - 16:20

Coffee break

Room: Event Hall

Tuesday, August 27 16:20 - 18:00

TuInv1: Privacy and Security 1

Invited Session
Room: Rosa Huset, Lower Floor
16:20 On the Upload versus Download Cost for Secure and Private Matrix Multiplication
Wei-Ting Chang and Ravi Tandon (University of Arizona, USA)
16:40 Improved Storage for Efficient Private Information Retrieval
Karim A. Banawan (Alexandria University, Egypt), Batuhan Arasli, and Sennur Ulukus (University of Maryland, USA)
17:00 Multi-library Coded Caching with Partial Secrecy
Mireille Sarkiss (Telecom SudParis, France) and Michele A Wigger (Telecom ParisTech, France)
17:20 Secure Caching and Delivery for Combination Networks with Asymmetric Connectivity
Ahmed A Zewail and Aylin Yener (Pennsylvania State University, USA)
17:40 Relaxed Wyner's Common Information
Michael Gastpar and Erixhen Sula (EPFL, Switzerland)

Tuesday, August 27 16:20 - 17:40

TuInv2: Entropy, Information and Control 2

Invited Session
Room: Rosa Huset, Upper Floor
16:20 On Optimal Jamming in Strategic Communication
Emrah Akyol (Binghamton University - SUNY, USA)
16:40 Generic Variance Bounds on Estimation and Prediction Errors in Time Series Analysis: An Entropy Perspective
Song Fang, Mikael Skoglund, Karl Henrik Johansson(KTH Royal Institute of Technology, Sweden), Hideaki Ishii (Tokyo Institute of Technology, Japan), and Quanyan Zhu (New York University, USA)
17:00 Bidirectional Information Flow and the Roles of Privacy Masks in Cloud-Based Control
Ali Reza Pedram and Takashi Tanaka (University of Texas at Austin, USA), and Matthew Hale (University of Florida, USA)
17:20 Fundamental limits of distributed tracking
Victoria Kostina (California Institute of Technology, USA)

Wednesday, August 28

Wednesday, August 28 8:00 - 9:00

Plenary: Olgica Milenkovic

Room: Event Hall
Submodular Hypergraph Partitioning with Applications

Hypergraph partitioning is an important problem in machine learning, computer vision, VLSI design and network analytics. A widely used method for hypergraph partitioning relies on minimizing a normalized sum of the costs of placing hyperedges across clusters. Algorithmic solutions for this approach assume that different partitions of a hyperedge incur the same cost. However, this assumption fails to address settings in which different subsets of vertices in the same hyperedge provide different contributions to the underlying higher order relations. To accommodate nonuniform partitioning costs, we introduce the notions of inhomogeneous spectral hypergraph partitioning and submodular hypergraphs. Inhomogeneous spectral partitioning produces a quadratic approximation to the optimal solution if the costs satisfy submodularity constraints. We illustrate the advantages of inhomogenous over classical hypergraph partitioning on applications as diverse as structure learning of rankings, subspace segmentation and motif clustering.

Wednesday, August 28 9:00 - 10:15

Poster Session III & Coffee

Room: Event Hall
On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth (moved from poster session on Wed to poster session on Mon)
Ali Dehghan and Amir Banihashemi (Carleton University, Canada)
On the Minrank of Symmetric and Neighboring Side-information Index Coding Problems
Mahesh Babu Vaddi and B. Sundar Rajan (Indian Institute of Science, India)
Covariance Evolution for Spatially ``Mt. Fuji'' Coupled LDPC Codes
Yuta Nakahara and Toshiyasu Matsushima (Waseda University, Japan)
Practical Universal Data Exchange using Polar Codes
Soumya Subhra Banerjee and Himanshu Tyagi (Indian Institute of Science, India)
Optimizing Polar Codes Compatible with Off-the-Shelf LDPC Decoders
Moustafa Ebada, Ahmed Elkelesh, and Stephan ten Brink (University of Stuttgart, Germany)
SC-Flip Decoding of Polar Codes with High Order Error Correction Based on Error Dependency
Carlo Condo, Valerio Bioglio, and Ingmar Land (Huawei Technologies France & Paris Research Centre, France)
Improved decoding of second-order Reed-Muller codes
Kirill Ivanov and Ruediger L Urbanke (EPFL, Switzerland)
Coset Probability based Majority-logic Decoding for Non-binary LDPC Codes
Viduranga Wijekoon, Emanuele Viterbo, Yi Hong (Monash University, Australia), Shuiyin Liu (Holmes Institute, Australia), Rino Micheloni, and Alessia Marelli (Microsemi, Italy)
Enhanced Quasi-Maximum Likelihood Decoding of Short LDPC Codes Based on Saturation
Peng Kang, Yixuan Xie, Lei Yang (University of New South Wales, Australia), Chen Zheng (Huawei Technology CO., LTD, P.R. China), Jinhong Yuan (University of New South Wales, Australia), and Yuejun Wei (Huawei Technologies, P.R. China)
Deep Learning Assisted Sum-Product Detection Algorithm for Faster-than-Nyquist Signaling
Bryan Liu (University of New South Wales, Australia), Shuangyang Li (School of Electrical Engineering and Telecommunications, University of New South Wales, Australia & Xidian University, P.R. China), Yixuan Xie, and Jinhong Yuan (University of New South Wales, Australia)

Wednesday, August 28 10:15 - 11:55

WeAM1: Graph Based Codes and Message Passing

Room: Event Hall
10:15 From the Spectrum of the Adjacency Matrix to the Spectrum of Directed Edge Matrix: Counting Cycles of a Bipartite Graph Through a Simple Equation (moved from WeAM1 to poster session on Tue)
Ali Dehghan and Amir Banihashemi (Carleton University, Canada)
10:35 Small stopping sets in projective low-density parity-check codes
Yuichiro Fujiwara and Yu Tsunoda (Chiba University, Japan)
10:55 Dynamics of Damped Approximate Message Passing Algorithms
Kazushi Mimura (Hiroshima city university, Japan) and Junichi Takeuchi (Kyushu University, Japan)
11:15 Sparse Graph Codes for Non-adaptive Quantitative Group Testing
Esmaeil Karimi, Fatemeh Kazemi, Anoosheh Heidarzadeh, Krishna Narayanan, and Alex Sprintson (Texas A&M University, USA)
11:35 LDPC Code Design for Delayed Bit-Interleaved Coded Modulation
Yihuan Liao (The University of New South Wales, Australia), Lei Yang (Technology and Engineering Center for Space Utilization, Chinese Academy of Sciences, P.R. China), Jinhong Yuan (University of New South Wales, Australia), Kechao Huang (Huawei Technologies Co., Ltd., P.R. China), Raymond Leung (Huawei Technologies Co. Ltd., P.R. China), Junyi Du (Southwest China Institute of Electronic Technology, P.R. China)

WeAM2: Multi User Communications

Room: Rosa Huset, Lower Floor
10:15 New Upper Bounds on the Capacity of Primitive Diamond Relay Channels
Xiugang Wu (University of Delaware, USA)Ayfer Özgür (Stanford University, USA), Michael Peleg (Rafael ltd. & Technion - Israel Institute of Technology, Electrical Engineering, Israel), Shlomo (Shitz) Shamai (The Technion, Israel)
10:35 Channel Resolvability with a Full-Duplex Decode-and-Forward Relay
Noha Helal (University of Texas at Dallas, USA), Matthieu Bloch (Georgia Institute of Technology, USA), and Aria Nosratinia (University of Texas, Dallas, USA)
10:55 On The Stability Region of the Layered Packet Erasure Broadcast Channel with Output Feedback
Siyao Li, Hulya Seferoglu, Daniela Tuninetti, and Natasha Devroye (University of Illinois at Chicago, USA)
11:15 Mixed Delay Constraints on a Fading C-RAN Uplink
Homa Nikbakht (Telecom Paritech, France), Michele A Wigger (Telecom ParisTech, France), Walid Hachem (CNRS / LIGM - Universtié Paris Est Marne-la-Vallée, France), and Shlomo (Shitz) Shamai (The Technion, Israel)
11:35 Closed-Form Expression for the Average Age of Information in a Multi-Source M/G/1 Queueing Model
Mohammad Moltafet, Markus Leinonen, and Marian Codreanu (University of Oulu, Finland)

WeAM3: Error Exponents

Room: Rosa Huset, Upper Floor
10:15 Error Exponents of Typical Random Trellis Codes
Neri Merhav (Technion, Israel)
10:35 Error exponents of typical random codes of source-channel coding
Ran Averbuch and Neri Merhav (Technion, Israel)
10:55 Random Coding Error Exponent for the Bee-Identification Problem
Anshoo Tandon, Vincent Y. F. Tan (National University of Singapore, Singapore), and Lav R. Varshney (University of Illinois at Urbana-Champaign, USA)
11:15 Optimal Rate-Exponent Region for a Class of Hypothesis Testing Against Conditional Independence Problems
Abdellatif Zaidi (Université Paris-Est, France) and Inaki Estella (Huawei Technologies Co., Ltd., France)
11:35 On the Nonasymptotic Performance of Variable-Length Codes with Noisy Stop Feedback
Johan Östman, Rahul Devassy, Giuseppe Durisi, and Erik G Ström (Chalmers University of Technology, Sweden)

Wednesday, August 28 11:55 - 12:55

Lunch

Room: Event Hall

Wednesday, August 28 12:55 - 13:55

Plenary: Syed Jafar

Room: Event Hall
Fundamental Limits of Privacy, Security, Structure and Alignment through the Lens of Private Information Retrieval

The modern era of big data increasingly requires outsourcing of large data sets to remote servers (the cloud). Remote storage gives rise to new challenges such as user privacy and information security in addition to the concerns about data integrity, communication efficiency and computation complexity. The goal of Private Information Retrieval (PIR) is to allow users to efficiently access desired records from remotely stored datasets without revealing to the servers which records are desired. Recent information theoretic advances have led to capacity characterizations of PIR as well as several of its variants, and generated excitement for the future prospects of this rich research avenue. This is especially significant because PIR is a point of convergence of complementary perspectives. Indeed, PIR is the lens through which information theoretic analysis may be applied to a number of interconnected issues -- ranging from practical concerns such as privacy, security, integrity and computation complexity of distributed storage to broader theoretical ideas such as the structure of information and interference alignment. It is well known that PIR shares intimate connections to prominent problems in theoretical computer science and cryptography, communication and information theory, and coding and signal processing. As such, discoveries in PIR have the potential for a ripple effect in their impact on a number of related problems. The talk will highlight such connections, with special focus on privacy, security, locality, cross-subspace alignment and secure distributed matrix multiplication.

Wednesday, August 28 14:00 - 15:40

WePM1: Coding Theory and Practice

Room: Event Hall
14:00 Channel Coding at Low Capacity
Mohammad Fereydounian (University of Pennsylvania, USA), Mohammad Vahid Jamali (University of Michigan, USA), Hamed Hassani (University of Pennsylvania, USA), and Hessam Mahdavifar (University of Michigan, USA)
14:20 A New Importance Sampling Algorithm for Fast Simulation of Linear Block Codes over BSCs
Jinzhe Pan (Hong Kong University of Science and Technology, Hong Kong) and Wai Ho Mow (Hong Kong University of Science and Technology & HKUST, Hong Kong)
14:40 Codebooks of Complex Lines Based on Binary Subspace Chirps
Olav Tirkkonen (Aalto University, Finland) and Robert Calderbank (Duke University, USA)
15:00 Successive-Cancellation Decoding of Linear Source Code
Jun Muramatsu (NTT Corporation, Japan)
15:20 Neural Decoder for Topological Codes using Pseudo-Inverse of Parity Check Matrix
Chaitanya Chinni (YNOS Venture Engine CC Pvt. Ltd., India), Abhishek Kulkarni, Dheeraj M Pai, Kaushik Mitra, and Pradeep K Sarvepalli (Indian Institute of Technology Madras, India)

WePM2: Capacity and Mutual Information

Room: Rosa Huset, Lower Floor
14:00 Capacity Results for Discrete Memoryless Channels in the Finite Blocklength Regime
Yasutada Oohama (University of Electro-Communications, Japan)
14:20 On the Structure of the Capacity Formula for General Finite State Channels with Applications
Holger Boche (Technical University Munich, Germany), Rafael F. Schaefer (Technische Universität Berlin, Germany), and H. Vincent Poor (Princeton University, USA)
14:40 On the Fundamental Limits of Cooperative Multiple-Access Channels with Distributed CSIT
Lorenzo Miretti, Paul de Kerret, and David Gesbert (Eurecom Institute, France)
15:00 On the Outage-Constrained Capacity of Skip-Sliding Window Codes
Ting-Yi Wu (Sun Yat-Sen University, P.R. China), Anshoo Tandon, Mehul Motani (National University of Singapore, Singapore), and Lav R. Varshney (University of Illinois at Urbana-Champaign, USA)
15:20 Channel Ordering and Supermodularity
Arthur Américo, Pasquale Malacaria, and Arman (MHR) Khouzani (Queen Mary University of London, United Kingdom (Great Britain))

WePM3: Security

Room: Rosa Huset, Upper Floor
14:00 On Secure Capacity of Multiple Unicast Traffic over Separable Networks
Gaurav Kumar Agarwal (University of California, Los Angeles, USA), Martina Cardone (University of Minnesota, USA), and Christina Fragouli (UCLA, USA)
14:20 Transforming an arbitrary code for the wiretap channel of type I into a code for the wiretap channel of type II
Eric Graves (Army Research Lab, USA) and Allison Beemer (New Jersey Institute of Technology, USA)
14:40 A Modular Semantically Secure Wiretap Code with Shared Key for Weakly Symmetric Channels
Setareh Sharifian and Reihaneh Safavi-Naini (University of Calgary, Canada)
15:00 Keyless Covert Communication in the Presence of Non-causal Channel State Information
Hassan ZivariFard (University of Texas, Dallas, USA), Matthieu Bloch (Georgia Institute of Technology, USA), and Aria Nosratinia (University of Texas, Dallas, USA)
15:20 Forward Reconciliation for Covert Key Generation
Ishaque Ashar Kadampot and Matthieu Bloch (Georgia Institute of Technology, USA)

Wednesday, August 28 15:40 - 16:00

Coffee break

Room: Event Hall

Wednesday, August 28 16:00 - 17:40

WeInv1: Graph Based Codes and Spatial Coupling

Invited Session
Room: Rosa Huset, Lower Floor
16:00 A Finite-Length Construction of Irregular Spatially-Coupled Codes
Homa Esfahanizadeh (University of California, Los Angeles, USA), Ruiyi Wu, and Lara Dolecek (UCLA, USA)
16:20 Spatially Coupled LDPC Codes for Joint Source-Channel Coding
David G. M. Mitchell and Ahmad Golmohammadi (New Mexico State University, USA)
16:40 Spatially Coupled LDPC Codes with Non-uniform Coupling for Improved Decoding Speed
Laurent Schmalen (Karlsruhe Institute of Technology (KIT), Germany) and Vahid Aref (Nokia Bell Labs, Germany)
17:00 Spatially Coupled Sparse Regression Codes with Sliding Window AMP Decoding
Cynthia Rush (Columbia University, USA), Kuan Hsieh, and Ramji Venkataramanan (University of Cambridge, United Kingdom (Great Britain))
17:20 Failure repair in LDPC-based distributed storage: Is there any chance to be lazy?
Muhammad Ali and Iryna Andriyanova (ENSEA/UCP/CNRS, France), and Alexandre Graell i Amat (Chalmers University of Technology, Sweden)

WeInv2: Privacy and Security 2

Invited Session
Room: Rosa Huset, Upper Floor
16:00 Private Information Delivery
Hua Sun (University of North Texas, USA)
16:20 On the Capacity of Private Information Retrieval from Coded, Colluding, and Adversarial Servers
Lukas Holzbaur and Ragnar Freij-Hollanti (Technical University of Munich, Germany), and Camilla Hollanti (Aalto University, Finland)
16:40 Improved Private Information Retrieval for Coded Storage From Code Decomposition
Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes (Simula UiB, Norway), and Alexandre Graell i Amat (Chalmers University of Technology, Sweden)
17:00 Preserving ON-OFF Privacy for Past and Future Requests
Fangwei Ye, Carolina Naim, and Salim El Rouayheb (Rutgers University, USA)
17:20 Weakly Secure Symmetric Multilevel Diversity Coding
Tao Guo, Chao Tian, Tie Liu (Texas A&M University, USA), and Raymond W. Yeung (The Chinese University of Hong Kong, Hong Kong)

IEEE Information Theory Workshop 2019, Visby, Gotland, Sweden.