Program
Mon, 9 3
Mon, 9 3 8:30 - 9:30
PMo: Plenary Monday
Chair: Suhas Diggavi (University of California, Los Angeles, USA)
Mon, 9 3 9:30 - 9:45
BMoM: Break Monday Morning
Coffee anyone?
Mon, 9 3 9:45 - 11:00
SMoM: Spotlight Monday Morning
Chair: Amos Lapidoth (ETHZ, Switzerland)
- To code or not to code: Revisited
- Results on Combinatorial Joint Source-Channel Coding
- On Uncoded Transmission and Blocklength
- Reduced Complexity Window Decoding Schedules for Coupled LDPC Codes
- A Simple Proof of Threshold Saturation for Coupled Vector Recursions
- Efficient Termination of Spatially-Coupled Codes
- Common Randomness Amplification: A Constructive View
- Polar Codes for Secure Communications over the Two-Way Wiretap Channel
- Scheduling with privacy constraints
- A New Achievable Region for Gaussian Multiple Descriptions Based on Subset Typicality
- On Transmission of Multiple Gaussian Sources over a Gaussian MAC using a VQLC Mapping
- Source Coding with Conditionally Less Noisy Side Information
- On the Role of Deterministic Models in K x K x K Wireless Networks
- Proof of the outage probability conjecture for MISO channels
- Source Coding for Dependent Sources
Mon, 9 3 11:00 - 1:00
PoMoM: Posters Monday Morning
Poster Presentations associated to the Spotlight Monday Morning Session + Lunch
Mon, 9 3 1:00 - 2:30
OMoA: Outreach Monday Afternoon -- Information Theoretic Cryptography
Mon, 9 3 2:30 - 2:45
BMoA: Break Monday Afternoon
Mon, 9 3 2:45 - 4:00
SMoA: Spotlight Monday Afternoon
Chair: Michelle Effros (California Institute of Technology, USA)
- Throughput maximization for an energy harvesting communication system with processing cost
- Gaussian Wiretap Channel with a Batteryless Energy Harvesting Transmitter
- The Energy Harvesting Multiple Access Channel with Energy Storage Losses
- On Secure Multiparty Sampling for More than Two Parties
- Characterizing Pseudoentropy
- Overcoming Weak Expectations
- Achieving the Capacity of any DMC using only Polar Codes
- Design of binary polar codes with arbitrary kernel
- A Construction of Lattices from Polar Codes
- On Common Information and the Encoding of Sources that are Not Successively Refinable
- On Feedback, Cribbing, and Causal State-Information on the Multiple-Access Channel
- Gaussian Wiretap Channel with an Amplitude Constraint
- Short-Message Noisy Network Coding with Partial Source Cooperation
- On the Asymptotic Spectrum of the Error Probability of Composite Networks
- Secret-Key Agreement over a Non-Coherent Block-Fading MIMO Wiretap Channel
Mon, 9 3 4:00 - 6:00
PoMoA: Posters Monday Afternoon
Poster Presentations associated to the Spotlight Monday Aternoon Session.
Mon, 9 3 6:15 - 7:30
WMoA: Welcome Reception -- Rolex Learning Center
Tue, 9 4
Tue, 9 4 8:30 - 9:30
PTu: Plenary Tuesday
Chair: Ruediger L Urbanke (EPFL, Switzerland)
Tue, 9 4 9:30 - 9:45
BTuM: Break Tuesday Morning
Tue, 9 4 9:45 - 11:00
STuM: Spotlight Tuesday Morning
Chair: Alon Orlitsky (University of California, San Diego, USA)
- On Witsenhausen's Counterexample: the Asymptotic Vector Case
- On Channels with Action-Dependent States
- Comments on unknown channels
- Privacy Amplification Theorem for Bounded Storage Eavesdropper
- On Vector Gaussian Multiterminal Source Coding
- Worst-Case Source for Distributed Compression with Quadratic Distortion
- MIDO Space-Time Codes from Associative and Nonassociative Cyclic Algebras
- Irregular Product Codes
- Constructing Good QC-LDPC Codes by Pre-lifting Protographs
- Full- or Half-Duplex? A Capacity Analysis with Bounded Radio Resources
- Towards integrating Quantize-Map-Forward relaying into LTE
- Smartphones across networks: cooperative group communication
- An Outer Bound for the Memoryless Two-user Interference Channel with General Cooperation
- Derandomized Sampling Algorithm for Lattice Decoding
- Combining Superposition Coding and Binning Achieves Capacity for the Gaussian Cognitive Interference Channel
Tue, 9 4 11:00 - 1:00
PoTuM: Posters Tuesday Morning
Poster Presentations associated to the Spotlight Tuesday Morning Session + Lunch
Tue, 9 4 1:00 - 2:30
OTuA: Outreach Tuesday Afternoon - Connections to Biology
Chair: Suhas Diggavi (University of California, Los Angeles, USA)
- A Cellular Solution to an Information Processing Problem
- Understanding neural networks by controlling and evoking behavior
- How cells control their identity: Information theoretical concepts in gene regulatory networks
Tue, 9 4 2:30 - 2:45
BTuA: Break Tuesday Afternoon
Tue, 9 4 2:45 - 4:05
STuA: Spotlight Tuesday Afternoon
Chair: Gerhard Kramer (Technical University of Munich, Germany)
- Lossy Computing of Correlated Sources with Fractional Sampling
- Error Exponents for Block Markov Superposition Encoding with Varying Decoding Latency
- Robust Distributed Compression for Cloud Radio Access Networks
- Multilevel 2-Cell t-Write Codes
- Bit-fixing Codes for Multi-level Cells
- A DC-Free Multi-Mode Run-Length Limited Coding Scheme
- Information Theory of DNA Sequencing: General Statistics
- An Efficient Sequential Predictor for Inference of Time-Varying Causal Interactions in Neural Processes
- Information Theoretic Approach to Classification and Closeness Testing
- On the Non-robustness of Essentially Conditional Information Inequalities
- Compact Representation of Polymatroid Axioms for Random Variables with Conditional Independencies
- Characterizing the Entropy Function Region via Extreme Rays
- Capacity of a Class of Relay Channels with State
- Non-binary Protograph-Based LDPC Codes for Short Block-lengths
- Asynchronous Control for Coupled Markov Decision Systems
- Sequential Group Testing with Graph Constraints
Tue, 9 4 4:05 - 6:00
PoTuA: Posters Tuesday Afternoon
Poster Presentations associated to the Spotlight Tuesday Afternoon Session.
Wed, 9 5
Wed, 9 5 8:30 - 9:30
PWe: Plenary Wednesday
Chair: Emre Telatar (EPFL, Switzerland)
- Distances between measures, relative entropy and measure concentration
Wed, 9 5 9:30 - 9:45
BWeM: Break Wednesday Morning
Wed, 9 5 9:45 - 10:45
SWeM: Spotlight Wednesday Morning
Chair: Sergio Verdú (Princeton University, USA)
- Construction of irregular histograms by penalized maximum likelihood: a comparative study
- Comparison of Dynamic Model Selection with Infinite HMM for Statistical Model Change Detection
- Coherence-Based Probabilistic Recovery Guarantees for Sparsely Corrupted Signals
- On Random Binning versus Conditional Codebook Methods in Multiple Descriptions Coding
- Multi-terminal Source Coding: Zero-rate Encoders Cannot Enlarge the Rate Region
- Characterizing the rate region of the coded side-information problem
- Spatially coupled quantum LDPC codes
- Iterative Soft-Decision Decoding of Hermitian Codes
- From Channel Codes to Computation Codes
- Networks with in-Block Memory
- Stability and Capacity through Evacuation Times
- Capacity Region of Two Symmetric Nearby Erasure Channels With Channel State Feedback
Wed, 9 5 10:45 - 12:30
PoWeM: Posters Wednesday Morning
Poster Presentations associated to the Spotlight Wednesday Morning Session + Take Away Food
Wed, 9 5 12:45 - 6:00
EWeA: Excursions -- Varying Duration
Thu, 9 6
Thu, 9 6 8:30 - 9:30
PTh: Plenary Thursday
- Efficient Polar Coding of Quantum Information
Thu, 9 6 9:30 - 9:45
BThM: Break Thursday Morning
Thu, 9 6 9:45 - 11:00
SThM: Spotlight Thursday Morning
Chair: Ioannis Kontoyiannis (University of Cambridge & Statistical Laboratory, United Kingdom (Great Britain))
- Interactive Interference Alignment
- Low-complexity constructions of secret keys using polar coding
- Generalized Cut-Set Bounds for Networks with Collocated Messages: General K Sinks
- Bounds on the Belief Propagation Threshold of Non-Binary LDPC Codes
- Extending Monte Carlo Methods to Factor Graphs with Negative and Complex Factors
- Suppressing pseudocodewords by penalizing the objective of LP decoding
- On Multicasting Nested Message Sets Over Combination Networks
- Achieving the Capacity of the N-Relay Gaussian Diamond Network Within logN Bits
- Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks
- Derivative of the Relative Entropy over the Poisson and Binomial channel
- Optimal Reliability over a Class of Binary-Input Channels with Feedback
- On Channel Capacity of Communication Via Antenna Arrays with Receiver Noise Matching
- Expurgation Exponent of Leaked Information in Privacy Amplification for Binary Sources
- Interactive Communication for Optimum Rate Secret Key Generation
- Secure Channel Simulation
Thu, 9 6 11:00 - 1:00
PoThM: Poster Thursday Morning
Poster Presentations associated to the Thursday Monday Morning Session + Lunch
Thu, 9 6 1:00 - 2:30
OThA: Outreach Thursday Afternoon - Machine Learning
Thu, 9 6 2:30 - 2:45
BThA: Break Thursday Afternoon
Thu, 9 6 2:45 - 4:05
SThA: Spotlight Thursday Afternoon
Chair: Pramod Viswanath (University of Illinois, Urbana-Champaign, USA)
- Lattice Coding for Multiple Access Channels with Common Message and Additive Interference
- Analysis of lattice codes for the many-to-one interference channel
- Integer Low-Density Lattices based on Construction A
- Reference Based Genome Compression
- A Theoretical Approach to Gene Network Identification
- Molecular Communication Between two Populations of Bacteria
- Bayesian inference for discrete time series via tree weighting
- Grassmannian Signalling Achieves the Ergodic High SNR Capacity of the Non-Coherent MIMO Relay Channel within an SNR-Independent Gap
- Achievable Sum-Rates in Gaussian Multiple-Access Channels with MIMO-AF-Relay and Direct Links
- Two-Source Extractors for Leaky Sources
- Decode-and-Forward for the Gaussian Relay Channel via Standard AWGN Coding and Decoding
- LDPC-Based Coded Cooperative Jamming Codes
- Secret Key Agreement Using Correlated Sources over the Generalized Multiple Access Channel
- On Function Computation over a Cascade Network
- Chernoff Bounds for Analysis of Rate-Compatible Sphere-Packing with Numerous Transmissions
- The Combinatorial Structure of Linear Deterministic Interference Channels
Thu, 9 6 4:05 - 6:00
PoThA: Posters Thursday Afternoon
Poster Presentations associated to the Spotlight Thursday Afternoon Session.
Thu, 9 6 7:00 - 10:00
BaThA: Banquet -- Lausanne Palace
Fri, 9 7
Fri, 9 7 8:30 - 9:30
PFr: Plenary Friday
Chair: Christina Fragouli (UCLA, USA)
- Hypothesis Testing in High-Dimensional Problems
Fri, 9 7 9:30 - 9:45
BFrM: Break Friday Morning
Fri, 9 7 9:45 - 11:00
SFrM: Spotlight Friday Morning
Chair: Nicolas Macris (EPFL, Switzerland)
- Approaching Maximum Likelihood decoding of finite length LDPC codes via FAID diversity
- Finite-length performance of spatially-coupled LDPC codes under TEP decoding
- Locally Repairable Codes for HDFS
- On Locality in Distributed Storage Systems
- Superposition Coding for Linear Operator Channels over Finite Fields
- Network Coding with Computation Alignment
- On the Hardness of Entropy Minimization and Related Problems
- Information Theoretic Cutting of a Cake
- On the estimation of Entropy for Unknown Support Size
- Fundamental limits on power consumption for lossless signal reconstruction
- Improved Joint Turbo Decoding and Physical-Layer Network Coding
- On the Additive Complexity of the Cyclotomic FFT Algorithm
- On the Entropy of Sums of Bernoulli Random Variables via the Chen-Stein Method
- Sequential Normalized Maximum Likelihood in Log-loss Prediction
- On Cascade Source Coding with A Side Information "Vending Machine"
Fri, 9 7 11:00 - 1:00
PoFrM: Posters Friday Morning
Poster Presentations associated to the Spotlight Friday Morning Session + Lunch
Fri, 9 7 1:00 - 2:15
SFrA1: Spotlight Friday Afternoon 1
Chair: Igal Sason (Technion, Israel)
- An MDL-based Change-Detection Algorithm with Its Applications to Learning Piecewise Stationary Memoryless Sources
- Relative Information Loss in the PCA
- A Robust RFPI-Based 1-Bit Compressive Sensing Reconstruction Algorithm
- Diversity versus Channel Knowledge at Finite Block-Length
- Degrees of Freedom of MISO Broadcast Channel with Perfect Delayed and Imperfect Current CSIT
- A refined analysis of the Poisson channel in the high-photon-efficiency regime
- Coded Cooperative Data Exchange for Multiple Unicasts
- Two-Way Communication with Energy Exchange
- Retargeting LT Codes using XORs at the Relay
- An Extension to the Chain Graph Representation of an Achievable Scheme
- Uniform Random Number Generation by Using Sparse Matrix
- Recurrent AMS One-Sided Channels
- Strong Secrecy in Arbitrarily Varying Wiretap Channels
- Equivocations for the Simple Substitution Cipher with Erasure-Prone Ciphertext
- Simultaneously Generating Multiple Keys and Multi-Commodity Flow in Networks
Fri, 9 7 2:15 - 4:00
PoFrA1: Poster Friday Afternoon 1
Poster Presentations associated to the Spotlight Friday Afternoon 1 Session + Break
Fri, 9 7 4:00 - 4:55
SFrA2: Spotlight Friday Afternoon 2
Chair: Olivier Lévêque (EPFL, Switzerland)
- Analog Network Coding in General SNR Regime: Performance of Network Simplification
- Golay Meets Hadamard: Golay-Paired Hadamard Matrices for Fast Compressed Sensing
- Compressing multisets using tries
- Analysis of Sparse Representations Using Bi-Orthogonal Dictionaries
- Aspect of Security in the Cognitive Relay Assisted Interference Channels
- On The Achievable Rate Region of a New Gaussian Wiretap Channel With Side Information
- Gaussian Wiretap Lattice Codes from Binary Self-dual Codes
- Limited Feedback for Interference Alignment in the K-user MIMO Interference Channel
- Uniform and Non-Uniform Delay-Rate Tradeoffs in Partial Ergodic Interference Alignment
- Achievable Rate Regions for Compound Multiple Access Channel with Channel State Information
- The Analog Formulation of Sparsity implies Infinite Divisibility and rules out Bernoulli-Gaussian Priors
Fri, 9 7 4:55 - 6:15
PoFrA2: Posters Friday Afternoon 2
Poster Presentations associated to the Spotlight Friday Afternoon 2 Session.