Technical Program

Alternative Views

Complete Proceedings

186 MB Zip Archive

Available from 21 June 2020 through 3 July 2020


Algebraic and Combinatorial Coding Theory
Attend A.1: Algebraic Coding Theory I
A.1.1: On the number of factorizations of polynomials over finite fields Rachel N Berman, Ron M Roth, Technion, Israel
A.1.2: Optimal Locally Repairable Constacyclic Codes of Prime Power Lengths Wei Zhao, The Chinese University of Hong Kong, Shenzhen; University of Science and Technology of China, China; Kenneth W. Shum, Shenghao Yang, The Chinese University of Hong Kong, Shenzhen, China
A.1.3: Grassmannian Frames in Composite Dimensions by Exponentiating Quadratic Forms Renaud-Alexandre Pitaval, Yi Qin, Huawei Technologies Sweden AB, Sweden
A.1.4: Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power Julian Renner, Technical University of Munich, Germany; Sven Puchinger, Technical University of Denmark, Denmark; Antonia Wachter-Zeh, Technical University of Munich, Germany; Camilla Hollanti, Ragnar Freij-Hollanti, Aalto University, Finland
A.1.5: Mass Error-Correction Codes for Polymer-Based Data Storage Ryan Gabrys, University of California, San Diego & SPAWAR, San Diego, United States; Srilakshmi Pattabiraman, Olgica Milenkovic, University of Illinois, Urbana-Champaign, United States
A.1.6: Analog Subspace Coding: A New Approach to Coding for Non-Coherent Wireless Networks Mahdi Soleymani, Hessam Mahdavifar, University of Michigan, United States
Attend A.2: Algebraic Coding Theory II
A.2.1: Binary Subblock Energy-Constrained Codes: Knuth’s Balancing and Sequence Replacement Techniques Tuan Thanh Nguyen, Kui Cai, Singapore University of Technology and Design, Singapore; Kees A. Schouhamer Immink, Turing Machines Inc, Netherlands
A.2.2: Decoding Reed–Muller Codes Using Redundant Code Constraints Mengke Lian, Duke University, United States; Christian Häger, Chalmers University of Technology, Sweden; Henry Pfister, Duke University, United States
A.2.3: Constructions of Complex Codebooks Asymptotically Meeting the Welch Bound: A Graph Theoretic Approach Shohei Satake, Kumamoto University, Japan; Yujie Gu, Tel Aviv University, Israel
A.2.4: Generic Decoding in the Sum-Rank Metric Sven Puchinger, Technical University of Denmark, Denmark; Julian Renner, Technical University of Munich, Germany; Johan Rosenkilde, Technical University of Denmark, Denmark
A.2.5: Support Constrained Generator Matrices of Gabidulin Codes in Characteristic Zero Hikmet Yildiz, California Institute of Technology, United States; Netanel Raviv, Washington University in Saint Louis, United States; Babak Hassibi, California Institute of Technology, United States
A.2.6: A Geometric View of the Service Rates of Codes Problem and its Application to the Service Rate of the First Order Reed-Muller Codes Fatemeh Kazemi, Texas A&M University, United States; Sascha Kurz, University of Bayreuth, Germany; Emina Soljanin, Rutgers University, United States
Attend A.3: Combinatorics and Information Theory
A.3.1: Concave Aspects of Submodular Functions Rishabh Iyer, University of Texas Dallas, United States; Jeff Bilmes, University of Washington, United States
A.3.2: Zero-Error Coding with a Generator Set of Variable-Length Words Nicolas Charpenay, Maël Le Treust, ETIS UMR 8051, Université Paris Seine, Université Cergy-Pontoise, ENSEA, CNRS, France
A.3.3: Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel Roni Con, Amir Shpilka, Tel Aviv University, Israel
A.3.4: Optimal Multistage Group Testing Algorithm for 3 Defectives Ilya Vorobyev, Skolkovo Institute of Science and Technology, Russia
A.3.5: Error Detection and Correction in Communication Networks Chong Shangguan, Itzhak Tamo, Tel Aviv University, Israel
Attend A.4: Combinatorial Coding Theory I
A.4.1: Improved efficiency for covering codes matching the sphere-covering bound Aditya Potukuchi, Rutgers, The State University of New Jersey, United States; Yihan Zhang, The Chinese University of Hong Kong, China
A.4.2: Maximum Length of Robust Positioning Sequences Duc Tu Dao, Han Mao Kiah, Nanyang Technological University, Singapore; Hengjia Wei, Ben-Gurion University of the Negev, Israel
A.4.3: Distribution of the Minimum Distance of Random Linear Codes Jing Hao, Han Huang, Galyna Livshyts, Konstantin Tikhomirov, Georgia Institute of Technology, United States
A.4.4: The Capacity of Multidimensional Permutations with Restricted Movement Dor Elimelech, Ben-Gurion University of the Negev, Israel
A.4.5: Uncertainty of Reconstructing Multiple Messages from Uniform-Tandem-Duplication Noise Yonatan Yehezkeally, Moshe Schwartz, Ben-Gurion University of the Negev, Israel
Attend A.5: Combinatorial Coding Theory II
A.5.1: Group Testing with Runlength Constraints for Topological Molecular Storage Abhishek Agarwal, Olgica Milenkovic, Srilakshmi Pattabiraman, University of Illinois, Urbana-Champaign, United States; João Ribeiro, Imperial College London, United Kingdom
A.5.2: Construction of Rate (n-1)/n Non-Binary LDPC Convolutional Codes via Difference Triangle Sets Gianira Nicoletta Alfarano, Julia Lieb, Joachim Rosenthal, University of Zurich, Switzerland
A.5.3: Minimizing the alphabet size of erasure codes with restricted decoding sets Mira Gonen, Ariel University, Israel; Ishay Haviv, The Academic College of Tel Aviv-Yaffo, Israel; Michael Langberg, State University of New-York at Buffalo, United States; Alex Sprintson, Texas A&M University, United States
A.5.4: Constructions of Nonequivalent Fp-Additive Generalised Hadamard Codes Steven T. Dougherty, University of Scranton, United States; Josep Rifà, Mercè Villanueva, Universitat Autònoma de Barcelona, Spain

Coded and Distributed Computation
Attend D.1: Coded Computation
D.1.1: Coded Computation Against Straggling Channel Decoders in the Cloud for Gaussian Channels Jinwen Shi, Cong Ling, Imperial College London, United Kingdom; Osvaldo Simeone, King's College London, United Kingdom; Jörg Kliewer, New Jersey Institute of Technology, United Kingdom
D.1.2: Low Complexity Distributed Computing via Binary Matrices with Extension to Stragglers Shailja Agrawal, Prasad Krishnan, International Institute of Information Technology, Hyderabad, India
D.1.3: Heterogeneous Computation Assignments in Coded Elastic Computing Nicholas Woolsey, Rong-Rong Chen, Mingyue Ji, University of Utah, United States
D.1.4: Optimizing the Transition Waste in Coded Elastic Computing Son Hoang Dau, RMIT University, Australia; Ryan Gabrys, University of California, San Diego, United States; Yu-Chih Huang, National Chiao Tung University, Taiwan; Chen Feng, British Columbia University (Okanagan Campus), Canada; Quang-Hung Luu, Swinburne University of Technology, Australia; Eidah Alzahrani, Zahir Tari, RMIT University, Australia
D.1.5: Improved Computation-Communication Trade-Off for Coded Distributed Computing using Linear Dependence of Intermediate Values Shunsuke Horii, Waseda University, Japan
D.1.6: Coded Computing in Unknown Environment via Online Learning Chien-Sheng Yang, University of Southern California, United States; Ramtin Pedarsani, University of California, Santa Barbara, United States; A. Salman Avestimehr, University of Southern California, United States
Attend D.2: Coding for Specialized Computations
D.2.1: Coded QR Decomposition Quang Minh Nguyen, National University of Singapore, Singapore; Haewon Jeong, Pulkit Grover, Carnegie Mellon University, United States
D.2.2: Product Lagrange Coded Computing Adarsh M. Subramaniam, Anoosheh Heidarzadeh, Asit Kumar Pradhan, Krishna R. Narayanan, Texas A&M University, United States
D.2.3: PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously Songze Li, Mingchao Yu, Chien-Sheng Yang, A. Salman Avestimehr, University of Southern California, United States; Sreeram Kannan, University of Washington, United States; Pramod Viswanath, University of Illinois at Urbana-Champaign, United States
D.2.4: Incremental ADMM with Privacy-Preservation for Decentralized Consensus Optimization Yu Ye, Hao Chen, Ming Xiao, Mikael Skoglund, KTH Royal institute of technology, Sweden; H. Vincent Poor, Princeton University, United States
Attend D.3: Distributed Matrix Multiplication
D.3.1: Multi-Cell Mobile Edge Coded Computing: Trading Communication and Computing for Distributed Matrix Multiplication Kuikui Li, Meixia Tao, Shanghai Jiao Tong University, China; Jingjing Zhang, Osvaldo Simeone, King’s College London, United Kingdom
D.3.2: Local Re-encoding for Coded Matrix Multiplication Xian Su, Florida International University, United States; Xiaomei Zhong, East China Jiaotong University, China; Xiaodi Fan, Jun Li, Florida International University, United States
D.3.3: GCSA Codes with Noise Alignment for Secure Coded Multi-Party Batch Matrix Multiplication Zhen Chen, Zhuqing Jia, Zhiying Wang, Syed A. Jafar, University of California Irvine, United States
D.3.4: Straggler-free Coding for Concurrent Matrix Multiplications Pedro Soto, Jun Li, Florida International University, United States
D.3.5: Factored LT and Factored Raptor Codes for Large-Scale Distributed Matrix Multiplication Asit Kumar Pradhan, Anoosheh Heidarzadeh, Krishna R. Narayanan, Texas A&M University, United States
D.3.6: Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the ''Cubic'' Barrier Qian Yu, Salman Avestimehr, University of Southern California, United States
D.3.7: Bivariate Polynomial Coding for Straggler Exploitation with Heterogeneous Workers Burak Hasırcıoğlu, Imperial College London, United Kingdom; Jesús Gómez-Vilardebó, Centre Tecnològic de Telecomunicacions de Catalunya (CTTC/CERCA), Spain; Deniz Gündüz, Imperial College London, United Kingdom

Coding for Communications
Attend C.1: Coding for Communications I
C.1.1: Diversity vs. Parallelism in Distributed Computing with Redundancy Pei Peng, Emina Soljanin, Rutgers University, United States; Philip Whiting, Macquarie University, Australia
C.1.2: Efficient Maximum-Likelihood Decoding of Reed-Muller RM(m-3,m) Codes Andrew Thangaraj, Indian Institute of Technology Madras, India; Henry D. Pfister, Duke University, United States
C.1.3: A New Construction of QAM Golay Complementary Sequence Pair Zilong Wang, Erzhong Xue, Xidian University, China; Guang Gong, University of Waterloo, Canada
C.1.4: Multi-Label and Concatenated Neural Block Decoders Cheuk Ting Leung, NUS, Singapore; Rajshekhar Bhat, IIT, India; Mehul Motani, NUS, Singapore
C.1.5: Graceful degradation over the BEC via non-linear codes Hajir Roozbehani, Yury Polyanskiy, MIT, United States
Attend C.2: Coding for Communications II
C.2.1: Time-Frequency Division Multiple Access and the TFDMA Ad Hoc Network Based on the (n, n(n-1), n-1) Permutation Group Codes Li Peng, Huazhong University of Science and Technology, China
C.2.2: An Efficient Algorithm for Designing Optimal CRCs for Tail-Biting Convolutional Codes Hengjie Yang, Linfang Wang, Vincent Lau, Richard D. Wesel, University of California, Los Angeles, United States
C.2.3: Low-Complexity Chase Decoding of Reed-Solomon Codes through Basis Reduction Jiongyue Xing, Li Chen, Sun Yat-sen University, China; Martin Bossert, Ulm University, Germany
C.2.4: Twisted-Pair Superposition Transmission for Low Latency Communications Suihua Cai, Xiao Ma, Sun Yat-sen University, China
C.2.5: Tetrahedral Coding and Non-Unitary Resilience in Polarization-Multiplexed Lightwave Transmissions Arnaud Dumenil, Elie Awwad, Cyril Measson, Nokia Bell Labs Paris, France
C.2.6: Noise Recycling Alejandro Cohen, Amit Solomon, Massachusetts Institute of Technology, United States; Ken R. Duffy, Hamilton Institute, Maynooth University, Ireland; Muriel Médard, Massachusetts Institute of Technology, United States
Attend C.3: Iterative Decoding
C.3.1: Data-Driven Ensembles for Deep and Hard-Decision Hybrid Decoding Tomer Raviv, Nir Raviv, Yair Be'ery, Tel-Aviv University, Israel
C.3.2: Message Flow Analysis in Practical LDPC Decoders for the Interpretation of Absorbing Set Thresholds Marco Ferrari, CNR-IEIIT, Italy; Ramon Marenzi, Università degli studi di Bergamo, Italy; Luca Barletta, Politecnico di Milano, Italy
C.3.3: Iterative Decoding of Non-Binary Cyclic Codes Using Minimum-Weight Dual Codewords Jiongyue Xing, Sun Yat-sen University, China; Martin Bossert, Sebastian Bitzer, Ulm University, Germany; Li Chen, Sun Yat-sen University, China
C.3.4: Pruning Neural Belief Propagation Decoders Andreas Buchberger, Christian Häger, Chalmers University of Technology, Sweden; Henry Pfister, Duke University, United States; Laurent Schmalen, Karlsruhe Institute of Technology (KIT), Germany; Alexandre Graell i Amat, Chalmers University of Technology, Sweden
C.3.5: Equivalence of ML decoding to a continuous optimization problem Sundara Rajan Srinivasavaradhan, Suhas Diggavi, Christina Fragouli, UCLA, United States
Attend C.4: LDPC Codes
C.4.1: A Low Complexity Decoding Algorithm for NB-LDPC Codes over Quadratic Extension Fields Viduranga Bandara Wijekoon, Emanuele Viterbo, Yi Hong, Monash University, Australia
C.4.2: Asymptotic Absorbing Set Enumerators for Non-Binary Protograph-Based LDPC Code Ensembles Emna Ben Yacoub, Technical University of Munich, Germany; Gianluigi Liva, German Aerospace Center (DLR), Germany
C.4.3: Finite-Blocklength and Error-Exponent Analyses for LDPC Codes in Point-to-Point and Multiple Access Communication Yuxin Liu, Michelle Effros, California Institute of Technology, United States
C.4.4: Analysis of Absorbing Sets using Cosets and Syndromes Emily McMillon, University of Nebraska - Lincoln, United States; Allison Beemer, New Jersey Institute of Technology, United States; Christine A. Kelley, University of Nebraska - Lincoln, United States
Attend C.5: List Decoding
C.5.1: List Decoding for Oblivious Arbitrarily Varying MACs: Constrained and Gaussian Yihan Zhang, The Chinese University of Hong Kong, China
C.5.2: Linear-Time Erasure List-Decoding of Expander Codes Noga Ron-Zewi, University of Haifa, Israel; Mary Wootters, Stanford University, United States; Gilles Zemor, Universite de Bordeaux, France
C.5.3: Fast Soft Decision Decoding of Linear Block Codes Using Partial Syndrome Search Changryoul Choi, Jechang Jeong, Hanyang University, Korea (South)
Attend C.6: Polar Codes I
C.6.1: List Decoding of Universal Polar Codes Boaz Shuval, Ido Tal, Technion, Israel
C.6.2: CRC-Aided Belief Propagation List Decoding of Polar Codes Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink, University of Stuttgart, Germany
C.6.3: Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency Marco Mondelli, Institute of Science and Technology (IST) Austria, Austria; Seyyed Ali Hashemi, John Cioffi, Andrea Goldsmith, Stanford University, United States
C.6.4: Recursive Trellis Decoding Techniques of Polar Codes Peter Trifonov, ITMO University, Russia
C.6.5: Improved Belief Propagation List Decoding for Polar Codes Binghao Li, Baoming Bai, Min Zhu, Shenyang Zhou, Xidian University, China
C.6.6: Asynchronous Polar-Coded Modulation Jincheng Dai, Kai Niu, Zhongwei Si, Beijing University of Posts and Telecommunications, China
Attend C.7: Polar Codes II
C.7.1: Finite-Level Quantization Procedures for Construction and Decoding of Polar Codes Yunus Inan, Emre Telatar, EPFL, Switzerland
C.7.2: Polar Coding for the Wiretap Broadcast Channel with Multiple Messages Jaume del Olmo Alòs, Javier R. Fonollosa, Universitat Politècnica de Catalunya, Spain
C.7.3: Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes Mustafa Cemil Coşkun, Technical University of Munich, Germany; Joachim Neu, Stanford University, United States; Henry D. Pfister, Duke University, United States
C.7.4: List decoding of Arikan's PAC codes Hanwen Yao, Arman Fazeli, Alexander Vardy, University Of California San Diego, United States
C.7.5: Capacity-achieving Polar-based LDGM Codes with Crowdsourcing Applications James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan, University of Michigan, Ann Arbor, United States
C.7.6: Hardness of Successive-Cancellation Decoding of Linear Codes Arman Fazeli, Alexander Vardy, Hanwen Yao, University of California, San Diego, United States
Attend C.8: Spatially Coupled Codes
C.8.1: Partially Information Coupled Duo-Binary Turbo Codes Xiaowei Wu, Min Qiu, Jinhong Yuan, The University of New South Wales, Australia
C.8.2: Spatially Coupled Codes with Sub-Block Locality: Joint Finite Length-Asymptotic Design Approach Eshed Ram, Technion - Israel Institute of Technology, Israel; Homa Esfahanizadeh, University of California, Los Angeles, United States; Yuval Cassuto, Technion - Israel Institute of Technology, Israel; Lara Dolecek, University of California, Los Angeles, United States
C.8.3: A Novel Design of Spatially Coupled LDPC Codes for Sliding Window Decoding Min Zhu, Xidian University, China; David G. M. Mitchell, New Mexico State University, United States; Michael Lentmaier, Lund University, Sweden; Daniel J. Costello, University of Notre Dame, United States
C.8.4: Generalized LDPC Codes with Convolutional Code Constraints Muhammad Umar Farooq, Lund University, Sweden; Saeedeh Moloudi, Ericsson, Sweden; Michael Lentmaier, Lund University, Sweden
C.8.5: Non-Uniform Windowed Decoding For Multi-Dimensional Spatially-Coupled LDPC Codes Lev Tauz, Homa Esfahanizadeh, Lara Dolecek, University of California, Los Angeles, United States
Attend C.9: Streaming Codes
C.9.1: Error Rate Analysis for Random Linear Streaming Codes in the Finite Memory Length Regime Pin-Wen Su, Purdue University, United States; Yu-Chih Huang, National Taipei University, Taiwan; Shih-Chun Lin, National Taiwan University of Science and Technology, Taiwan; I-Hsiang Wang, National Taiwan University, Taiwan; Chih-Chun Wang, Purdue University, United States
C.9.2: Streaming Erasure Codes over Multi-hop Relay Network Elad Domanovitz, Ashish Khisti, University of Toronto, Canada; Wai-Tian Tan, Cisco Systems, Canada; Xiaoqing Zhu, Ciscom Systems, Canada; John Apostolopoulos, Cisco Systems, Canada
C.9.3: Staggered Diagonal Embedding Based Linear Field Size Streaming Codes Vinayak Ramkumar, Myna Vajha, Indian Institute of Science, India; M. Nikhil Krishnan, University of Toronto, India; P. Vijay Kumar, Indian Institute of Science, India
C.9.4: Online Versus Offline Rate in Streaming Codes for Variable-Size Messages Michael Harrison Rudow, K. V. Rashmi, Carnegie Mellon University, United States
Attend C.10: Topics in Coding Theory
C.10.1: Tangential-Sphere Bound Revisited Jia Liu, Chaoyong Wang, Jilin Engineering Normal University, China
C.10.2: On the decoding of Barnes-Wall lattices Vincent Corlay, Mitsubishi Electric R&D Centre Europe/Telecom Paris, France; Joseph Jean Boutros, Texas A&M University, Qatar; Philippe Ciblat, Telecom Paris, France; Loïc Brunel, Mitsubishi Electric R&D Centre Europe, France
C.10.3: Strongly Explicit and Efficiently Decodable Probabilistic Group Testing Huseyin Atahan Inan, Ayfer Ozgur, Stanford University, United States
C.10.4: Reconstruction of Multi-user Binary Subspace Chirps Tefjol Pllaha, Olav Tirkkonen, Aalto University, Finland; Robert Calderbank, Duke University, United States
C.10.5: Lattice Construction C* from Self-Dual Codes Maiara Francine Bollauf, Sueli Irene Rodrigues Costa, University of Campinas, Brazil; Ram Zamir, Tel Aviv University, Israel

Coding for Storage and Memories
Attend M.1: Codes for Distributed Storage I
M.1.1: Recovery Sets for Subspaces from a Vector Space Yeow Meng Chee, National University of Singapore, Singapore; Tuvi Etzion, Technion - Israel Institute of Technology, Israel; Han Mao Kiah, Nanyang Technological University, Singapore; Hui Zhang, National University of Singapore, Singapore
M.1.2: Communication Efficient Secret Sharing in the Presence of Malicious Adversary Rawad Bitar, Rutgers University, United States; Sidharth Jaggi, Chinese University of Hong Kong, China
M.1.3: Minimum Storage Rack-Aware Regenerating Codes with Exact Repair and Small Sub-Packetization Hanxu Hou, Dongguan University of Technology, China; Patrick P. C. Lee, The Chinese University of Hong Kong, China; Yunghsiang S. Han, Dongguan University of Technology, China
M.1.4: Toward Optimality in Both Repair and Update via Generic MDS Code Transformation Hanxu Hou, Dongguan University of Technology, China; Patrick P. C. Lee, The Chinese University of Hong Kong, China; Yunghsiang S. Han, Dongguan University of Technology, China
M.1.5: Access Balancing in Storage Systems by Labeling Partial Steiner Systems Yeow Meng Chee, National University of Singapore, Singapore; Charles J. Colbourn, Arizona State University, United States; Son Hoang Dau, RMIT University, Australia; Ryan Gabrys, University of Illinois at Urbana-Champaign (UIUC), United States; Alan C. H. Ling, University of Vermont, United States; Dylan Lusi, Arizona State University, United States; Olgica Milenkovic, University of Illinois at Urbana-Champaign (UIUC), United States
Attend M.2: Codes for Distributed Storage II
M.2.1: On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes Han Cai, Ben-Gurion University, Israel; Moshe Schwartz, Ben-Gurion University of the Negev, Israel
M.2.2: Access-optimal Linear MDS Convertible Codes for All Parameters Francisco Maturana, Carnegie Mellon University, United States; V. S. Chaitanya Mukka, BITS Pilani, India; K. V. Rashmi, Carnegie Mellon University, United States
M.2.3: Secure Node Repair of Reed-Solomon Codes Talha Cihad Gulcu, Unaffiliated, Turkey
M.2.4: Repair of RS codes with optimal access and error correction Zitan Chen, Min Ye, Alexander Barg, University of Maryland, United States
M.2.5: Complete Characterization of Optimal LRCs with Minimum Distance 6 and Locality 2: Improved Bounds and Constructions Weijun Fang, Bin Chen, Shu-Tao Xia, Tsinghua University, China; Fang-Wei Fu, Nankai University, China
Attend M.3: Codes for Distributed Storage III
M.3.1: Perfect LRCs and k-Optimal LRCs Weijun Fang, Bin Chen, Shu-Tao Xia, Tsinghua University, China; Fang-Wei Fu, Nankai University, China
M.3.2: Secure Distributed Storage: Rate-Privacy Trade-Off and XOR-Based Coding Scheme Remi Chou, Wichita State University, United States; Joerg Kliewer, New Jersey Institute of Technology, United States
M.3.3: Weight Distributions of q-ary Optimal Locally Repairable Codes with Locality 2, Distance 5 and Even Dimension Jie Hao, Beijing University of Posts and Telecommunications, China; Jun Zhang, Capital Normal University, China; Shu-Tao Xia, Tsinghua University, China; Fang-Wei Fu, Nankai University, China; Yi-Xian Yang, Beijing University of Posts and Telecommunications, China
M.3.4: Cyclic LRC codes with hierarchy and availability Zitan Chen, Alexander Barg, University of Maryland, United States
M.3.5: Topology-Aware Cooperative Data Protection in Blockchain-Based Decentralized Storage Networks Siyi Yang, University of California, Los Angeles, United States; Ahmed Hareedy, Robert Calderbank, Duke University, United States; Lara Dolecek, University of California, Los Angeles, United States
Attend M.4: Codes for Distributed Storage IV
M.4.1: Partial MDS Codes with Local Regeneration Lukas Holzbaur, Technical University of Munich, Germany; Sven Puchinger, Technical University of Denmark, Denmark; Eitan Yaakobi, Technion --- Israel Institute of Technology, Israel; Antonia Wachter-Zeh, Technical University of Munich, Germany
M.4.2: Lifted Reed-Solomon Codes with Application to Batch Codes Lukas Holzbaur, Technical University of Munich, Germany; Rina Polyanskaya, Institute for Information Transmission Problems, Russia; Nikita Polyanskii, Technical University of Munich, Germany; Ilya Vorobyev, Skolkovo Institute of Science and Technology, Russia
M.4.3: Coded Data Rebalancing: Fundamental Limits and Constructions Prasad Krishnan, Lalitha Vadlamani, International Institute of Information Technology Hyderabad, India; Lakshmi Natarajan, Indian Institute of Technology, Hyderabad, India
M.4.4: A Combinatorial View of the Service Rates of Codes Problem, its Equivalence to Fractional Matching and its Connection with Batch Codes Fatemeh Kazemi, Esmaeil Karimi, Texas A&M University, United States; Emina Soljanin, Rutgers University, United States; Alex Sprintson, Texas A&M University, United States
M.4.5: Secure Determinant Codes: Type-II Security Michelle Kleckler, University of Minnesota, United States; Soheil Mohajer, University of Minnesota, Twin, United States
Attend M.5: Coding for Storage and Memories I
M.5.1: Reconstruction of Strings from their Substrings Spectrum Sagi Marcovich, Eitan Yaakobi, Technion - Israel Institute of Technology, Israel
M.5.2: Locally Balanced Constraints Ryan Gabrys, UCSD, United States; Han Mao Kiah, NTU, Singapore; Alexander Vardy, UCSD, United States; Eitan Yaakobi, Yiwei Zhang, Technion - Israel Institute of Technology, Israel
M.5.3: Codes over Trees Lev Yohananov, Eitan Yaakobi, Technion, Israel
M.5.4: Coding for Sequence Reconstruction for Single Edits Han Mao Kiah, Nanyang Technological University, Singapore; Tuan Thanh Nguyen, Singapore University of Technology and Design, Singapore; Eitan Yaakobi, Technion, Israel
M.5.5: On parity-preserving variable-length constrained coding Ron M Roth, Technion, Israel; Paul H Siegel, UC San Diego, Israel
Attend M.6: Coding for Storage and Memories II
M.6.1: Q-ary Asymmetric LOCO Codes: Constrained Codes Supporting Flash Evolution Ahmed Hareedy, Beyza Dabak, Robert Calderbank, Duke University, United States
M.6.2: Constrained Coding with Error Control for DNA-Based Data Storage Tuan Thanh Nguyen, Kui Cai, Singapore University of Technology and Design, Singapore; Kees A. Schouhamer Immink, Turing Machines Inc, Netherlands; Han Mao Kiah, Nanyang Technological University, Singapore
M.6.3: Polar Codes with Balanced Codewords Utkarsh Gupta, Indian Institute of Technology, New Delhi, India; Han Mao Kiah, Nanyang Technological University, Singapore; Alexander Vardy, Hanwen Yao, University of California San Diego, United States
M.6.4: Maximum Likelihood Decoding for Channels with Uniform Noise and Signal Dependent Offset Renfei Bu, Jos H. Weber, Delft University of Technology, Netherlands; Kees A. Schouhamer Immink, Turing Machines Inc., Netherlands
M.6.5: Coding for Optimized Writing Rate in DNA Storage Siddharth Jain, California Institute of Technology, United States; Farzad Farnoud, University of Virginia, United States; Moshe Schwartz, Ben Gurion University, Israel; Jehoshua Bruck, California Institute of Technology, United States
M.6.6: Robust Indexing - Optimal Codes for DNA Storage Jin Sima, California Institute of Technology, United States; Netanel Raviv, Washington University in Saint Louis, United States; Jehoshua Bruck, California Institute of Technology, United States
Attend M.7: Insertion Deletion Substitution Codes I
M.7.1: Covering Codes for Insertions and Deletions Andreas Lenz, Technical University of Munich, Germany; Cyrus Rashtchian, Paul Siegel, University of California, San Diego, United States; Eitan Yaakobi, Technion - Israel Institute of Technology, Israel
M.7.2: Weight Enumerators for Number-Theoretic Codes and Cardinalities of Tenengolts' Non-binary Codes Takayuki Nozaki, Yamaguchi University, Japan
M.7.3: Error-correcting Codes for Short Tandem Duplication and Substitution Errors Yuanyuan Tang, Farzad Farnoud, The University of Virginia, United States
M.7.4: Optimal Codes for the q-ary Deletion Channel Jin Sima, California Institute of Technology, United States; Ryan Gabrys, University of California San Diego, United States; Jehoshua Bruck, California Institute of Technology, United States
M.7.5: Codes Correcting Synchronization Errors for Symbol-Pair Read Channels Yeow Meng Chee, National University of Singapore, Singapore; Van Khu Vu, Nanyang Technological University, Singapore
Attend M.8: Insertion Deletion Substitution Codes II
M.8.1: Syndrome Compression for Optimal Redundancy Codes Jin Sima, California Institute of Technology, United States; Ryan Gabrys, University of California San Diego, United States; Jehoshua Bruck, California Institute of Technology, United States
M.8.2: Optimal Codes Correcting a Burst of Deletions of Variable Length Andreas Lenz, Nikita Polyanskii, Technical University of Munich, Germany
M.8.3: The Error Probability of Maximum-Likelihood Decoding over Two Deletion/Insertion Channels Omer Sabary, Eitan Yaakobi, Alexander Yucovich, Technion - Israel Institute of Technology, Israel
M.8.4: Optimal Systematic t-Deletion Correcting Codes Jin Sima, California Institute of Technology, United States; Ryan Gabrys, University of California San Diego, United States; Jehoshua Bruck, California Institute of Technology, United States
M.8.5: Single-Deletion Single-Substitution Correcting Codes Ilya Smagloy, Technion, Israel; Lorenz Welter, Antonia Wachter-Zeh, Technical University of Munich, Germany; Eitan Yaakobi, Technion, Israel
M.8.6: Symbolwise MAP Estimation for Multiple-Trace Insertion/Deletion/Substitution Channels Ryo Sakogawa, Haruhiko Kaneko, Tokyo Institute of Technology, Japan
Attend M.9: Topics in Coding for Storage and Memories
M.9.1: Thermodynamically Stable DNA Code Design using a Similarity Significance Model Yixin Wang, Nanyang Technological University, Singapore; Noor-A-Rahim Md, University College Cork, Ireland; Erry Gunawan, Yong Liang Guan, Nanyang Technological University, Singapore; Chueh Loo Poh, National University of Singapore, Singapore
M.9.2: Optimizing the Write Fidelity of MRAMs Yongjune Kim, Yoocharn Jeon, Cyril Guyot, Western Digital Research, United States; Yuval Cassuto, Technion – Israel Institute of Technology, Israel
M.9.3: Fundamental limits of distributed encoding Nastaran Abadi Khooshemehr, Mohammad Ali Maddah-Ali, Sharif University of Technology, Iran
M.9.4: Noisy In-Memory Recursive Computation with Memristor Crossbars Elsa Dupraz, IMT Atlantique, France; Lav Varshney, University of Illinois at Urbana-Champaign, United States

Cryptography, Security and Privacy
Attend P.1: Covert Communications
P.1.1: Mobility-Assisted Covert Communication over Wireless Ad Hoc Networks Hyeon-Seong Im, Pohang University of Science and Technology, Korea (South); Si-Hyeon Lee, Korea Advanced Institute of Science and Technology, Korea (South)
P.1.2: Treating Interference as Noise is Optimal for Covert Communication over Interference Channels Kang-Hee Cho, Si-Hyeon Lee, Korea Advanced Institute of Science and Technology, Korea (South)
P.1.3: Stealth Communication with Vanishing Power over Binary Symmetric Channels Diego Lentner, Gerhard Kramer, Technical University of Munich, Germany
P.1.4: Covert MIMO Communications under Variational Distance Constraint Shi-Yuan Wang, Matthieu R. Bloch, Georgia Institute of Technology, United States
P.1.5: Keyless Covert Communication in the Presence of Channel State Information Hassan ZivariFard, University of Texas at Dallas, United States; Matthieu Bloch, Georgia Institute of Technology, United States; Aria Nosratinia, University of Texas at Dallas, United States
P.1.6: Active Covert Sensing Mehrdad Tahmasbi, Matthieu Bloch, Georgia Institute of Technology, United States
Attend P.2: Cryptography
P.2.1: Rank Preserving Code-based Signature Terry Shue Chien Lau, Chik How Tan, National University of Singapore, Singapore
P.2.2: An Ideal Secret Sharing Scheme Realizing an Access Structure Based on a Finite Projective Plane of Order 3 Yohei Okawa, Graduate School of Systems and Information Engineering, University of Tsukuba, Japan; Hiroki Koga, Faculty of Systems and Information Engineering, University of Tsukuba, Japan
P.2.3: An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption Ido Shahaf, Or Ordentlich, Gil Segev, Hebrew University of Jerusalem, Israel
P.2.4: Secret sharing schemes based on nonlinear codes Deepak Agrawal, Smarajit Das, Srinivasan Krishanaswamy, Indian Institute of Technology, Guwahati, India
P.2.5: Aggregate Message Authentication Codes with Detecting Functionality from Biorthogonal Codes Yoshinori Ogawa, Yokohama National University, Japan; Shingo Sato, National Institute of Information and Communications Technology, Japan; Junji Shikata, Yokohama National University, Japan; Hideki Imai, JAPAN DATACOM CO., LTD., Japan
Attend P.3: Information Privacy I
P.3.1: Biometric and Physical Identifiers with Correlated Noise for Controllable Private Authentication Onur Günlü, Rafael F. Schaefer, Technische Universität Berlin, Germany; H. Vincent Poor, Princeton University, United States
P.3.2: On Secrecy Key of a class of Secure Asymmetric Multilevel Diversity Coding System Congduan Li, Jingliang He, Shiqiu Liu, Dongliang Guo, Sun Yat-sen University, China; Linqi Song, City University of Hong Kong, China
P.3.3: Sequence Obfuscation to Thwart Pattern Matching Attacks Bo Guan, Nazanin Takbiri, Dennis Goeckel, Amir Houmansadr, Hossein Pishro-Nik, University of Massachusetts Amherst, United States
P.3.4: Distribution Privacy Under Function Recoverability Ajaykrishnan Nageswaran, Prakash Narayan, University of Maryland, College Park, United States
P.3.5: Privacy Amplification of Iterative Algorithms via Contraction Coefficients Shahab Asoodeh, Harvard University, United States; Mario Diaz, Universidad Nacional Autonoma de Mexico, Mexico; Flavio P. Calmon, Harvard University, United States
Attend P.4: Information Privacy II
P.4.1: Mechanisms for Hiding Sensitive Genotypes with Information-Theoretic Privacy Fangwei Ye, Rutgers University, United States; Hyunghoon Cho, Broad Institute of MIT and Harvard, United States; Salim El Rouayheb, Rutgers University, United States
P.4.2: Linear and Range Counting under Metric-based Local Differential Privacy Zhuolun Xiang, University of Illinois at Urbana-Champaign, United States; Bolin Ding, Alibaba Group, United States; Xi He, University of Waterloo, Canada; Jingren Zhou, Alibaba Group, United States
P.4.3: Hiding Identities: Estimation Under Local Differential Privacy Antonious M. Girgis, Deepesh Data, Suhas Diggavi, UCLA, United States
P.4.4: A Better Bound Gives a Hundred Rounds: Enhanced Privacy Guarantees via f-Divergences Shahab Asoodeh, Harvard University, United States; Jiachun Liao, Arizona State University, United States; Flavio P. Calmon, Harvard University, United States; Oliver Kosut, Lalitha Sankar, Arizona State University, United States
P.4.5: Privacy-Utility Tradeoff in a Guessing Framework Inspired by Index Coding Yucheng Liu, Australian National University, Australia; Ni Ding, Commonwealth Scientific and Industrial Research Organisation, Australia; Parastoo Sadeghi, Australian National University, Australia; Thierry Rakotoarivelo, Commonwealth Scientific and Industrial Research Organisation, Australia
Attend P.5: Information Theoretic Security I
P.5.1: Remote Joint Strong Coordination and Reliable Communication Giulia Cervia, Tobias J. Oechtering, Mikael Skoglund, KTH Royal Institute of Technology, Sweden
P.5.2: Arbitrarily Varying Wiretap Channels with Non-Causal Side Information at the Jammer Carsten Rudolf Janda, Eduard Axel Jorswieck, TU Braunschweig, Germany; Moritz Wiese, Holger Boche, TU Munich, Germany
P.5.3: Conditional Disclosure of Secrets: A Noise and Signal Alignment Approach Zhou Li, Hua Sun, University of North Texas, United States
P.5.4: An Achievable Region for the Multiple Access Wiretap Channels with Confidential and Open Messages Hao Xu, Giuseppe Caire, Technical University of Berlin, Germany; Cunhua Pan, Queen Mary University of London, United Kingdom
P.5.5: On the Discussion Rate Region for the PIN Model Qiaoqiao Zhou, Department of Information Engineering, The Chinese University of Hong Kong., China; Chung Chan, Department of Computer Science, City University of Hong Kong, China; Raymond Yeung, Department of Information Engineering, The Chinese University of Hong Kong., China
Attend P.6: Information Theoretic Security II
P.6.1: Delay-Optimal Coding for Secure Transmission over Parallel Burst Erasure Channels with an Eavesdropper Anna Frank, Technische Universität München, Germany
P.6.2: Secure Information Exchange for Omniscience Chung Chan, City University of Hong Kong, China; Navin Kashyap, Praneeth Kumar Vippathalla, Indian Institute of Science, India; Qiaoqiao Zhou, The Chinese University of Hong Kong, China
P.6.3: Secure Computation to Hide Functions of Inputs Gowtham R. Kurri, Vinod M. Prabhakaran, Tata Institute of Fundamental Research, India
P.6.4: Network Information Theoretic Security Hongchao Zhou, Shandong University, China; Abbas El Gamal, Stanford University, United States
P.6.5: Authentication with Mildly Myopic Adversaries Allison Beemer, New Jersey Institute of Technology, United States; Eric Graves, U.S. Army Research Laboratory, United States; Joerg Kliewer, New Jersey Institute of Technology, United States; Oliver Kosut, Arizona State University, United States; Paul Yu, U.S. Army Research Laboratory, United States
Attend P.7: Information Theoretic Security III
P.7.1: Resolvability of the Multiple Access Channel with Two-Sided Cooperation Noha Helal, The University of Texas at Dallas, United States; Matthieu Bloch, Georgia Institute of Technology, United States; Aria Nosratinia, The University of Texas at Dallas, United States
P.7.2: A compression perspective on secrecy measures Yanina Y. Shkel, Ecole Polytechnique Fédérale, Lausanne, Switzerland; H. Vincent Poor, Princeton University, United States
P.7.3: Private Two-Terminal Hypothesis Testing Varun Narayanan, Tata Institute of Fundamental Research, India; Manoj Mishra, National Institute of Science Education and Research, Bhubaneswar, Homi Bhabha National Institute, India; Vinod Prabhakaran, Tata Institute of Fundamental Research, India
P.7.4: Capacity Region of the Gaussian Arbitrarily-Varying Broadcast Channel Fatemeh Hosseinigoki, Oliver Kosut, Arizona State University, United States
Attend P.8: Private Information Retrieval I
P.8.1: On the Storage Cost of Private Information Retrieval Chao Tian, Texas A&M University, United States
P.8.2: On the Information Leakage in Private Information Retrieval Systems Tao Guo, Ruida Zhou, Chao Tian, Texas A&M University, United States
P.8.3: Array Codes for Functional PIR and Batch Codes Mohammad Nassar, Eitan Yaakobi, Technion - Israel Institute of Technology, Israel
P.8.4: The Minimum Upload Cost of Symmetric Private Information Retrieval Yanliang Zhou, University of North Texas, United States; Qiwen Wang, Huawei, Sweden; Hua Sun, Shengli Fu, University of North Texas, United States
P.8.5: Private Set Intersection Using Multi-Message Symmetric Private Information Retrieval Zhusheng Wang, University of Maryland, United States; Karim Banawan, Alexandria University, Egypt; Sennur Ulukus, University of Maryland, United States
Attend P.9: Private Information Retrieval II
P.9.1: The Capacity of Private Information Retrieval Under Arbitrary Collusion Patterns Xinyu Yao, Wei Kang, Nan Liu, Southeast University, China
P.9.2: Private Information Retrieval Over Gaussian MAC Ori Shmuel, Asaf Cohen, Ben Gurion University of the Negev, Israel
P.9.3: The Capacity of Single-Server Weakly-Private Information Retrieval Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Simula UiB, Norway; Alexandre Graell i Amat, Chalmers University of Technology/Simula UiB, Sweden; Eitan Yaakobi, Technion — Israel Institute of Technology, Israel
P.9.4: Quantum Private Information Retrieval from MDS-coded and Colluding Servers Matteo Allaix, Aalto University, Finland; Lukas Holzbaur, Technical University of Munich, Germany; Tefjol Pllaha, Camilla Hollanti, Aalto University, Finland
P.9.5: Computational Code-Based Single-Server Private Information Retrieval Lukas Holzbaur, Technical University of Munich, Germany; Camilla Hollanti, Aalto University, Finland; Antonia Wachter-Zeh, Technical University of Munich, Germany
Attend P.10: Private Information Retrieval III
P.10.1: Latent-variable Private Information Retrieval Islam Samy, Mohamed A. Attia, Ravi Tandon, Loukas Lazos, University of Arizona, United States
P.10.2: Capacity of Quantum Private Information Retrieval with Colluding Servers Seunghoan Song, Nagoya University, Japan; Masahito Hayashi, Southern University of Science and Technology, China
P.10.3: Single-Server Multi-message Private Information Retrieval with Side Information: the General Cases Su Li, Michael Gastpar, EPFL, Switzerland
P.10.4: Weakly Private Information Retrieval under the Maximal Leakage Metric Ruida Zhou, Tao Guo, Chao Tian, Texas A&M University, United States
P.10.5: Cache-aided Multiuser Private Information Retrieval Xiang Zhang, University of Utah, United States; Kai Wan, Technische Universitat Berlin, Germany; Hua Sun, University of North Texas, United States; Mingyue Ji, University of Utah, United States
Attend P.11: Topics in Privacy and Cryptography
P.11.1: Secret Key Generation From Vector Gaussian Sources With Public and Private Communications Yinfei Xu, Southeast University, China; Daming Cao, National University of Singapore, Singapore
P.11.2: A Two-way QKD Protocol Outperforming One-way Protocols at Low QBER Jari Veli Elias Lietzén, Roope Iikanpoika Vehkalahti, Olav Tirkkonen, Aalto University, Finland
P.11.3: Private Computation with Individual and Joint Privacy Anoosheh Heidarzadeh, Alex Sprintson, Texas A&M University, United States
P.11.4: Private Function Computation Behrooz Tahmasebi, MIT, United States; Mohammad Ali Maddah-Ali, Nokia Bell Labs, United States
P.11.5: Uplink Cost Adjustable Schemes in Secure Distributed Matrix Multiplication Jaber Kakar, Anton Khristoforov, Seyedhamed Ebadifar, Aydin Sezgin, Ruhr University Bochum, Germany

Detection and Estimation
Attend E.1: Detection Theory
E.1.1: Optimal Two-Stage Bayesian Sequential Change Diagnosis Xiaochuan Ma, Lifeng Lai, University of California, Davis, United States; Shuguang Cui, the Chinese University of Hong Kong, Shenzhen, China
E.1.2: Second-Order Asymptotically Optimal Change-point Detection Algorithm with Sampling Control Qunzhi Xu, Yajun Mei, Georgia Institute of Technology, United States; George V. Moustakides, University of Patras, Greece, Greece
E.1.3: Sequential detection and isolation of a correlated pair Anamitra Chaudhuri, Georgios Fellouris, University of Illinois, Urbana-Champaign, United States
E.1.4: Multislot and Multistream Quickest Change Detection in Statistically Periodic Processes Taposh Banerjee, University of Texas at San Antonio, United States; Prudhvi Gurram, CCDC Army Research Lab and Booz Allen Hamilton, United States; Gene Whipps, CCDC Army Research Lab, United States
E.1.5: A Game-Theoretic Approach to Sequential Detection in Adversarial Environments Ruizhi Zhang, University of Nebraska-Lincoln, United States; Shaofeng Zou, University at Buffalo, the State University of New York, United States
Attend E.2: Detection and Applications
E.2.1: Asymptotics of Quickest Change Detection with an Energy Harvesting Sensor Subhrakanti Dey, National University of Ireland, Maynooth, Ireland
E.2.2: Sequential anomaly detection with observation control under a generalized error metric Aristomenis Tsopelakos, Georgios Fellouris, University of Illinois at Urbana Champaign, United States
E.2.3: Quickest Detection of a Dynamic Anomaly in a Heterogeneous Sensor Network Georgios Rovatsos, Venugopal V. Veeravalli, University of Illinois at Urbana-Champaign, United States; George V. Moustakides, University of Patras, Rio, Greece, United States
E.2.4: Sparse Activity Detection in Cell-Free Massive MIMO systems Mangqing Guo, M. Cenk Gursoy, Pramod K. Varshney, Syracuse University, United States
Attend E.3: Estimation Theory
E.3.1: A General Derivative Identity for the Conditional Mean Estimator in Gaussian Noise and Some Applications Alex Dytso, H. Vincent Poor, Shlomo Shamai (Shitz), Princeton University, United States
E.3.2: On the Sample Complexity of Estimating Small Singular Modes Xiangxiang Xu, Tsinghua University, China; Weida Wang, Shao-Lun Huang, Tsinghua-Berkeley Shenzhen Institute, China
E.3.3: On the Randomized Babai Point Xiao-Wen Chang, Zhilong Chen, Yingzi Xu, McGill University, Canada
E.3.4: When does the Tukey Median work? Banghua Zhu, Jiantao Jiao, Jacob Steinhardt, University of California, Berkeley, United States
E.3.5: Missing Mass of Markov Chains Prafulla Chandra, Andrew Thangaraj, Indian Institute of Technology Madras, India; Nived Rajaraman, University of California Berkeley, United States
E.3.6: Linear Models are Most Favorable among Generalized Linear Models Kuan-Yun Lee, Thomas A. Courtade, UC Berkeley, United States
Attend E.4: Estimation and Applications
E.4.1: Weak-Noise Modulation-Estimation of Vector Parameters Neri Merhav, Technion - Israel Institute of Technology, Israel
E.4.2: "Wireless Paint": Code Design for 3D Orientation Estimation with Backscatter Arrays Kenneth Chang, University of California, Los Angeles, United States; Nathaniel Raymondi, Ashutosh Sabharwal, Rice University, United States; Suhas Diggavi, University of California, Los Angeles, United States
E.4.3: Achievability of nearly-exact alignment for correlated Gaussian databases Osman Emre Dai, Georgia Institute of Technology, United States; Daniel Cullina, Pennsylvania State University, United States; Negar Kiyavash, Ecole Polytechnique Fédérale de Lausanne, Switzerland
E.4.4: Pattern-Based Analysis of Time Series: Estimation Elyas Sabeti, Peter Song, Alfred Hero, University of Michigan, Ann Arbor, United States
E.4.5: Minimax Lower Bounds for Circular Source Localization Aolin Xu, , United States; Todd Coleman, UCSD, United States*
Attend E.5: Hypothesis Testing I
E.5.1: Evasive Active Hypothesis Testing Meng-Che Chang, Matthieu Bloch, Georgia Institution of Technology, United States
E.5.2: Sequential Hypothesis Criterion Based Optimal Caching Schemes in Wireless Networks Xi Zhang, Qixuan Zhu, Texas A&M University, United States; H. Vincent Poor, Princeton University, United States
E.5.3: Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules Tomer Berg, Tel Aviv University, Israel; Or Ordentlich, Hebrew University, Israel; Ofer Shayevitz, Tel Aviv University, Israel
E.5.4: Social Learning with Beliefs in a Parallel Network Daewon Seo, University of Wisconsin-Madison, United States; Ravi Kiran Raman, Analog Devices, United States; Lav R. Varshney, University of Illinois at Urbana-Champaign, United States
E.5.5: Two-Sample Testing on Pairwise Comparison Data and the Role of Modeling Assumptions Charvi Rastogi, Sivaraman Balakrishnan, Nihar Shah, Aarti Singh, Carnegie Mellon University, United States
E.5.6: Testing for Anomalies: Active Strategies and Non-asymptotic Analysis Dhruva Kartik, Ashutosh Nayyar, Urbashi Mitra, University of Southern California, United States
Attend E.6: Hypothesis Testing II
E.6.1: Strong Converse for Testing Against Independence over a Noisy channel Sreejith Sreekumar, Deniz Gunduz, Imperial College London, United Kingdom
E.6.2: Hypothesis Testing Against Independence Under Gaussian Noise Abdellatif Zaidi, Universite Paris-Est, France
E.6.3: Second-Order Asymptotics of Sequential Hypothesis Testing Yonglong Li, Vincent, Y. F. Tan, National University of Singapore, Singapore
E.6.4: Data-Driven Representations for Testing Independence: A Connection with Mutual Information Estimation Mauricio Gonzales, Jorge F. Silva, Universidad de Chile, Chile
E.6.5: Recovering Structure of Noisy Data through Hypothesis Testing Minoh Jeong, University of Minnesota, United States; Alex Dytso, Princeton University, United States; Martina Cardone, University of Minnesota, United States; H. Vincent Poor, Princeton University, United States
E.6.6: On the Error Exponent of Approximate Sufficient Statistics for M-ary Hypothesis Testing Jiachun Pan, Yonglong Li, Vincent Y. F. Tan, National University of Singapore, Singapore; Yonina C. Eldar, Weizmann Institute of Science, Israel

Graphs, Games, Sparsity, and Signal Processing
Attend G.1: Graph Analytics
G.1.1: Approximate Recovery Of Ising Models with Side Information Saurabh Sihag, Ali Tajer, RPI, United States
G.1.2: Minimax Prediction in Tree Ising Models Guy Bresler, MIT, United States; Mina Karzand, University of Wisconsin-Madison, United States
G.1.3: Characterizing the Bethe Partition Function of Double-Edge Factor Graphs via Graph Covers Yuwen Huang, Pascal O Vontobel, The Chinese University of Hong Kong, China
G.1.4: Online Variational Message Passing in Hierarchical Autoregressive Models Albert Podusenko, Wouter Marco Kouw, Bert de Vries, Eindhoven University of Technology, Netherlands
G.1.5: k-Connectivity in Random Graphs induced by Pairwise Key Predistribution Schemes Mansi Sood, Osman Yagan, Carnegie Mellon University Pittsburgh, United States
G.1.6: Temporal Ordered Clustering in Dynamic Networks Krzysztof Turowski, Jagiellonian University, Poland; Jithin Sreedharan, Wojciech Szpankowski, Purdue University, United States
G.1.7: Community Detection with Secondary Latent Variables Mohammad Esmaeili, Aria Nosratinia, The University of Texas at Dallas, United States
Attend G.2: Game Theory
G.2.1: Comparison of Information Structures for Zero-Sum Games in Standard Borel Spaces Ian Hogeboom-Burr, Serdar Yuksel, Queen's University, Canada
G.2.2: Quadratic Privacy-Signaling Games and Payoff Dominant Equilibria Ertan Kazıklı, Sinan Gezici, Bilkent University, Turkey; Serdar Yüksel, Queen's University, Canada
G.2.3: Observational Learning with Fake Agents Pawan Poojary, Randall Berry, Northwestern University, United States
G.2.4: Achievable Rates for Strategic Communication Anuj S. Vora, Ankur A. Kulkarni, Indian Institute of Technology Bombay, India
Attend G.3: Compressed Sensing
G.3.1: Optimal Restricted Isometry Condition for Exact Sparse Recovery with Orthogonal Least Squares Junhan Kim, Byonghyo Shim, Seoul National University, Korea (South)
G.3.2: Some Performance Guarantees of Global LASSO with Local Assumptions for Convolutional Sparse Design Matrices Avishek Ghosh, Kannan Ramachandran, University of California, Berkeley, United States
G.3.3: Quantized Corrupted Sensing with Random Dithering Zhongxing Sun, Wei Cui, Yulong Liu, Beijing Institute of Technology, China
G.3.4: Macroscopic Analysis of Vector Approximate Message Passing in a Model Mismatch Setting Takashi Takahashi, Tokyo Institute of Technology, Japan; Yoshiyuki Kabashima, The University of Tokyo, Japan
G.3.5: A Novel B-MAP Proxy for Greedy Sparse Signal Recovery Algorithms Jeongmin Chae, Song-Nam Hong, Ajou University, Korea (South)
Attend G.4: Group Testing and Sparse Codes
Attend G.5: Signal Processing
G.5.1: On the Sample Complexity and Optimization Landscape for Quadratic Feasibility Problems Parth Kashyap Thaker, Gautam Dasarathy, Angelia Nedich, Arizona State University, United States
G.5.2: Structured Quasi-Gray labelling for Reed-Muller Grassmannian Constellations Yi Qin, Renaud-Alexandre Pitaval, Huawei Technologies Sweden AB, Sweden
G.5.3: Structure of Optimal Quantizer for Binary-Input Continuous-Output Channels with Output Constraints Thuan Nguyen, Thinh Nguyen, Oregon State University, United States
G.5.4: DoF Analysis for Multipath-Assisted Imaging: Single Frequency Illumination Nishant Mehrotra, Ashutosh Sabharwal, Rice University, United States
G.5.5: Some results on convolution idempotents Charantej Reddy P, Aditya Siripuram, Indian Institute of Technology Hyderabad, India; Brad Osgood, Stanford University, United States

Industry Track
IND-1: 5G and Its Evolution Towards 6G
IND-2: Distributed Learning over Wireless Edge
IND-3: Finite Block Length Information Theory: Application to 5G System Design
IND-4: Selected Topics on Deep-Learning Based Communication System Design

Network Information Theory
Attend I.1: Broadcast Channel I
I.1.1: DoF Region of the Decentralized MIMO Broadcast Channel—How many informed antennas do we need? Antonio Bazco-Nogueras, EURECOM, France; Arash Davoodi, Carnegie Mellon University, United States; Paul de Kerret, David Gesbert, EURECOM, France; Nicolas Gresset, Mitsubishi Electric R&D Centre Europe, France; Syed Jafar, University of California, Irvine, United States
I.1.2: The Fading Gaussian Broadcast Channel with Channel State Information and Output Feedback Siyao Li, Daniela Tuninetti, Natasha Devroye, University of Illinois at Chicago, United States
I.1.3: When does Partial Noisy Feedback Enlarge the Capacity of a Gaussian Broadcast Channel? Aditya Narayan Ravi, Sibi Raj B. Pillai, Indian Institute of Technology Bombay, India; Vinod M. Prabhakaran, Tata Institute of Fundamental Research, Mumbai, India; Michele Wigger, Telecom Paris Tech, France, France
I.1.4: On the Capacity Region of the Three-Receiver Broadcast Channel With Receiver Message Cognition Mohamed Salman, Mahesh Varanasi, University of Colorado-Boulder, United States
Attend I.2: Broadcast Channel II
I.2.1: New Outer Bounds for the Two-Receiver Broadcast Channel Amin Gohari, Tehran Institute for Advanced Studies, Iran; Chandra Nair, The Chinese University of Hong Kong, China
I.2.2: Diamond Message Set Groupcasting: From an Achievable Rate Region for the DM Broadcast Channel to the Capacity of the Combination Network Mohamed Salman, Mahesh Varanasi, University of Colorado-Boulder, United States
I.2.3: Broadcasting on trees near criticality Yuzhou Gu, Hajir Roozbehani, Yury Polyanskiy, Massachusetts Institute of Technology, United States
I.2.4: On the Broadcast Channel with Non-Distinct Message Demands and Symmetric Side Information Mohamed Salman, Mahesh Varanasi, University of Colorado-Boulder, United States
Attend I.3: Interference Channel I
I.3.1: Multi-layer Interference Alignment and GDoF of the K-User Asymmetric Interference Channel Jinyuan Chen, Louisiana Tech University, United States
I.3.2: On the structure of certain non-convex functionals and the Gaussian Z-interference channel Max Costa, University of Campinas, Brazil; Chandra Nair, David Ng, Yan Nan Wang, The Chinese University of Hong Kong, China
I.3.3: Interference Management without CSIT: A Broadcast Approach Maha Zohdy, Ali Tajer, RPI, United States; Shlomo Shamai (Shitz), Technion, Israel
I.3.4: Embedding Information in Radiation Pattern Fluctuations Milad Johnny, N/A, Iran; Alireza Vahid, University of Colorado Denver, United States
Attend I.4: Interference Channel II
I.4.1: On the AND-OR Interference Channel and the Sandglass Conjecture Chandra Nair, The Chinese University of Hong Kong, China; Mehdi Yazdanpanah, Goldman Sachs (HK), China
I.4.2: On Discrete Signaling and Treating Interference as Noise for Complex Gaussian Interference Channels Min Qiu, University of New South Wales, Australia; Yu-Chih Huang, National Chiao Tung Unversity, Taiwan; Jinhong Yuan, University of New South Wales, Australia
I.4.3: Secure Communications with Limited Common Randomness at Transmitters Fan Li, Jinyuan Chen, Louisiana Tech University, United States
I.4.4: Secure GDoF of the Z-channel with Finite Precision CSIT: How Robust are Structured Codes? Yao-Chia Chan, Syed Ali Jafar, University of California, Irvine, United States
Attend I.5: Network Information Theory
I.5.1: Strong Coordination with Side Information Viswanathan Ramachandran, Sibi Raj B Pillai, Indian Institute of Technology Bombay, India; Vinod M. Prabhakaran, Tata Institute of Fundamental Research, India
I.5.2: Source Coding for Synthesizing Correlated Randomness Touheed Anwar Atif, University of Michigan Ann Arbor, United States; Arun Padakandla, University of Tennessee at Knoxville, United States; S. Sandeep Pradhan, University of Michigan Ann Arbor, United States
I.5.3: Explicit Construction of Multiple Access Channel Resolvability Codes from Source Resolvability Codes Rumia Sultana, Remi A. Chou, Wichita State University, United States
I.5.4: A Functional Construction of Codes for Multiple Access and Broadcast Channels Shouvik Ganguly, University of California, San Diego, United States; Lele Wang, University of British Columbia, Canada; Young-Han Kim, University of California, San Diego, United States
I.5.5: Quadratically Constrained Two-way Adversarial Channels Yihan Zhang, The Chinese University of Hong Kong, China; Shashank Vatedka, Indian Institute of Technology, Hyderabad, India; Sidharth Jaggi, The Chinese University of Hong Kong, China
Attend I.6: Relay Channel
I.6.1: On the Fraction of Capacity One Relay can Achieve in Gaussian Half-Duplex Diamond Networks Sarthak Jain, Soheil Mohajer, Martina Cardone, University of Minnesota, Twin Cities, United States
I.6.2: Gaussian 1-2-1 Networks with Imperfect Beamforming Yahya H. Ezzeldin, University of California, Los Angeles, United States; Martina Cardone, University of Minnesota, Twin Cities, United States; Christina Fragouli, University of California, Los Angeles, United States; Giuseppe Caire, Technische Universität Berlin, Germany
I.6.3: Multi-Cast Channels with Hierarchical Flow Jonathan Ponniah, San Jose State University, United States; Liang-Liang Xie, University of Waterloo, Canada
I.6.4: Queue-Aware Beam Scheduling for Half-Duplex mmWave Relay Networks Xiaoshen Song, Giuseppe Caire, Technische Universität Berlin, Germany

Networking and Network Coding
Attend N.1: Network Coding I
N.1.1: The Langberg-Medard Multiple Unicast Conjecture: Stable 3-Pair Networks Kai Cai, Guangyue Han, The University of Hong Kong, China
N.1.2: On the Partition Bound for Undirected Unicast Network Information Capacity Mohammad Ishtiyaq Qureshi, Satyajit Thakor, Indian Institute of Technology Mandi, India
N.1.3: Upper Bound Scalability on Achievable Rates of Batched Codes for Line Networks Shenghao Yang, Jie Wang, The Chinese University of Hong Kong, Shenzhen, China
N.1.4: Linear Network Error Correction Coding Revisited Xuan Guang, Nankai University, China; Wai-Ho Raymond Yeung, The Chinese University of Hong Kong, China
Attend N.2: Network Coding II
N.2.1: Network Coding Based on Byte-wise Circular Shift and Integer Addition Kenneth W. Shum, The Chinese University of Hong Kong (Shenzhen), China; Hanxu Hou, Dongguang University of Technology, China
N.2.2: On the Gap between Scalar and Vector Solutions of Generalized Combination Networks Hedongliang Liu, Technical University of Munich, Germany; Hengjia Wei, Ben-Gurion University of the Negev, Israel; Sven Puchinger, Technical University of Denmark, Denmark; Antonia Wachter-Zeh, Technical University of Munich, Germany; Moshe Schwartz, Ben-Gurion University of the Negev, Israel
N.2.3: On the Memory Requirements of Block Interleaver for Batched Network Codes Hoover H. F. Yin, Ka Hei Ng, Xishi Wang, Qi Cao, Lucien K. L. Ng, The Chinese University of Hong Kong, China
N.2.4: Discrete Water Filling Multi-Path Packet Scheduling Arno Schneuwly, Oracle Labs, Switzerland; Derya Malak, Rensselaer Polytechnic Institute, Switzerland; Muriel Medard, Massachusetts Institute of Technology, Switzerland
Attend N.3: Coded Caching I
N.3.1: On the Optimality of Two Decentralized Coded Caching Schemes With and Without Error Correction Nujoom Sageer Karat, Kodi Lakshmi Vijith Bhargav, Balaji Sundar Rajan, Indian Institute of Science Bangalore, India
N.3.2: An Optimal Linear Error Correcting Scheme for Shared Caching with Small Cache Sizes Sonu Rathi, Anoop Thomas, Monolina Dutta, Indian Institute of Technology Bhubaneswar, India
N.3.3: Extending the Optimality Range of Multi-Antenna Coded Caching with Shared Caches Emanuele Parrinello, Petros Elia, EURECOM, France; Eleftherios Lampiris, Technical University of Berlin, Germany
N.3.4: Eliminating Pairing Loss for Coded Caching with Three Erasure-Coded Servers Aniruddha Phatak, Mahesh K. Varanasi, University of Colorado Boulder, United States
N.3.5: An Upper Bound on the Capacity-Memory Tradeoff of Interleavable Discrete Memoryless Broadcast Channels with Uncoded Prefetching Mohamed Salman, Mahesh Varanasi, University of Colorado-Boulder, United States
Attend N.4: Coded Caching II
N.4.1: Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic Hamdi Joudeh, Eleftherios Lampiris, Technische Universität Berlin, Germany; Petros Elia, EURECOM, France; Giuseppe Caire, Technische Universität Berlin, Germany
N.4.2: A New Design Framework on D2D Coded Caching with Optimal Rate and Less Subpacketizations Xiang Zhang, Xianfeng (Terry) Yang, Mingyue Ji, University of Utah, United States
N.4.3: Novel Converse for Device-to-Device Demand-Private Caching with a Trusted Server Kai Wan, Technische Universität Berlin, Germany; Hua Sun, University of North Texas, United States; Mingyue Ji, University of Utah, United States; Daniela Tuninetti, University of Illinois at Chicago, United States; Giuseppe Caire, Technische Universität Berlin, Germany
N.4.4: Successive Refinement to Caching for Dynamic Requests Pinar Sen, University of California, San Diego, United States; Michael Gastpar, Ecole Polytechnique Federale de Lausanne, Switzerland; Young-Han Kim, University of California, San Diego, United States
N.4.5: Cache-Aided Scalar Linear Function Retrieval Kai Wan, Technische Universität Berlin, Germany; Hua Sun, University of North Texas, United States; Mingyue Ji, University of Utah, Salt Lake City, United States; Daniela Tuninetti, University of Illinois at Chicago, United States; Giuseppe Caire, Technische Universität Berlin, Germany
Attend N.5: Index Coding
N.5.1: Min-rank of Embedded Index Coding Problems Anjana Ambika Mahesh, Nujoom Sageer Karat, Balaji Sundar Rajan, Indian Institute of Science Bangalore, India
N.5.2: Secure Decentralized Pliable Index Coding Tang Liu, Daniela Tuninetti, University of Illinois at Chicago, United States
N.5.3: Secure Network and Index Coding Equivalence: The Last Piece of the Puzzle Lawrence Ong, The University of Newcastle, Australia; Badri N. Vellambi, University of Cincinnati, United States
Attend N.6: Age of Information I
N.6.1: Fundamental Limits of Age-of-Information in Stationary and Non-stationary Environments Subhankar Banerjee, Rajarshi Bhattacharjee, Abhishek Sinha, Indian Institute of Technology Madras, India
N.6.2: Asymptotically Optimal Scheduling Policy For Minimizing The Age of Information Ali Maatouk, Saad Kriouile, Mohamad Assaad, CentraleSupelec, France; Anthony Ephremides, University of Maryland, United States
N.6.3: Minimizing Age of Information via Hybrid NOMA/OMA Qian Wang, The University of Sydney, Australia; He Chen, Chinese University of Hong Kong, China; Yonghui Li, Branka Vucetic, The University of Sydney, Australia
N.6.4: Age of Information in Uncoordinated Unslotted Updating Roy D. Yates, Rutgers University, United States; Sanjit K. Kaul, IIIT-Delhi, India
Attend N.7: Age of Information II
N.7.1: Average Age of Information for a Multi-Source M/M/1 Queueing Model With Packet Management Mohammad Moltafet, Markus Leinonen, University of Oulu, Finland; Marian Codreanu, Linkoping University, Sweden
N.7.2: Age of Information in Random Access Channels Xingran Chen, Konstantinos Gatsis, Hamed Hassani, Shirin Saeedi Bidokhti, University of Pennsylvania, United States
N.7.3: AoI Minimization in Broadcast Channels with Channel State Information Songtao Feng, Jing Yang, PSU, United States
N.7.4: Age-of-Information Revisited: Two-way Delay and Distribution-oblivious Online Algorithm Cho-Hsin Tsai, Chih-Chun Wang, Purdue University, United States
Attend N.8: Timely Updates
N.8.1: Timely Status Updating Through Intermittent Sensing and Transmission Omur Ozel, George Washington University, United States
N.8.2: Optimal Selective Encoding for Timely Updates with Empty Symbol Baturalp Buyukates, Melih Bastopcu, Sennur Ulukus, University of Maryland, United States
N.8.3: Partial Updates: Losing Information for Freshness Melih Bastopcu, Sennur Ulukus, University of Maryland, United States
N.8.4: Data Freshness in Leader-Based Replicated Storage Amir Behrouzi-Far, Emina Soljanin, Roy D. Yates, Rutgers University, United States
N.8.5: Timely Estimation Using Coded Quantized Samples Ahmed Arafa, University of North Carolina at Charlotte, United States; Karim Banawan, Alexandria University, Egypt; Karim G. Seddik, American University in Cairo, Egypt; H. Vincent Poor, Princeton University, United States

Quantum Systems, Codes, and Information
Attend Q.1: Quantum Communication
Q.1.1: Communication over Quantum Channels with Parameter Estimation Uzi Pereg, Technical University of Munich, Germany
Q.1.2: Quantum Advantage via Qubit Belief-Propagation Narayanan Rengaswamy, Duke University, United States; Kaushik Seshadreesan, Saikat Guha, University of Arizona, United States; Henry D. Pfister, Duke University, United States
Q.1.3: Performance of Gaussian encodings for classical communication on correlated quantum phase-noise channels Marco Fanizza, NEST, Scuola Normale Superiore, Istituto Nanoscienze - CNR, Italy; Matteo Rosati, Michalis Skotiniotis, John Calsamiglia, Física Teòrica: Informació i Fenòmens Quàntics, Departament de Física, Universitat Autònoma de Barcelona, Spain; Vittorio Giovannetti, NEST, Scuola Normale Superiore, Istituto di Nanoscienze - CNR, Italy
Q.1.4: Infinite-fold enhancement in communications capacity using pre-shared entanglement Saikat Guha, Quntao Zhuang, Boulat Bash, University of Arizona, United States
Q.1.5: Permutation Enhances Classical Communication Assisted by Entangled States Kun Wang, Southern University of Science and Technology, China; Masahito Hayashi, Nagoya University, Japan
Attend Q.2: Quantum Compression
Q.2.1: Second-order asymptotics of quantum data compression from partially-smoothed conditional entropy Dina Abdelhadi, EPFL, Switzerland; Joseph M. Renes, ETH Zürich, Switzerland
Q.2.2: General Mixed State Quantum Data Compression with and without Entanglement Assistance Zahra Baghali Khanian, Andreas Winter, Universitat Autonoma de Barcelona, Spain
Q.2.3: Quantum State Redistribution for Ensemble Sources Zahra Baghali Khanian, Universitat Autonoma de Barcelona and ICFO Barcelona, Spain; Andreas Winter, Universitat Autonoma de Barcelona, Spain
Q.2.4: One-Shot Trade-Off Bounds for State Redistribution of Classical-Quantum Sources Eyuri Wakakuwa, University of Electro-Communications, Japan; Yoshifumi Nakata, Kyoto University, Japan; Min-Hsiu Hsieh, University of Technology Sydney, Australia
Attend Q.3: Quantum Error Correcting Codes and Decoding
Q.3.1: A Four-Qubits Code that is a Quantum Deletion Error-Correcting Code with the Optimal Length Manabu Hagiwara, Ayumu Nakayama, Chiba University, Japan
Q.3.2: Linear programming bounds for quantum amplitude damping codes Yingkai Ouyang, University of Sheffield, United Kingdom; Ching-Yi Lai, National Chiao Tung University, Taiwan
Q.3.3: Fidelity of Finite Length Quantum Codes in Qubit Erasure Channel Alexei Ashikhmin, Bell Labs, Nokia, United States
Q.3.4: Trimming Decoding of Color Codes over the Quantum Erasure Channel Sangjun Lee, CEA-Leti, France; Mehdi Mhalla, University of Grenoble Alpes, CNRS, Grenoble INP, LIG, France; Valentin Savin, CEA-Leti, France
Q.3.5: Classical Coding Problem from Transversal T Gates Narayanan Rengaswamy, Robert Calderbank, Michael Newman, Henry D. Pfister, Duke University, United States
Q.3.6: Reinforcement Learning with Neural Networks for Quantum Multiple Hypothesis Testing Sarah Anne Brandsen, Kevin Stubbs, Henry Pfister, Duke University, United States
Attend Q.4: Quantum Information Theory
Q.4.1: Entropy of a Quantum Channel: Definition, Properties, and Application Gilad Gour, University of Calgary, Canada; Mark Wilde, Louisiana State University, United States
Q.4.2: Quantum Blahut-Arimoto Algorithms Navneeth Ramakrishnan, Imperial College London, United Kingdom; Raban Iten, ETH Zurich, Switzerland; Volkher Scholz, Ghent University, Belgium; Mario Berta, Imperial College London, United Kingdom
Q.4.3: Coherent Quantum Channel Discrimination Mark Wilde, Louisiana State University, United States
Q.4.4: On the Advantage of Irreversible Processes in Single-System Games Xavier Coiteux-Roy, Stefan Wolf, Università della Svizzera italiana, Switzerland
Q.4.5: 2D Local Hamiltonian with Area Laws is QMA-Complete Yichen Huang, Massachusetts Institute of Technology, United States
Q.4.6: Adaptive Procedures for Discriminating Between Arbitrary Tensor-Product Quantum States Sarah Anne Brandsen, Mengke Lian, Kevin Stubbs, Narayanan Rengaswamy, Henry Pfister, Duke University, United States
Q.4.7: Quantification of Unextendible Entanglement and Its Applications in Entanglement Distillation Kun Wang, Southern University of Science and Technology, China; Xin Wang, Baidu, China; Mark Wilde, Louisiana State University, United States
Attend Q.5: Quantum Key Distribution
Q.5.1: Finite Key Analysis of the Extended B92 Protocol Omar Amer, Walter O Krawec, University of Connecticut, United States
Q.5.2: Multi-User Distillation of Common Randomness and Entanglement from Quantum States Farzin Salek, Andreas Winter, Universitat Autònoma de Barcelona, Spain
Attend Q.6: Quantum Networks
Q.6.1: Entanglement-Assisted Data Transmission as an Enabling Technology: A Link-Layer Perspective Janis Nötzel, Stephen DiAdamo, Technical University of Munich, Germany
Q.6.2: Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages Holger Boche, Gisbert Janssen, Sajad Saeedinaeeni, Technische Universität München, Germany
Q.6.3: Strong Converse Bounds in Quantum Network Information Theory Hao-Chung Cheng, Nilanjana Datta, University of Cambridge, United Kingdom; Cambyse Rouzé, Technische Universität München, Germany
Q.6.4: Classical Mechanism is Optimal in Classical-Quantum Differentially Private Mechanisms Yuuya Yoshida, Nagoya University, Japan; Masahito Hayashi, Southern University of Science and Technology, China
Attend Q.7: Quantum Security
Q.7.1: A New High-Dimensional Quantum Entropic Uncertainty Relation with Applications Walter O Krawec, University of Connecticut, United States
Q.7.2: Guesswork with Quantum Side Information: Optimal Strategies and Aspects of Security Eric P. Hanson, University of Cambridge, United Kingdom; Vishal Katariya, Louisiana State University, United States; Nilanjana Datta, University of Cambridge, United States; Mark M. Wilde, Louisiana State University, United States
Q.7.3: Semantic Security for Quantum Wiretap Channels Holger Boche, Minglai Cai, Lehrstuhl für Theoretische Informationstechnik, Germany; Christian Deppe, Roberto Ferrara, Lehr- und Forschungseinheit für Nachrichtentechnik, Germany; Moritz Wiese, Lehrstuhl für Theoretische Informationstechnik, Germany
Q.7.4: Additivity in Classical-Quantum Wiretap Channels Arkin Tikku, School of Physics, University of Sydney, Australia; Joseph M. Renes, ETH Zürich, Switzerland; Mario Berta, Imperial College London, United Kingdom

Shannon Theory
Attend S.1: Capacity Computation
S.1.1: Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels V. Arvind Rameshwar, Navin Kashyap, Indian Institute of Science, India
S.1.2: On the Algorithmic Computability of Achievability and Converse: ϵ-Capacity of Compound Channels and Asymptotic Bounds of Error-Correcting Codes Holger Boche, Technische Universität München, Germany; Rafael F. Schaefer, Technische Universität Berlin, Germany; H. Vincent Poor, Princeton University, United States
S.1.3: Capacity of Continuous Channels with Memory via Directed Information Neural Estimator Ziv Aharoni, Dor Tsur, Ben-Gurion University of the Negev, Israel; Ziv Goldfeld, Cornell University, United States; Haim Henry Permuter, Ben-Gurion University of the Negev, Israel
S.1.4: Computability of the Zero-Error capacity with Kolmogorov Oracle Holger Boche, Christian Deppe, Technische Universität München, Germany
Attend S.2: Channel Capacity
S.2.1: Bounds on Permutation Channel Capacity Anuran Makur, Massachusetts Institute of Technology, United States
S.2.2: Capacity Bounds for Amplitude-Constrained AWGN MIMO Channels with Fading Antonino Favano, Politecnico di Milano, Italy; Marco Ferrari, CNR-IEIIT, Italy; Maurizio Magarini, Luca Barletta, Politecnico di Milano, Italy
S.2.3: Capacity Bounds for Communication Systems with Quantization and Spectral Constraints Sourjya Dutta, Abbas Khalili, Elza Erkip, Sundeep Rangan, New York University, United States
S.2.4: Capacity of Line-of-Sight MIMO Channels Heedong Do, Namyoon Lee, Pohang University of Science and Technology, Korea (South); Angel Lozano, Universitat Pompeu Fabra, Spain
S.2.5: Capacity of Multicarrier Faster-than-Nyquist Signaling Yong Jin Daniel Kim, Rose-Hulman Institute of Technology, United States; Yi Feng, Duke University, United States
Attend S.3: Channels with Feedback
S.3.1: A Connection between Feedback Capacity and Kalman Filter for Colored Gaussian Noises Song Fang, Quanyan Zhu, New York University, United States
S.3.2: Bounds for the capacity error function for unidirectional channels with noiseless feedback Christian Deppe, Technische Universität München, Germany; Vladimir Lebedev, Russian Academy of Sciences, Russia; Georg Maringer, Technische Universität München, Germany
S.3.3: Feedback Channel Communication with Low Precision Arithmetic Yonatan Urman, David Burshtein, Tel-Aviv University, Israel
S.3.4: New Formulas of Ergodic Feedback Capacity of AGN Channels Driven by Stable and Unstable Autoregressive Noise Christos Kourtellaris, Charalambos D. Charalambous, University of Cyprus, Cyprus; Sergey Loyka, University of Ottawa, Canada
S.3.5: Measurement Dependent Noisy Search with Stochastic Coefficients Nancy Ronquillo, Tara Javidi, University of California, San Diego, United States
S.3.6: Decentralized sequential active hypothesis testing and the MAC feedback capacity Achilleas Anastasopoulos, Sandeep Pradhan, University of Michigan, United States
S.3.7: From Feedback Capacity to Tight Achievable Rates without Feedback for AGN Channels with Stable and Unstable Autoregressive Noise Christos Kourtellaris, Charalambos D. Charalambous, University of Cyprus, Cyprus; Sergey Loyka, University of Ottawa, Canada
Attend S.4: Channels with State
S.4.1: The Arbitrarily Varying Channel with Colored Gaussian Noise Uzi Pereg, Technical University of Munich, Germany; Yossef Steinberg, Technion, Israel
S.4.2: Symmetrizability for Myopic AVCs Amitalok Jayant Budkuley, Indian Institute of Technology Kharagpur, India; Bikash Kumar Dey, Indian Institute of Technology Bombay, India; Sidharth Jaggi, The Chinese University of Hong Kong, China; Michael Langberg, State University of New York at Buffalo, United States; Anand D. Sarwate, Rutgers The State University of New Jersey, United States; Carol Wang, Independent Researcher, United States
S.4.3: An Explicit Formula for the Zero-Error Feedback Capacity of a Class of Finite-State Additive Noise Channels Amir Saberi, Farhad Farokhi, Girish N. Nair, University of Melbourne, Australia
S.4.4: On the Capacity of Deletion Channels with States Yonglong Li, Vincent, Y. F. Tan, National University of Singapore, Singapore
S.4.5: Feedback Capacity of Finite-State Channels with Causal State Known at the Encoder Eli Shalom Shemuel, Oron Sabag, Haim Permuter, Ben Gurion University, Israel
S.4.6: Strong Converse for the State Dependent Channel Yasutada Oohama, University of Electro-Communications, Japan
Attend S.5: Error Exponents
S.5.1: The Asymptotic Generalized Poor-Verdú Bound Achieves the BSC Error Exponent at Zero Rate Ling-Hua Chang, Yuan-Ze University, Taiwan; Po-Ning Chen, Chiao Tung University, Taiwan; Fady Alajaji, Queen's university, Canada; Yunghsiang S. Han, Dongguan University of Technology, China
S.5.2: Proof of Convergence for Correct-Decoding Exponent Computation Sergey Tridenski, Anelia Somekh-Baruch, Bar-Ilan University, Israel; Ram Zamir, Tel-Aviv University, Israel
S.5.3: Revisiting Zero-Rate Bounds on the Reliability Function of Discrete Memoryless Channels Marco Bondaschi, Marco Dalai, University of Brescia, Italy
S.5.4: Refined Strong Converse for the Constant Composition Codes Hao-Chung Cheng, University of Cambridge, United Kingdom; Barış Nakiboğlu, Middle East Technical University, Turkey
S.5.5: Variable-Length Source Dispersions Differ under Maximum and Average Error Criteria Yuta Sakai, Vincent Y. F. Tan, National University of Singapore, Singapore
Attend S.6: Finite-blocklength Analysis
S.6.1: Finite-Blocklength Performance of Sequential Transmission over BSC with Noiseless Feedback Hengjie Yang, Richard D. Wesel, University of California, Los Angeles, United States
S.6.2: Resolution Limits of Non-Adaptive Querying for Noisy 20 Questions Estimation Lin Zhou, Alfred Hero, University of Michigan, Ann Arbor, United States
S.6.3: Low Complexity Algorithms for Transmission of Short Blocks over the BSC with Full Feedback Amaael Antonini, Hengjie Yang, Richard D. Wesel, University of California, Los Angeles, United States
S.6.4: Lossless Data Compression with Side Information: Nonasymptotics and Dispersion Lampros Gavalakis, Ioannis Kontoyiannis, University of Cambridge, United Kingdom
Attend S.7: Guessing
S.7.1: Noisy Guesses Neri Merhav, Technion - Israel Institute of Technology, Israel
S.7.2: Gray-Wyner and Slepian-Wolf Guessing Robert Graczyk, Amos Lapidoth, ETH Zurich, Switzerland
S.7.3: Cost of Guessing: Applications to Data Repair Suayb Sefik Arslan, MEF University, Turkey; Elif Haytaoglu, Pamukkale University, Turkey
Attend S.8: Information Inequalities
S.8.1: Constrained Functional Value under General Convexity Conditions with Applications to Distributed Simulation Yanjun Han, Stanford University, United States
S.8.2: The Courtade-Kumar Most Informative Boolean Function Conjecture and a Symmetrized Li-Médard Conjecture are Equivalent Leighton Pate Barnes, Ayfer Ozgur, Stanford University, United States
S.8.3: Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover Yikun Bai, Xiugang Wu, University of Delaware, United States; Ayfer Ozgur, Stanford University, United States
Attend S.9: Information Measures I
S.9.1: On Nonparametric Estimation of the Fisher Information Wei Cao, University of Electronic Science and Technology of China, China; Alex Dytso, Michael Fauss, H. Vincent Poor, Princeton University, United States; Gang Feng, University of Electronic Science and Technology of China, China
S.9.2: Strong Asymptotic Composition Theorems for Sibson Mutual Information Benjamin Huang Wu, Aaron B. Wagner, G. Edward Suh, Cornell University, United States; Ibrahim Issa, American University of Beirut, Lebanon
S.9.3: On the Trackability of Stochastic Processes Based on Causal Information Baran Tan Bacinoglu, Middle East Technical University, Turkey; Yin Sun, Auburn University, United States; Elif Uysal, Middle East Technical University, United States
S.9.4: Approximate Gács-Körner Common Information Salman Salamatian, MIT, United States; Asaf Cohen, Ben Gurion University of the Negev, Israel; Muriel Médard, MIT, United States
S.9.5: On the Compressibility of Affinely Singular Random Vectors Mohammad-Amin Charusaie, Sharif University of Technology, Iran; Stefano Rini, National Chiao Tung University, Taiwan; Arash Amini, Sharif University of Technology, Iran
Attend S.10: Information Measures II
S.10.1: Continuity of Generalized Entropy Aolin Xu, ., United States
S.10.2: A Local Characterization for Wyner Common Information Shao-Lun Huang, Tsinghua-Berkeley Shenzhen Institute, China; Xiangxiang Xu, Tsinghua University, China; Lizhong Zheng, Gregory W. Wornell, Massachusetts Institute of Technology, United States
S.10.3: Usable deviation bounds for the information content of convex measures Matthieu Fradelizi, Université Paris-Est, France; Jiange Li, Mokshay Madiman, University of Delaware, United States
S.10.4: Complexity of Estimating Renyi Entropy of Markov Chains Maciej Skorski, University of Luxembourg, Luxembourg; Maciej Obremski, National University of Singapore, Singapore
S.10.5: A Tight Uniform Continuity Bound for Equivocation Mohammad A. Alhejji, Graeme Smith, University of Colorado at Boulder/JILA/NIST, United States
Attend S.11: Renyi Entropy
S.11.1: Rényi Divergence rates of Ergodic Markov Chains: existence, explicit expressions and properties Valérie Girardin, Laboratoire de Mathématiques Nicolas Oresme, France; Philippe Regnault, Laboratoire de Mathématiques de Reims, France
S.11.2: On the Second- and Third-Order Asymptotics of Smooth Rényi Entropy and Their Applications Yuta Sakai, Vincent Y. F. Tan, National University of Singapore, Singapore
S.11.3: Optimum Source Resolvability Rate with Respect to f-Divergences Using the Smooth Renyi Entropy Ryo Nomura, Waseda University, Japan; Hideki Yagi, The University of Electro-Communications, Japan
S.11.4: On the Rényi Entropy of Log-Concave Sequences James Melbourne, University of Minnesota, United States; Tomasz Tkocz, Carnegie Mellon University, United States
S.11.5: Rényi Bounds on Information Combining Christoph Hirche, University of Copenhagen, Denmark
S.11.6: Explicit Renyi Entropy for Hidden Markov Models Joachim Breitner, University of Pennsylvania, United States; Maciej Skorski, University of Luxembourg, Luxembourg
Attend S.12: Second-order Analysis
S.12.1: Lossy coding of a time-limited piece of a band-limited white Gaussian source Youssef Jaffal, Ibrahim Abou-Faycal, American University of Beirut, Lebanon
S.12.2: A High-SNR Normal Approximation for MIMO Rayleigh Block-Fading Channels Chao Qi, Tobias Koch, Universidad Carlos III de Madrid, Spain
S.12.3: Registration of Finite Resolution Images: a Second-order Analysis Ravi Kiran Raman, Analog Devices Inc., United States; Lav Varshney, University of Illinois, Urbana-Champaign, United States
S.12.4: Second-Order Achievable Rates for a Block Fading Gaussian Multiple Access Channel Deekshith P K, Vinod Sharma, Indian Institute of Science, India
Attend S.13: Topics in Shannon Theory
S.13.1: Isomorphism Problem Revisited: Information Spectrum Approach Shun Watanabe, Tokyo University of Agriculture and Technology, Japan; Te Sun Han, National Institute of Information and Communications Technology, Japan
S.13.2: Empirical Properties of Good Channel Codes Qinghua (Devon) Ding, Sidharth Jaggi, Chinese University of Hong Kong, China; Shashank Vatedka, Indian Institute of Technology Hyderabad, India; Yihan Zhang, Chinese University of Hong Kong, China
S.13.3: Exact Expressions in Source and Channel Coding Problems Using Integral Representations Neri Merhav, Igal Sason, Technion - Israel Institute of Technology, Israel

Source Coding
Attend O.1: Data Compression
O.1.1: A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs Payam Delgosha, Venkat Anantharam, UC Berkeley, United States
O.1.2: On a Redundancy of AIFV-m Codes for m = 3, 5 Ryusei Fujita, Ken-ichi Iwata, University of Fukui, Japan; Hirosuke Yamamoto, The University of Tokyo, Japan
O.1.3: A Universal Data Compression Scheme based on the AIVF Coding Techniques Hirosuke Yamamoto, The University of Tokyo, Japan; Koki Imaeda, Kengo Hashimoto, Ken-ichi Iwata, Fukui University, Japan
O.1.4: On D-ary Fano Codes Ferdinando Cicalese, Eros Rossi, University of Verona, Italy
O.1.5: $O(\log \log n)$ Worst-Case Local Decoding and Update Efficiency for Data Compression Shashank Vatedka, Indian Institute of Technology Hyderabad, India; Venkat Chandar, DE Shaw, United States; Aslan Tchamkerten, Telecom Paris, France
O.1.6: Data Deduplication with Random Substitutions Hao Lou, Farzad Farnoud, University of Virginia, United States
Attend O.2: Lossy Source Coding
O.2.1: An Alphabet-Size Bound for the Information Bottleneck Function Christoph Hirche, University of Copenhagen, Denmark; Andreas Winter, Universitat Autonoma de Barcelona, Spain
O.2.2: One shot approach to lossy source coding under average distortion constraints Nir Elkayam, Meir Feder, Tel Aviv University, Israel
O.2.3: Asymptotically Scale-invariant Multi-resolution Quantization Cheuk Ting Li, The Chinese University of Hong Kong, China
O.2.4: Discrete Optimal Reconstruction Distributions for Itakura-Saito Distortion Measure Kazuho Watanabe, Toyohashi University of Technology, Japan
Attend O.3: Multi-terminal Source Coding I
O.3.1: Scalable source coding with causal side information and a causal helper Shraga I. Bross, Bar-Ilan University, Israel
O.3.2: Improved Achievable Regions in Networked Scalable Coding Problems Emrah Akyol, Binghamton University, United States; Urbashi Mitra, University of Southern California, United States; Ertem Tuncel, UC Riverside, United States; Kenneth Rose, UC Santa Barbara, United States
O.3.3: On optimal weighted-sum rates for the modulo sum problem Chandra Nair, Yannan Wang, The Chinese University of Hong Kong, China
O.3.4: Some Results on the Vector Gaussian Hypothesis Testing Problem Pierre Escamilla, None, France; Abdellatif Zaidi, Huawei Technologies, France; Michèle Wigger, Télécom-Paristech, France
Attend O.4: Multi-terminal Source Coding II
O.4.1: Hypergraph-based Coding Schemes for Two Source Coding Problems under Maximal Distortion Sourya Basu, University of Illinois at Urbana-Champaign, United States; Daewon Seo, University of Wisconsin–Madison, United States; Lav Varshney, University of Illinois at Urbana-Champaign, United States
O.4.2: Gaussian Multiterminal Source-Coding with Markovity: An Efficiently-Computable Outer Bound Omer Bilgen, Aaron B. Wagner, Cornell University, United States
O.4.3: Fundamental limits of distributed tracking Victoria Kostina, Babak Hassibi, Caltech, United States
O.4.4: Characterization of Conditional Independence and Weak Realizations of Multivariate Gaussian Random Variables: Applications to Networks Charalambos D. Charalambous, University of Cyprus, Cyprus; Jan H. van Schuppen, Van Schuppen Control Research, Netherlands
Attend O.5: Topics in Source Coding
O.5.1: On Effective Stochastic Mechanisms for On-The-Fly Codebook Regeneration Ahmed Elshafiy, Mahmoud Namazi, Kenneth Rose, University of California, Santa Barbara, United States
O.5.2: Optimal Causal Rate-Constrained Sampling for a Class of Continuous Markov Processes Nian Guo, Victoria Kostina, California Institute of Technology, United States
O.5.3: Tracking an Auto-Regressive Process with Limited Communication Rooji Jinan, Parimal Parag, Himanshu Tyagi, Indian Institute of Science, Bengaluru, India
O.5.4: Adaptive Coding for Two-Way Lossy Source-Channel Communication Jian-Jia Weng, Fady Alajaji, Tamás Linder, Queen's University, Canada
O.5.5: Robust Gaussian Joint Source-Channel Coding Under the Near-Zero Bandwidth Regime Mohammadamin Baniasadi, Ertem Tuncel, UC Riverside, United States

Statistics and Learning Theory
Attend L.1: Application-Specific Learning
L.1.1: Achievability Bounds for Community Detection and Matrix Completion with Two-Sided Graph Side-Information Qiaosheng Zhang, Vincent Y. F. Tan, National University of Singapore, Singapore; Changho Suh, Korea Advanced Institute of Science and Technology, Korea (South)
L.1.2: Provable Efficient Skeleton Learning of Encodable Discrete Bayes Nets in Poly-Time and Sample Complexity Adarsh Barik, Jean Honorio, Purdue University, United States
L.1.3: Optimal Learning of Joint Alignments with a Faulty Oracle Kasper Green Larsen, Aarhus university, Denmark; Michael Mitzenmacher, Harvard university, United States; Charalampos Tsourakakis, Boston University, United States
L.1.4: An Efficient Neural Network Architecture for Rate Maximization in Energy Harvesting Downlink Channels Heasung Kim, Taehyun Cho, Jungwoo Lee, Seoul National University, Korea (South); Wonjae Shin, Pusan National University, Korea (South); Harold Vincent Poor, Princeton University, United States
L.1.5: Online Memorization of Random Firing Sequences by a Recurrent Neural Network Patrick Murer, Hans-Andrea Loeliger, ETH Zurich, Switzerland
Attend L.2: Classification
L.2.1: Evaluation of Error Probability of Classification Based on the Analysis of the Bayes Code Shota Saito, Toshiyasu Matsushima, Waseda University, Japan
L.2.2: Optimality of Least-squares for Classification in Gaussian-Mixture Models Hossein Taheri, Ramtin Pedarsani, Christos Thrampoulidis, University of California, Santa Barbara, United States
L.2.3: A Fair Classifier Using Mutual Information Jaewoong Cho, Gyeongjo Hwang, Changho Suh, KAIST, Korea (South)
L.2.4: Analytic Study of Double Descent in Binary Classification: The Impact of Loss Ganesh Ramachandra Kini, Christos Thrampoulidis, University of California, Santa Barbara, United States
L.2.5: On Binary Statistical Classification from Mismatched Empirically Observed Statistics Hung-Wei Hsu, I-Hsiang Wang, National Taiwan University, Taipei, Taiwan, Taiwan
Attend L.3: Distributed Learning Performance Analysis
L.3.1: Communication Efficient Distributed Approximate Newton Method Avishek Ghosh, University of California, Berkeley, United States; Raj Kumar Maity, Arya Mazumdar, University of Massachusetts, Amherst, United States; Kannan Ramachandran, University of California, Berkeley, United States
L.3.2: Communication Efficient and Byzantine Tolerant Distributed Learning Avishek Ghosh, University of California, Berkeley, United States; Raj Kumar Maity, University of Massachusetts, Amherst, United States; Swanand Kadhe, University of California, Berkeley, United States; Arya Mazumdar, University of Massachusetts, Amherst, United States; Kannan Ramchandran, University of California, Berkeley, United States
L.3.3: Crowdsourced Classification with XOR Queries: An Algorithm with Optimal Sample Complexity Daesung Kim, Hye Won Chung, KAIST, Korea (South)
L.3.4: Reliable Distributed Clustering with Redundant Data Assignment Venkata Gandikota, Arya Mazumdar, University of Massachusetts Amherst, United States; Ankit Singh Rawat, Google Research, United States
Attend L.4: Distribution Learning
L.4.1: Analysis of K Nearest Neighbor KL Divergence Estimation for Continuous Distributions Puning Zhao, Lifeng Lai, University of California Davis, United States
L.4.2: Entropy property testing with finitely many errors Changlong Wu, Narayana Santhanam, University of Hawaii at Manoa, United States
L.4.3: On Learning Parametric Non-Smooth Continuous Distributions Sudeep Kamath, PDT Partners, United States; Alon Orlitsky, University of California San Diego, United States; Venkatadheeraj Pichapati, Apple Inc., United States; Ehsan Zobeidi, University of California San Diego, United States
L.4.4: Latent Factor Analysis of Gaussian Distributions under Graphical Constraints Md Mahmudul Hasan, Shuangqing Wei, Ali Moharrer, Louisiana State University, United States
L.4.5: Learning Additive Noise Channels: Generalization Bounds and Algorithms Nir Weinberger, Massachusetts Institute of Technology, United States
Attend L.5: Federated Learning
L.5.1: Federated Recommendation System via Differential Privacy Tan Li, Linqi Song, City University of Hong Kong, China; Christina Fragouli, University of California, Los Angeles, United States
L.5.2: Update Aware Device Scheduling for Federated Learning at the Wireless Edge Mohammad Mohammadi Amiri, Princeton University, United States; Deniz Gunduz, Imperial College London, United Kingdom; Sanjeev R. Kulkarni, H. Vincent Poor, Princeton University, United States
L.5.3: Wireless Federated Learning with Local Differential Privacy Mohamed Seif, Ravi Tandon, Ming Li, University of Arizona, United States
L.5.4: The Communication-Aware Clustered Federated Learning Problem Nir Shlezinger, Weizmann Institute of Science, Israel; Stefano Rini, National Chiao Tung University, Taiwan; Yonina Eldar, Weizmann Institute of Science, Israel
Attend L.6: Gradient-Based Distributed Learning
L.6.1: Hierarchical Coded Gradient Aggregation for Learning at the Edge Saurav Prakash, University of Southern California, United States; Amirhossein Reisizadeh, Ramtin Pedarsani, UC Santa Barbara, United States; Amir Salman Avestimehr, University of Southern California, United States
L.6.2: Numerically Stable Binary Gradient Coding Neophytos Charalambides, Hessam Mahdavifar, Alfred Hero, University of Michigan, United States
L.6.3: On Byzantine-Resilient High-Dimensional Stochastic Gradient Descent Deepesh Data, Suhas Diggavi, University of California, Los Angeles, United States
L.6.4: Communication-Efficient Gradient Coding for Straggler Mitigation in Distributed Learning Swanand Kadhe, O. Ozan Koyluoglu, Kannan Ramchandran, University of California Berkeley, United States
Attend L.7: High-dimensional Statistics
L.7.1: Limit Distribution for Smooth Total Variation and 𝛘²-Divergence in High Dimensions Ziv Goldfeld, Kengo Kato, Cornell University, United States
L.7.2: High-dimensional rank-one nonsymmetric matrix decomposition: the spherical case Clément Luneau, Nicolas Macris, EPFL, Switzerland; Jean Barbier, ICTP, Italy
L.7.3: Multi-Product Dynamic Pricing in High-Dimensions with Heterogeneous Price Sensitivity Adel Javanmard, Hamid Nazerzadeh, Simeng Shao, University of Southern California, United States
L.7.4: Limits on Gradient Compression for Stochastic Optimization Prathamesh Mayekar, Himanshu Tyagi, Indian Institute of Science, India
Attend L.8: Learning and Message-Passing
L.8.1: The Power of Graph Convolutional Networks to Distinguish Random Graph Models Abram Magner, University at Albany, State University of New York, United States; Mayank Baranwal, Alfred O. Hero, University of Michigan, United States
L.8.2: Exponentially Fast Concentration of Vector Approximate Message Passing to its State Evolution Collin Cademartori, Cynthia Rush, Columbia University, United States
L.8.3: Online Message Passing-based Inference in the Hierarchical Gaussian Filter Ismail Senoz, Bert de Vries, Eindhoven University of Technology, Netherlands
L.8.4: Data-Driven Factor Graphs for Deep Symbol Detection Nir Shlezinger, Weizmann Institute of Science, Israel; Nariman Farsad, Stanford, United States; Yonina Eldar, Weizmann Institute of Science, Israel; Andrea Goldsmith, Stanford, United States
Attend L.9: Learning Methods and Networks
L.9.1: CodNN – Robust Neural Networks From Coded Classification Netanel Raviv, Washington University in Saint Louis, United States; Siddharth Jain, California Institute of Technology, United States; Pulakesh Upadhyaya, Texas A&M University, United States; Jehoshua Bruck, California Institute of Technology, United States; Anxiao Jiang, Texas A&M University, United States
L.9.2: Functional Error Correction for Reliable Neural Networks Kunping Huang, Texas A&M University, United States; Paul H. Siegel, University of California, San Diego, United States; Anxiao Jiang, Texas A&M University, United States
L.9.3: On the alpha-loss Landscape in the Logistic Model Tyler Sypherd, Arizona State University, United States; Mario Diaz, Universidad Nacional Autónoma de México, Mexico; Lalitha Sankar, Gautam Dasarathy, Arizona State University, United States
L.9.4: Max-affine Regression with Universal Parameter Estimation for Small-ball Designs Avishek Ghosh, Ashwin Pananjady, Kannan Ramchandran, Aditya Guntuboyina, University of California, Berkeley, United States
L.9.5: Model Projection: Theory and Applications to Fair Machine Learning Wael Alghamdi, Shahab Asoodeh, Hao Wang, Flavio P. Calmon, Harvard University, United States; Dennis Wei, Karthikeyan Natesan Ramamurthy, IBM Research, United States
Attend L.10: Learning Theory I
L.10.1: On Estimation of Modal Decompositions Anuran Makur, Gregory W. Wornell, Lizhong Zheng, Massachusetts Institute of Technology, United States
L.10.2: Robust Generalization via f-Mutual Information Amedeo Roberto Esposito, Michael Gastpar, EPFL, Switzerland; Ibrahim Issa, American University of Beirut, Lebanon
L.10.3: Learning Representations by Maximizing Mutual Information in Variational Autoencoders Ali Lotfi Rezaabad, Sriram Vishwanath, The University of Texas at Austin, United States
L.10.4: Stochastic Bottleneck: Rateless Auto-Encoder for Flexible Dimensionality Reduction Toshiaki Koike-Akino, Ye Wang, Mitsubishi Electric Research Laboratories (MERL), United States
L.10.5: Generalization Error Bounds via mth Central Moments of the Information Density Fredrik Hellström, Giuseppe Durisi, Chalmers University of Technology, Sweden
L.10.6: Exploring Unique Relevance for Mutual Information based Feature Selection Shiyu Liu, Mehul Motani, National University of Singapore, Singapore
Attend L.11: Learning Theory II
L.11.1: Clustering piecewise stationary processes Azadeh Khaleghi, Lancaster University, United Kingdom; Daniil Ryabko, Fishlife Research, France
L.11.2: On Top-k Selection from m-wise Partial Rankings via Borda Counting Wenjing Chen, Ruida Zhou, Chao Tian, Texas A&M University, United States; Cong Shen, University of Virginia, United States
L.11.3: Polarization in Attraction-Repulsion Models Elisabetta Cornacchia, École Polytechnique Fédérale de Lausanne, Switzerland; Neta Singer, Columbia University, United States; Emmanuel Abbe, École Polytechnique Fédérale de Lausanne, Switzerland
L.11.4: Information-theoretic limits of a multiview low-rank symmetric spiked matrix model Jean Barbier, The Abdus Salam International Center for Theoretical Physics, Italy; Galen Reeves, Duke University, United States
Attend L.12: Multi-Arm Bandits
L.12.1: A Hoeffding Inequality For Finite State Markov Chains and its Applications to Markovian Bandits Vrettos Moulos, University of California Berkeley, United States
L.12.2: An Improved Regret Bound for Thompson Sampling in the Gaussian Linear Bandit Setting Cem Kalkanli, Ayfer Ozgur, Stanford University, United States
L.12.3: Learned Scheduling of LDPC Decoders Based on Multi-armed Bandits Salman Habib, Allison Beemer, Joerg Kliewer, New Jersey Institute of Tech, United States
L.12.4: Detecting an Odd Restless Markov Arm with a Trembling Hand PN Karthik, Rajesh Sundaresan, Indian Institute of Science, India
Attend L.13: Online, Active, and Transfer Learning
L.13.1: Active Learning for Classification with Abstention Shubhanshu Shekhar, University of California, San Diego, United States; Mohammad Ghavamzadeh, Facebook AI Research, United States; Tara Javidi, University of California, San Diego, United States
L.13.2: Rényi Entropy Bounds on the Active Learning Cost-Performance Tradeoff Vahid Jamali, University of Erlangen-Nuremberg, Germany, Germany; Antonia Tulino, University of Napoli Federico II, Italy, Italy; Jaime Llorca, Elza Erkip, New York University, New York, United States
L.13.3: An Efficient Running Quantile Estimation Technique alongside Correntropy for Outlier Rejection in Online Regression Sajjad Bahrami, Ertem Tuncel, University of California, Riverside, United States
L.13.4: Information-theoretic analysis for transfer learning Xuetong Wu, Jonathan Manton, Uwe Aickelin, Jingge Zhu, University of Melbourne, Australia
L.13.5: What is the Value of Data? on Mathematical Methods for Data Quality Estimation Netanel Raviv, Washington University in Saint Louis, United States; Siddharth Jain, Jehoshua Bruck, California Institute of Technology, United States

Topics in Information Theory
Attend T.1: Complexity and Computation Theory
T.1.1: On the Exact Lower Bounds of Encoding Circuit Sizes of Hamming Codes and Hadamard Codes Zhengrui Li, Sian-Jheng Lin, University of Science and Technology of China~(USTC), China; Yunghsiang S. Han, Dongguan University of Technology, China
T.1.2: Computing the Partition Function of the Sherrington-Kirkpatrick Model is Hard on Average David Gamarnik, Eren C. Kizildag, MIT, United States
T.1.3: Interactive Verifiable Polynomial Evaluation Saeid Sahraei, Qualcomm Technologies, Inc., United States; Mohammad Ali Maddah-Ali, Nokia Bell Labs, United States; Salman Avestimehr, University of Southern California, United States
Attend T.2: Information and Control
T.2.1: Learning a Neural-Network Controller for a Multiplicative Observation Noise System Vignesh Subramanian, Moses Won, Gireeja Ranade, UC Berkeley, United States
T.2.2: Stabilizing Dynamical Systems with Fixed-Rate Feedback using Constrained Quantizers Oron Sabag, Victoria Kostina, Babak Hassibi, Caltech, United States
T.2.3: Distributed State Estimation with Bounded Errors over Multiple Access Channels Ghassen Zafzouf, Girish N. Nair, University of Melbourne, Australia
T.2.4: Structural Properties of Nonanticipatory Epsilon Entropy of Multivariate Gaussian Sources Charalambos D. Charalambous, University of Cyprus, Cyprus; Themistoklis Charalambous, Aalto University, Finland; Christos Kourtellaris, University of Cyprus, Cyprus; Jan H. van Schuppen, Van Schuppen Control Research, Netherlands
Attend T.3: Information Theory and Biology
T.3.1: Poisson channel with binary Markov input and average sojourn time constraint Mark Sinzger, Maximilian Gehri, Heinz Koeppl, Technische Universität Darmstadt, Germany
T.3.2: How else can we define Information Flow in Neural Circuits? Praveen Venkatesh, Sanghamitra Dutta, Pulkit Grover, Carnegie Mellon University, United States
T.3.3: Coding for Efficient DNA Synthesis Andreas Lenz, Technical University of Munich, Germany; Yi Liu, Cyrus Rashtchian, Paul Siegel, University of California, San Diego, United States; Antonia Wachter-Zeh, Technical University of Munich, Germany; Eitan Yaakobi, Technion - Israel Institute of Technology, Israel
T.3.4: Bee-Identification Error Exponent with Absentee Bees Anshoo Tandon, Vincent Y. F. Tan, National University of Singapore, Singapore; Lav R. Varshney, University of Illinois at Urbana-Champaign, United States
Attend T.4: Sequences
T.4.1: Efficient Algorithm for the Linear Complexity of Sequences and Some Related Consequences Yeow Meng Chee, National University of Singapore, Singapore; Johan Chrisnata, Nanyang Technological University, Singapore; Tuvi Etzion, Technion - Israel Institute of Technology, Israel; Han Mao Kiah, Nanyang Technological University, Singapore
T.4.2: Duplication with transposition distance to the root for q-ary strings Nikita Polyanskii, Technical University of Munich, Germany; Ilya Vorobyev, Skolkovo Institute of Science and Technology, Russia
T.4.3: The Numbers of De Bruijn Sequences in Extremal Weight Classes Ming Li, Yupeng Jiang, Dongdai Lin, State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, China
T.4.4: On the 2-Adic Complexity of A Class of Binary Sequences of Period 4p with Optimal Autocorrelation Magnitude Minghui Yang, Lulu Zhang, Chinese Academy of Sciences，Institute of Information Engineering, China; Keqin Feng, Tsinghua University, China
T.4.5: New Optimal Sets of Perfect Polyphase Sequences Based on Circular Florentine Arrays Dan Zhang, Tor Helleseth, University of Bergen, Norway
T.4.6: Cross Z-Complementary Pairs (CZCPs) for Optimal Training in Broadband Spatial Modulation Systems Zilong Liu, University of Essex, United Kingdom; Ping Yang, University of Electronic Science and Technology of China, China; Yong Liang Guan, Nanyang Technological University, Singapore; Pei Xiao, University of Surrey, United Kingdom
T.4.7: Constructions of Two-Dimensional Golay Complementary Array Pairs Based on Generalized Boolean Functions Cheng-Yu Pai, Chao-Yu Chen, National Cheng Kung University, Taiwan

Wireless Communications
Attend W.1: Cellular Networks
W.1.1: Optimality of Treating Inter-Cell Interference as Noise Under Finite Precision CSIT Hamdi Joudeh, Giuseppe Caire, Technische Universität Berlin, Germany
W.1.2: Channel Models, Favorable Propagation and Multi-Stage Linear Detection in Cell-Free Massive MIMO Roya Gholami, Eurecom, France; Laura Cottatellucci, Friedrich Alexander University of Erlangen Nuremberg (FAU), Germany; Dirk Slock, Eurecom, France
W.1.3: Approaching Capacity Without Pilots via Nonlinear Processing at the Edge Guido Carlo Ferrante, Ericsson Research, Sweden
W.1.4: On Optimal Multi-user Beam Alignment in Millimeter Wave Wireless Systems Abbas Khalili, New York University, United States; Shahram Shahsavari, University of Waterloo, Canada; Mohammad Khojastepour, NEC Laboratories America, United States; Elza Erkip, New York University, United States
W.1.5: Bursty Wireless Networks of Bounded Capacity Grace Villacrés Estrada, Tobias Koch, Gonzalo Vazquez-Vilar, Universidad Carlos III de Madrid, Spain
Attend W.2: Intelligent Surface
W.2.1: Beyond Max-SNR: Joint Encoding for Reconfigurable Intelligent Surfaces Roy Karasik, Technion, Israel; Osvaldo Simeone, King’s College London, United Kingdom; Marco Di Renzo, CentraleSupélec, France; Shlomo Shamai (Shitz), Technion, Israel
W.2.2: Reconfigurable Surface Assisted Multi-User Opportunistic Beamforming Qurrat-Ul-Ain Nadeem, Anas Chaaban, University of British Columbia, Canada; Merouane Debbah, CentraleSupelec and Huawei France R&D, France
W.2.3: On the Capacity of Intelligent Reflecting Surface Aided MIMO Communication Shuowen Zhang, Rui Zhang, National University of Singapore, Singapore
W.2.4: Message-Passing Based Channel Estimation for Reconfigurable Intelligent Surface Assisted MIMO Hang Liu, The Chinese University of Hong Kong, China; Xiaojun Yuan, University of Electronic Science and Technology of China, China; Ying-Jun Angela Zhang, The Chinese University of Hong Kong, China
Attend W.3: Random Access I
W.3.1: Minimum Feedback for Collision-Free Scheduling in Massive Random Access Justin Singh Kang, Wei Yu, University of Toronto, Canada
W.3.2: On Approximate Message Passing for Unsourced Access with Coded Compressed Sensing Vamsi Amalladinne, Asit Kumar Pradhan, Texas A&M University, College Station, United States; Cynthia Rush, Columbia University, United States; Jean-Francois Chamberland, Krishna Narayanan, Texas A&M University, College Station, United States
W.3.3: Unsourced Multiuser Sparse Regression Codes achieve the Symmetric MAC Capacity Alexander Fengler, Peter Jung, Giuseppe Caire, TU Berlin, Germany
W.3.4: Interleaved Block Coding for Achieving Gaussian Random Access Channel Capacity Tugcan Aktas, Qualcomm Technologies, Inc., United States; Pinar Sen, University of California, San Diego, United States
Attend W.4: Random Access II
W.4.1: Gaussian Multiple and Random Access in the Finite Blocklength Regime Recep Can Yavas, Victoria Kostina, Michelle Effros, California Institute of Technology, United States
W.4.2: A Polar Code Based TIN-SIC Scheme for the Unsourced Random Access in the Quasi-Static Fading MAC Kirill Andreev, Evgeny Marshakov, Alexey Frolov, Skolkovo Institute of Science and Technology, Russia
W.4.3: Capacity per Unit-Energy of Gaussian Random Many-Access Channels Jithin Ravi, Tobias Koch, Universidad Carlos III de Madrid, Spain
W.4.4: Online Estimation and Adaptation for Random Access with Successive Interference Cancellation Sang-Woon Jeon, Hu Jin, Hanyang University, Korea (South)
Attend W.5: Wireless Communications
W.5.1: On The Capacity of Gaussian MIMO Channels Under Interference Constraints Sergey Loyka, University of Ottawa, Canada
W.5.2: Bounding the Achievable Region of Sparse NOMA Benjamin M. Zaidel, Bar-Ilan University, Israel; Ori Shental, Bell Labs, United States; Shlomo Shamai (Shitz), Technion, Israel
W.5.3: Resource Allocation in Low Density Spreading Uplink NOMA via Asymptotic Analysis Hossein Asgharimoghaddam, Antti Tölli, University of Oulu, Finland
W.5.4: Rate–Diversity Optimal Multiblock Space–Time Codes via Sum-Rank Codes Mohannad Shehadeh, Frank R. Kschischang, University of Toronto, Canada
W.5.5: On MIMO Gaussian Wiretap Channels with Optimal Energy Harvesting Nima Tavangaran, Princeton University, United States; Mojtaba Vaezi, Villanova University, United States; H. Vincent Poor, Princeton University, United States
W.5.6: Information-Energy Capacity Region for SWIPT Systems with Power Amplifier Nonlinearity Ioannis Krikidis, University of Cyprus, Cyprus

Technical Program

Alternative Views

Complete Proceedings

Algebraic and Combinatorial Coding Theory

A.1: Algebraic Coding Theory I

A.2: Algebraic Coding Theory II

A.3: Combinatorics and Information Theory

A.4: Combinatorial Coding Theory I

A.5: Combinatorial Coding Theory II

Coded and Distributed Computation

D.1: Coded Computation

D.2: Coding for Specialized Computations

D.3: Distributed Matrix Multiplication

Coding for Communications

C.1: Coding for Communications I

C.2: Coding for Communications II

C.3: Iterative Decoding

C.4: LDPC Codes

C.5: List Decoding

C.6: Polar Codes I

C.7: Polar Codes II

C.8: Spatially Coupled Codes

C.9: Streaming Codes

C.10: Topics in Coding Theory

Coding for Storage and Memories

M.1: Codes for Distributed Storage I

M.2: Codes for Distributed Storage II

M.3: Codes for Distributed Storage III

M.4: Codes for Distributed Storage IV

M.5: Coding for Storage and Memories I

M.6: Coding for Storage and Memories II

M.7: Insertion Deletion Substitution Codes I

M.8: Insertion Deletion Substitution Codes II

M.9: Topics in Coding for Storage and Memories

Cryptography, Security and Privacy

P.1: Covert Communications

P.2: Cryptography

P.3: Information Privacy I

P.4: Information Privacy II

P.5: Information Theoretic Security I

P.6: Information Theoretic Security II

P.7: Information Theoretic Security III

P.8: Private Information Retrieval I

P.9: Private Information Retrieval II

P.10: Private Information Retrieval III

P.11: Topics in Privacy and Cryptography

Detection and Estimation

E.1: Detection Theory

E.2: Detection and Applications

E.3: Estimation Theory

E.4: Estimation and Applications

E.5: Hypothesis Testing I

E.6: Hypothesis Testing II

Graphs, Games, Sparsity, and Signal Processing

G.1: Graph Analytics

G.2: Game Theory

G.3: Compressed Sensing

G.4: Group Testing and Sparse Codes

G.5: Signal Processing

Industry Track

IND-1: 5G and Its Evolution Towards 6G

IND-2: Distributed Learning over Wireless Edge

IND-3: Finite Block Length Information Theory: Application to 5G System Design

IND-4: Selected Topics on Deep-Learning Based Communication System Design

Network Information Theory

I.1: Broadcast Channel I

I.2: Broadcast Channel II

I.3: Interference Channel I

I.4: Interference Channel II

I.5: Network Information Theory

I.6: Relay Channel

Networking and Network Coding

N.1: Network Coding I

N.2: Network Coding II

N.3: Coded Caching I

N.4: Coded Caching II

N.5: Index Coding

N.6: Age of Information I

N.7: Age of Information II

N.8: Timely Updates