Sat, 6 Jul, 14:00 - 19:00
Sun, 7 Jul, 07:45 - 17:15
Sun, 7 Jul, 08:00 - 08:30
Coffee Break (Tutorial and Workshop attendees only)
Sun, 7 Jul, 08:30 - 17:15
Sun, 7 Jul, 08:30 - 10:00
Sun, 7 Jul, 10:00 - 10:30
Sun, 7 Jul, 10:30 - 12:00
Sun, 7 Jul, 12:00 - 13:30
Sun, 7 Jul, 12:15 - 13:15
Sun, 7 Jul, 13:30 - 15:00
Sun, 7 Jul, 15:00 - 15:30
Sun, 7 Jul, 15:30 - 17:00
Sun, 7 Jul, 17:15 - 19:15
Workshops & Tutorials Reception
Level -2 Lobby
Mon, 8 Jul, 08:00 - 12:00
Mon, 8 Jul, 08:15 - 17:15
Mon, 8 Jul, 08:30 - 09:55
Mon, 8 Jul, 09:55 - 10:05
Mon, 8 Jul, 10:05 - 11:25
Ballroom II & III
MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes
Guodong Li, Ningning Wang, Sihuang Hu, Shandong University, China; Min Ye, na, China
An entropic inequality in finite Abelian groups analogous to the unified Brascamp-Lieb and Entropy Power Inequality
Chin Wa (Ken) Lau, Chandra NAIR, The Chinese University of Hong Kong, Hong Kong SAR of China
Neural Network Equalizers and Successive Interference Cancellation for Bandlimited Channels with a Nonlinearity
Daniel Plabst, Tobias Prinz, Francesca Diedolo, Thomas Wiegart, Technical University of Munich, Germany; Georg Böcherer, Huawei Technologies Düsseldorf GmbH, Germany; Norbert Hanik, Gerhard Kramer, Technical University of Munich, Germany
Ypsilon I-II-III
Towards General Function Approximation in Nonstationary Reinforcement Learning
Songtao Feng, University of Florida, United States; Ming Yin, Princeton University, United States; Ruiquan Huang, Pennsylvania State University, United States; Yu-Xiang Wang, UC Santa Barbara, United States; Jing Yang, Pennsylvania State University, United States; Yingbin Liang, Ohio State University, United States
Camouflage Adversarial Attacks on Multiple Agent Systems
Ziqing Lu, University of Iowa, United States; Guanlin Liu, Lifeng Lai, University of California Davis, United States; Weiyu Xu, University of Iowa, United States
Erasure Coded Neural Network Inference via Fisher Averaging
Divyansh Jhunjhunwala, Neharika Jali, Gauri Joshi, Carnegie Mellon University, United States; Shiqiang Wang, IBM, United States
Frequency Domain Diffusion Model with Scale-Dependent Noise Schedule
Amir Ziashahabi, Baturalp Buyukates, University of Southern California, United States; Artan Sheshmani, Massachusetts Institute of Technology, United States; Yi-Zhuang You, University of California San Diego, United States; Salman Avestimehr, University of Southern California, United States
Ypsilon IV-V-VI
Sparsely Pre-transformed Polar Codes for Low-Complexity SCL Decoding
Geon Choi, POSTECH, Korea (South); Namyoon Lee, Korea University, Korea (South)
Approaching Maximum Likelihood Decoding Performance via Reshuffling ORBGRAND
Li Wan, Wenyi Zhang, University of Science and Technology of China, China
Improved Construction of Robust Gray Codes
Dorsa Fathollahi, Mary Wootters, Stanford University, United States
Permutation Codes in Levenshtein, Ulam and Generalized Kendall-tau Metrics
Shuche Wang, Yeow Meng Chee, Van Khu Vu, National University of Singapore, Singapore
Omikron II
AIFV Codes Allowing 2-bit Decoding Delays for Unequal Bit Cost
Ken-ichi Iwata, Kengo Hashimoto, Takahiro Wakayama, University of Fukui, Japan; Hirosuke Yamamoto, The University of Tokyo, Japan
An Asymmetric Encoding-Decoding Scheme for Lossless Data Compression
Hirosuke Yamamoto, The University of Tokyo, Japan; Ken-ichi Iwata, University of Fukui, Japan
Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
Mordecai Golin, UMass Amherst, United States; Reza Hosseini Dolatabadi, Arian Zamani, Sharif University of Technology, Iran
A (Weakly) Polynomial Algorithm for AIVF Coding
Reza Hosseini Dolatabadi, Sharif University of Technology, Iran; Mordecai Golin, UMass Amherst, United States; Arian Zamani, Sharif University of Technology, Iran
Omikron I
A Third Information-Theoretic Approach to Finite de Finetti Theorems
Mario Berta, RWTH Aachen, Germany; Lampros Gavalakis, Gustave Eiffel University, France; Ioannis Kontoyiannis, University of Cambridge, United Kingdom
An extension of Mcdiarmid's inequality
Richard Combes, CentraleSupelec, France
A multi-sequence Prophet Inequality under observation constraints
Aristomenis Tsopelakos, Olgica Milenkovic, University of Illinois at Urbana-Champaign, United States
$L_q$ Lower Bounds on Distributed Estimation via Fisher Information
Wei-Ning Chen, Ayfer Özgür, Stanford University, United States
Sigma/Delta
Coding for Composite DNA to Correct Substitutions, Strand Losses, and Deletions
Frederik Walter, Technical University of Munich, Germany; Omer Sabary, Technion - Israel Institute of Technology, Israel; Antonia Wachter-Zeh, Technical University of Munich, Germany; Eitan Yaakobi, Technion - Israel Institute of Technology, Israel
Correcting a Single Deletion in Reads from a Nanopore Sequencer
Anisha Banerjee, Yonatan Yehezkeally, Antonia Wachter-Zeh, Technical University of Munich, Germany; Eitan Yaakobi, Technion - Israel Institute of Technology, Israel
Error-Correcting Codes for Combinatorial Composite DNA
Omer Sabary, Technion, Israel; Inbal Preuss, Reichman University, Israel; Ryan Gabrys, University of California, San Diego, United States; Zohar Yakhini, Leon Anavy, Reichman University, Israel; Eitan Yaakobi, Technion, Israel
The Capacity of the Weighted Read Channel
Omer Yerushalmi, Tuvi Etzion, Eitan Yaakobi, Technion Israel Institute of Technology, Israel
VIP
On the existence of some completely regular codes in Hamming graphs
Denis Krotov, Sobolev Institute of Mathematics, Russia
Parity-check matrix for Z/p^s-additive codes: efficient computation
Cristina Fernández-Córdoba, Adrián Torres-Martín, Universitat Autònoma de Barcelona, Spain; Carlos Vela, University of Aveiro, Portugal; Mercè Villanueva, Universitat Autònoma de Barcelona, Spain
Explicit Good Codes Approaching Distance 1 in Ulam Metric
Elazar Goldenberg, The Academic College of Tel Aviv-Yaffo, Israel; Mursalin Habib, Karthik C. S., Rutgers University, United States
Near-optimal constructions of constant weight codes and constant composition codes asymptotically attaining the Johnson bound
Miao Liu, Chong Shangguan, Shandong University, China
Omega
Competitive Analysis of Arbitrary Varying Channels
Michael Langberg, Buffalo University, Israel; Oron Sabag, Hebrew university, Israel
The State-Dependent Channel with a Rate-Limited Cribbing Helper
Amos Lapidoth, ETH Zurich, Switzerland; Yossef Steinberg, Technion - IIT, Israel
Fixed-Memory Capacity Bounds for the Gilbert-Elliott Channel
Yutong Han, Technical University of Munich, Germany; Albert Guillén i Fàbregas, University of Cambridge, Universitat Pompeu Fabra, United Kingdom
An Achievable Scheme for Channels with an Amplitude Constraint Using Walsh Functions
Ron Dabora, Ben-Gurion University of the Negev, Israel; Shlomo Shamai (Shitz), Technion–Israel Institute of Technology, Israel; H. Vincent Poor, Princeton University, United States
Lamda
On the Secrecy Capacity of 1-2-1 Atomic Networks
Mohammad Milanian, Minoh Jeong, Martina Cardone, University of Minnesota, United States
Covert Distributed Detection over Discrete Memoryless Channels
Abdelaziz Bounhar, Télécom Paris, France; Mireille Sarkiss, Télécom SudParis, France; Michèle Wigger, Télécom Paris, France
A Monotone Circuit Construction for Individually-Secure Multi-Secret Sharing
Cailyn Bass, Clemson University, United States; Alejandro Cohen, Technion, Israel; Rafael D'Oliveira, Clemson University, United States; Muriel Medard, MIT, United States
Bounds on the Statistical Leakage-Resilience of Shamir's Secret Sharing
Utkarsh Gupta, Hessam Mahdavifar, Northeastern University, United States
Mon, 8 Jul, 11:25 - 11:50
Mon, 8 Jul, 11:50 - 12:50
Ballroom II & III
Resource-Efficient Entanglement-Assisted Covert Communications over Bosonic Channels
Shi-Yuan Wang, Shang-Jen Su, Matthieu Bloch, Georgia Institute of Technology, United States
Optimal Redundancy in Exact Channel Synthesis
Sharang Sriramu, Aaron Wagner, Cornell University, United States
Linear Operator Approximate Message Passing: Power Method with Partial and Stochastic Updates
Riccardo Rossetti, Duke University, United States; Bobak Nazer, Boston University, United States; Galen Reeves, Duke University, United States
Ypsilon I-II-III
Mining Invariance from Nonlinear Multi-Environment Data: Binary Classification
Austin Goddard, Kang Du, Yu Xiang, University of Utah, United States
Benefits of Stochastic Mirror Descent in High-Dimensional Binary Classification
Nithin Varma Kanumuri, Babak Hassibi, Caltech, United States
Regularized Linear Regression for Binary Classification
Danil Akhtiamov, Reza Ghane, Babak Hassibi, Caltech, United States
Ypsilon IV-V-VI
Group Fairness with Uncertain Sensitive Attributes
Abhin Shah, Maohao Shen, Jongha Ryu, MIT, United States; Subhro Das, Prasanna Sattigeri, IBM Research, United States; Yuheng Bu, University of Florida, United States; Gregory Wornell, MIT, United States
A Unified View of Group Fairness Tradeoffs Using Partial Information Decomposition
Faisal Hamman, Sanghamitra Dutta, University of Maryland-College Park, United States
Intrinsic Fairness-Accuracy Tradeoffs under Equalized Odds
Meiyu Zhong, Ravi Tandon, University of Arizona, United States
Omikron II
Minimizing Distortion in Data Embedding Using LDGM Codes and the Cavity Method
Masoumeh Alinia, David Mitchell, New Mexico State University, United States
Reinforcement Learning for Near-Optimal Design of Zero-Delay Codes for Markov Sources
Liam Cregg, Tamas Linder, Serdar Yuksel, Queen's University, Canada
Characterization of the Distortion-Perception Tradeoff for Finite Channels with Arbitrary Metrics
Dror Freirich, Nir Weinberger, Ron Meir, Technion, Israel
Omikron I
Generalization and Informativeness of Conformal Prediction
Matteo Zecchin, Sangwoo Park, Osvaldo Simeone, King’s College London, United Kingdom; Fredrik Hellström, University College London, United Kingdom
Cross-Validation Conformal Risk Control
Kfir M. Cohen, Sangwoo Park, Osvaldo Simeone, King's College London, United Kingdom; Shlomo Shamai, Technion, Israel
Risk Bound on MDL Estimator for Simple ReLU Networks
Yoshinari Takeishi, Jun'ichi Takeuchi, Kyushu University, Japan
Sigma/Delta
Message-Relevant Dimension Reduction of Neural Populations
Amanda Merkley, Alice Nam, Kate Hong, Pulkit Grover, Carnegie Mellon University, United States
A Simple Self-Decoding Model for Neural Coding
Thach V. Bui, University of Science, Viet Nam
Causality Testing, Directed Information and Spike Trains
Andreas Theocharous, University of Cambridge, United Kingdom; Georgia Gregoriou, University of Crete, Greece; Panos Sapountzis, Foundation of Research and Technology Hellas, Greece; Ioannis Kontoyiannis, University of Cambridge, United Kingdom
VIP
Estimating the Weight Enumerators of Reed-Muller Codes via Sampling
Shreyas Jain, IISER Mohali, India; V Arvind Rameshwar, India Urban Data Exchange, India; Navin Kashyap, Indian Institute of Science, Bengaluru, India
Generalized Reed-Muller codes: A new construction of information sets
José Joaquín Bernal, Universidad de Murcia, Spain
Recursive Subproduct Codes with Reed-Muller-like Structure
Aditya Siddheshwar, International Institute of Information Technology, Hyderabad, India; Lakshmi Prasad Natarajan, Indian Institute of Technology Hyderabad, India; Prasad Krishnan, International Institute of Information Technology, Hyderabad, India
Omega
Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates
Pau Colomer, Technische Universität München, Germany; Christian Deppe, Technische Universität Braunschweig, Germany; Holger Boche, Technische Universität München, Germany; Andreas Winter, Universitat Autònoma de Barcelona, Spain
Deterministic Identification: From Theoretical Analysis to Practical Identification Codes
Ilya Vorobyev, Technical University of Munich, Germany; Christian Deppe, Technical University of Braunschweig, Germany; Luis Torres-Figueroa, Holger Boche, Technical University of Munich, Germany
Second-Order Identification Capacity of AWGN Channels
Zhicheng Liu, Beijing Jiaotong University, China; Yuan Li, Huazi Zhang, Jun Wang, Huawei Technologies Co. Ltd., China; Guiying Yan, Zhiming Ma, University of Chinese Academy and Sciences, China
Lamda
Variable-Length Secret Key Agreement via Random Stopping Time
Junda Zhou, Cheuk Ting Li, The Chinese University of Hong Kong, Hong Kong SAR of China
A Perfect Ideal Hierarchical Secret Sharing Scheme Based on The CRT for Polynomial Rings
Jing Yang, Shu-Tao Xia, Tsinghua University, China; Xianfang Wang, CETC Cyberspace Security Technology Co.,Ltd., China; Jiangtao Yuan, University of Electronic Science and Technology of China, China; Fang-Wei Fu, Nankai University, China
Repurposing Physical Layer Secret Keys: A Novel Paradigm for Common Randomness Generation
Prashanth Kumar Herooru Sheshagiri, Juan Alberto Cabrera, Frank H. P. Fitzek, Technische Universität Dresden, Germany
Mon, 8 Jul, 12:50 - 14:35
Mon, 8 Jul, 13:05 - 14:05
Mon, 8 Jul, 14:35 - 15:55
Ballroom II & III
Limit Distribution for Quantum Relative Entropy
Sreejith Sreekumar, Mario Berta, RWTH Aachen University, Germany
A Causal Model for Quantifying Multipartite Classical and Quantum Correlations
Shuchan Wang, Gerhard Wunder, Freie Universität Berlin, Germany
Entanglement cost of discriminating quantum states under locality constraints
Chenghong Zhu, Chengkai Zhu, Zhiping Liu, Xin Wang, The Hong Kong University of Science and Technology (Guangzhou), China
Locally-Measured Rényi Divergences
Tobias Rippchen, Sreejith Sreekumar, Mario Berta, RWTH Aachen University, Germany
Ypsilon I-II-III
Effect of Weight Quantization on Learning Models by Typical Case Analysis
Shuhei Kashiwamura, The University of Tokyo, Japan; Ayaka Sakata, The Institute of Statistical Mathematics, Japan; Masaaki Imaizumi, The University of Tokyo, Japan
Sharp information-theoretic thresholds for shuffled linear regression
Leon Lufkin, Yihong Wu, Yale University, United States; Jiaming Xu, Duke University, United States
Data-Driven Estimation of the False Positive Rate of the Bayes Binary Classifier via Soft Labels
Minoh Jeong, Martina Cardone, University of Minnesota, United States; Alex Dytso, Qualcomm Flarion Technology, Inc., United States
Rate of convergence of an over-parametrized convolutional neural network image classifier learned by gradient descent
Michael Kohler, Technical University of Darmstadt, Germany; Adam Krzyzak, Concordia University, Canada; Benjamin Walter, Technical University of Darmstadt, Germany
Ypsilon IV-V-VI
On the Privacy Guarantees of Differentially Private Stochastic Gradient Descent
Shahab Asoodeh, McMaster University, Canada; Mario Diaz, Universidad Nacional Autónoma de México, Mexico
Controlled privacy leakage propagation throughout differential private overlapping grouped learning
Shahrzad Kiani, University of Toronto, Canada; Franziska Boenisch, CISPA, Germany; Stark C. Draper, University of Toronto, Canada
Utilitarian Privacy and Private Sampling
Aman Bansal, Stanford University, United States; Rahul Chunduru, University of Wisconsin, Madison, United States; Deepesh Data, University of California, Los Angeles, United States; Manoj Prabhakaran, Indian Institute of Technology Bombay, India
Age Aware Scheduling for Differentially-Private Federated Learning
Kuan-Yu Lin, National Yang Ming Chiao Tung University, Taiwan; Hsuan-Yin Lin, Simula UiB, Norway; Yu-Pin Hsu, National Taipei University, Taiwan; Yu-Chih Huang, National Yang Ming Chiao Tung University, Taiwan
Omikron II
On the Rate-Distortion Function for Sampled Cyclostationary Gaussian Processes with Memory
Zikun Tan, Ron Dabora, Ben-Gurion University of the Negev, Israel; H. Vincent Poor, Princeton University, United States
On Convergence of Discrete Schemes for Computing the Rate-Distortion Function of Continuous Source
Lingyi Chen, Shitong Wu, Tsinghua University, China; Wenyi Zhang, University of Science and Technology of China, China; Huihui Wu, University of Electronic Science and Technology of China, China; Hao Wu, Tsinghua University, China
On the Lossy Compression of Spatial Networks
Praneeth Kumar Vippathalla, Martin Wachiye Wafula, Mihai-Alin Badiu, Justin P. Coon, University of Oxford, United Kingdom
Estimation of Rate-Distortion Function for Computing with Decoder Side Information
Heasung Kim, Hyeji Kim, Gustavo De Veciana, The University of Texas at Austin, United States
Omikron I
Design and analysis of a family of complexity-constrained LDPC codes
Massimo Battaglioni, Matteo Amagliani, Marco Baldi, Franco Chiaraluce, Giovanni Cancellieri, Università Politecnica delle Marche, Italy
Generalized Quasi-Cyclic LDPC Codes: Design and Efficient Encoding
Roxana Smarandache, Anthony Gómez-Fonseca, University of Notre Dame, United States; David Mitchell, New Mexico State University, United States
Progressive Reconstruction of Large QC-LDPC Codes over a Noisy Channel
Yuanbo Mi, Zhao Chen, Liuguo Yin, Xi Chen, Tsinghua University, China
Group Codes with Low-Density Orthogonal Idempotent
Fabian Molina, Universidad de Oviedo, Spain; Paolo Santini, Marco Baldi, Università Politecnica delle Marche, Italy
Sigma/Delta
Achieving DNA Labeling Capacity with Minimum Labels through Extremal de Bruijn Subgraphs
Christoph Hofmeister, Anina Gruica, Dganit Hanania, Rawad Bitar, Eitan Yaakobi
Coding Scheme for Noisy Nanopore Sequencing with Backtracking and Skipping Errors
Yeow meng Chee, National University of Singapore, Singapore; Kees A. Schouhamer Immink, Turing Machines Inc., Netherlands; Van Khu Vu, National University of Singapore, Singapore
Covering All Bases: The Next Inning in DNA Sequencing Efficiency
Hadas Abraham, Technion - Israel Institute of Technology, Israel; Ryan Gabrys, Calit2, University of California, San Diego, United States; Eitan Yaakobi, Technion - Israel Institute of Technology, Israel
Asymptotically Optimal Codes Correcting One Substring Edit
Yuting Li, Yuanyuan Tang, Hao Lou, University of Virginia, United States; Ryan Gabrys, University of California-San Diego, United States; Farzad Farnoud, University of Virginia, United States
VIP
Efficient Decoding of a Class of Reed-Solomon Codes over Fermat Fields
Chao Chen, Baoming Bai, Xidian University, China; Xiao Ma, Sun Yat-sen University, China; Yunghsiang S Han, Nianqi Tang, University of Electronic Science and Technology of China, China; Xiaotian Wang, Xidian University, China
Reed-Solomon Codes over Cyclic Polynomial Ring with Lower Encoding/Decoding Complexity
Wenhao Liu, Zhengyi Jiang, Zhongyi Huang, Tsinghua University, China; Linqi Song, City University of Hong Kong, China; Hanxu Hou, Dongguan University of Technology, China
Deep Holes of Twisted Reed-Solomon Codes
Weijun Fang, Shandong University, China; Jingke Xu, Shandong Agricultural University, China
Repairing Reed-Solomon Codes with Less Bandwidth
SHU LIU, University of Electronic Science and Technology of China, China; Yunqi Wan, Huawei Technology Co. Ltd., China; CHAOPING XING, Shanghai Jiao Tong University, China
Omega
Information Velocity of Cascaded AWGN Channels with Feedback
Elad Domanovitz, Anatoly Khina, Tel Aviv University, Israel; Tal Philosof, Samsung Research, Israel; Yuval Kochman, Hebrew University of Jerusalem, Israel
Message-Cognizant Assistance and Feedback for the Gaussian Channel
Amos Lapidoth, Ligong Wang, Yiming Yan, ETH Zurich, Switzerland
Channel Coding with Mean and Variance Cost Constraints
Adeel Mahmood, Aaron Wagner, Cornell University, United States
Systematic Transmission With Fountain Parity Checks for Erasure Channels With Stop Feedback
Hengjie Yang, Qualcomm, United States; Richard Wesel, University of California, Los Angeles, United States
Lamda
Missing Mass under Random Duplications
Prafulla Chandra, Andrew Thangaraj, IIT Madras, India
Low-rank Matrix Sensing With Dithered One-Bit Quantization
Farhang Yeganegi, Arian Eamaz, Mojtaba Soltanalian, University of Illinois Chicago, United States
Sharper rates of convergence for the tensor graphical Lasso estimator
Shuheng Zhou, University of California, United States; Kristjan Greenewald, IBM Research, United States
Detection of Signals in Colored Noise: Leading Eigenvalue Test for Non-central F-matrices
Prathapasinghe Dharmawansa, University of Melbourne, Australia; Saman Atapattu, RMIT University, Australia; Jamie Evans, University of Melbourne, Australia; Kandeepan Sithamparanathan, RMIT University, Australia
Mon, 8 Jul, 15:00 - 18:00
Mon, 8 Jul, 15:25 - 16:55
Mon, 8 Jul, 15:55 - 16:25
Mon, 8 Jul, 16:25 - 17:45
Ballroom II & III
Bipartite entanglement of noisy stabilizer states through the lens of stabilizer codes
Kenneth Goodenough, UMass Amherst, United States; Aqil Sajjad, University of Arizona, United States; Eneet Kaur, Cisco Quantum Lab, United States; Saikat Guha, University of Arizona, United States; Don Towsley, UMass Amherst, United States
Quantum Illumination Advantage for Classification Among an Arbitrary Library of Targets
Ali Cox, University of Arizona, United States; Quntao Zhuang, University of Southern California, United States; Jeffrey Shapiro, Massachusetts Institute of Technology, United States; Saikat Guha, University of Arizona, United States
Quantum Doeblin coefficients: A simple upper bound on contraction coefficients
Christoph Hirche, Leibniz Universität Hannover, Germany
Empirical Risk Minimization and Uniform Convergence for Probabilistically Observed and Quantum Measurement Hypothesis Classes
Abram Magner, University at Albany, State University of New York, United States; Arun Padakandla, Eurecom, France
Ypsilon I-II-III
Conditional Mutual Information Constrained Deep Learning: Framework and Preliminary Results
En-Hui Yang, Shayan Mohajer Hamidi, Linfeng Ye, Renhao Tan, University of Waterloo, Canada; Beverly Yang, University of British Columbia, Canada
Supervised Contrastive Representation Learning: Landscape Analysis with Unconstrained Features
Tina Behnia, Christos Thrampoulidis, University of British Columbia, Canada
Theoretical Guarantees of Data Augmented Last Layer Retraining Methods
Monica Welfert, Nathan Stromberg, Lalitha Sankar, Arizona State University, United States
Robust VAEs via Generating Process of Noise Augmented Data
Hiroo Irobe, Wataru Aoki, Tokyo Institute of Technology, Japan; Kimihiro Yamazaki, Fujitsu, Japan; Yuhui Zhang, Tokyo Institute of Technology, Japan; Takumi Nakagawa, Tokyo Institute of Technology, RIKEN AIP, Japan; Hiroki Waida, Tokyo Institute of Technology, Japan; Yuichiro Wada, Fujitsu, RIKEN AIP, Japan; Takafumi Kanamori, Tokyo Institute of Technology, RIKEN AIP, Japan
Ypsilon IV-V-VI
Optimal Private Discrete Distribution Estimation with One-bit Communication
Seung-Hyun Nam, KAIST, Korea (South); Vincent Y. F. Tan, National University of Singapore, Singapore; Si-Hyeon Lee, KAIST, Korea (South)
Differentially Private Synthetic Data with Private Density Estimation
Nikolija Bojkovic, University of Belgrade, Serbia; Po-Ling Loh, University of Cambridge, United Kingdom
Training Generative Models from Privatized Data via Entropic Optimal Transport
Daria Reshetova, Wei-Ning Chen, Ayfer Ozgur, Stanford University, United States
Differentially Private Fair Binary Classifications
Hrad Ghoukasian, Shahab Asoodeh, McMaster University, Canada
Omikron II
Few-Shot Channel-Agnostic Analog Coding: A Near-Optimal Scheme
Mohammad Ali Maddah-Ali, Soheil Mohajer, University of Minnesota, United States
One Shot Joint Source Channel Coding
Nir Elkayam, Meir Feder, Tel Aviv University, Israel
Unequal Message Protection: One-Shot analysis via Poisson Matching Lemma
Ashish Khisti, University of Toronto & Qualcomm AI Research, Canada; Arash Behboodi, Gabriele Cesa, Pratik Kumar, Qualcomm AI Research, Netherlands
Power-limited Modulation-Estimation with a Helper
Anatoly Khina, Tel Aviv University, Israel; Neri Merhav, Technion - Israel Institute of Technology, Israel
Omikron I
Analysis of Coded Shaped QAM Signaling at Short and Moderate Lengths
Irina Bocharova, Boris Kudryashov, Sander Mikelsaar, University of Tartu, Estonia
Short Regular Girth-8 QC-LDPC Codes From Exponent Matrices with Vertical Symmetry
Guohua Zhang, Aijing Sun, Xi'an University of Posts and Telecommunications, China; Ling Liu, Xidian University, China; Yi Fang, Guangdong University of Technology, China
Probabilistic Design of Multi-Dimensional Spatially-Coupled Codes
Canberk Irimagzi, Ata Tanrikulu, Ahmed Hareedy, Middle East Technical University, Turkey
Pseudoredundancy for the Bit-Flipping Algorithm
Jens Zumbrägel, University of Passau, Germany
Sigma/Delta
Short Systematic Codes for Correcting Random Edit Errors in DNA Storage
Serge Kas Hanna, CNRS, France
Efficient DNA Synthesis Codes with Error Correction and Runlength Limited Constraint
Tuan Thanh Nguyen, Kui Cai, Singapore University of Technology and Design, Singapore; Schouhamer Immink Kees, Turing Machines Inc, Netherlands
A Combinatorial Perspective on Random Access Efficiency for DNA Storage
Anina Gruica, Eindhoven University of Technology, Netherlands; Daniella Bar-Lev, Technion- Israel Institute of Technology, Israel; Alberto Ravagnani, Eindhoven University of Technology, Netherlands; Eitan Yaakobi, Technion - Israel Institute of Technology, Israel
Capacity of Frequency-based Channels: Encoding Information in Molecular Concentrations
Yuval Gerzon, Technion - Israel Institute of Technology, Israel; Ilan Shomorony, University of Illinois Urbana-Champaign, United States; Nir Weinberger, Technion - Israel institute of technology, Israel
VIP
Pair-Covering Codes
Avital Boruchovsky, Tuvi Etzion, Eitan Yaakobi, Technion, Israel
On the Classification of $\mathbb{Z}_2\mathbb{Z}_4\mathbb{Z}_8$-Linear Hadamard Codes
Dipak Kumar Bhunia, Cristina Fernández-Córdoba, Mercè Villanueva, Universitat Autònoma de Barcelona, Spain
Endomorphisms of Linear Block Codes
Jonathan Mandelbaum, Sisi Miao, Holger Jäkel, Laurent Schmalen, Karlsruhe Institute of Technology, Germany
Nonlinear Codes with Low Redundancy
SHU LIU, University of Electronic Science and Technology of China, China; CHAOPING XING, Shanghai Jiao Tong University, China
Omega
Binomial Channel: On the Capacity-Achieving Distribution and Bounds on the Capacity
Luca Barletta, Politecnico di Milano, Italy; Ian Zieder, New Jersey Institute of Technology, United States; Antonino Favano, Politecnico di Milano, Italy; Alex Dytso, Qualcomm Flarion Technologies, United States
Information Rates Over DMCs With Many Independent Views
V. Arvind Rameshwar, India Urban Data Exchange, India; Nir Weinberger, Technion - Israel Institute of Technology, Israel
Capacity-Maximizing Input Symbol Selection for Discrete Memoryless Channels
Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh, Deniz Gündüz, Nir Weinberger
New Algorithms for Computing Sibson Capacity and Arimoto Capacity
Akira Kamatsuka, Shonan Institute of Technology, Japan; Yuki Ishikawa, The University of Electro-Communications, Japan; Koki Kazama, Shonan Institute of Technology, Japan; Takahiro Yoshida, Nihon University, Japan
Lamda
On the Success Probability of the $L_0$-regularized Box-constrained Babai Point
Xiao-Wen Chang, Yingzi Xu, McGill University, Canada
Linear Operator Approximate Message Passing: Power Method with Partial and Stochastic Updates
Riccardo Rossetti, Duke University, United States; Bobak Nazer, Boston University, United States; Galen Reeves, Duke University, United States
A Convergence Analysis of Approximate Message Passing with Non-Separable Functions and Applications to Multi-Class Classification
Burak Çakmak, Technical University of Berlin, Germany; Yue M. Lu, Harvard University, United States; Manfred Opper, Technical University of Berlin, Germany
Efficient Nonconvex Optimization for Two-way Sparse Reduced-Rank Regression
Cheng Cheng, Ziping Zhao, ShanghaiTech University, China
Mon, 8 Jul, 19:00 - 22:30
Stavros Niarchos Foundation Cultural Center
Tue, 9 Jul, 08:00 - 12:00
Tue, 9 Jul, 08:15 - 17:15
Tue, 9 Jul, 08:30 - 09:35
Tue, 9 Jul, 09:35 - 09:45
Tue, 9 Jul, 09:45 - 11:05
Ballroom II & III
Equivalence of Empirical Risk Minimization to Regularization on the Family of f-Divergences
Francisco Daunas, Iñaki Esnaola, University of Sheffield, United Kingdom; Samir M. Perlaza, INRIA, France; H. Vincent Poor, Princeton University, United States
Error Exponent in Agnostic PAC Learning
Adi Hendel, Meir Feder, Tel Aviv University, Israel
Universal Batch Learning Under The Misspecification Setting
Shlomi Vituri, Meir Feder, Tel Aviv University, Israel
Minimal Communication-Cost Statistical Learning
Milad Sefidgaran, Paris Research Center, Huawei Technologies France, France; Abdellatif Zaidi, Université Gustave Eiffel, France, France; Piotr Krasnowski, Paris Research Center, Huawei Technologies France, France
Ypsilon I-II-III
Violation of Leggett-Garg Inequalities Implies Information Erasure
Alberto Montina, Stefan Wolf, Universita della svizzera italiana, Switzerland
Adversarial Quantum Machine Learning: An Information-Theoretic Generalization Analysis
Petros Georgiou, Sharu Theresa Jose, University of Birmingham, United Kingdom; Osvaldo Simeone, King's College London, United Kingdom
Receiver algorithms to approach the quantum limit of demodulating pulse position modulation
Leo Bia, Wyant College of Optical Sciences, United States; Christos Gagatsos, Department of Electrical and Computer Engineering, United States; Saikat Guha, Wyant College of Optical Sciences, United States
On Two-stage Quantum Estimation and Asymptotics of Quantum-enhanced Transmittance Sensing
Zihao Gong, Boulat Bash, University of Arizona, United States
Ypsilon IV-V-VI
MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes
Guodong Li, Ningning Wang, Sihuang Hu, Shandong University, China; Min Ye, na, China
More results for regenerating codes on graphs
Adway Patra, Alexander Barg, University of Maryland, United States
On the Parameters of Codes for Data Access
Altan Kilic, Alberto Ravagnani, Eindhoven University of Technology, Netherlands; Emina Soljanin, Rutgers University, United States
Low-Complexity Constrained Coding Schemes for Two-Dimensional Magnetic Recording
Dogukan Ozbayrak, Duru Uyar, Ahmed Hareedy, Middle East Technical University, Turkey
Omikron II
The optimal finite-sample error probability in asymmetric binary hypothesis testing
Valentinian Lungu, Ioannis Kontoyiannis, University of Cambridge, United Kingdom
Asymptotically optimal multistage tests for multihypothesis testing
Yiming Xing, Tongji University, China; Georgios Fellouris, University of Illinois, Urbana-Champaign, United States
Non-Convex Robust Hypothesis Testing using Sinkhorn Uncertainty Sets
Jie Wang, Georgia Institute of Technology, United States; Rui Gao, University of Texas at Austin, United States; Yao Xie, Georgia Institute of Technology, United States
Robust Multi-Hypothesis Testing with Moment-Constrained Uncertainty Sets
Akshayaa Magesh, University of Illinois at Urbana-Champaign, United States; Zhongchang Sun, University at Buffalo, State University of New York, United States; Venugopal Veeravalli, University of Illinois at Urbana-Champaign, United States; Shaofeng Zou, University at Buffalo, State University of New York, United States
Omikron I
Low-Rate, Low-Distortion Compression with Wasserstein Distortion
Yang Qiu, Aaron B. Wagner, Cornell University, United States
A Distributionally Robust Approach to Shannon Limits using the Wasserstein Distance
Vikrant Malik, Taylan Kargin, Victoria Kostina, Babak Hassibi, California Institute of Technology, United States
A Converse Bound on the Mismatched Distortion-Rate Function
Maël Le Treust, Univ. Rennes, CNRS, Inria, IRISA UMR 6074, France; Tristan Tomala, HEC Paris, France
Uniform Distribution on $(n-1)$-Sphere: Rate-Distortion under Squared Error Distortion
Alex Dytso, Qualcomm Flarion Technologies, United States; Martina Cardone, University of Minnesota, United States
Sigma/Delta
On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction
Kuan Cheng, Peking University, China; Elena Grigorescu, Purdue University, United States; Xin Li, Johns Hopkins University, United States; Madhu Sudan, Harvard University, United States; Minshen Zhu, N/A, China
Tree Trace Reconstruction - Reductions to String Trace Reconstruction
Thomas Maranzatto, University of Illinois Chicago, United States
Sequence Reconstruction over 3-Deletion Channels
Di Zhang, Shandong University, China; Gennian Ge, Capital Normal University, China; Yiwei Zhang, Shandong University, China
Reconstruction of multiple strings of constant weight from prefix-suffix compositions
Yaoyu Yang, Zitan Chen, The Chinese University of Hong Kong, Shenzhen, China
VIP
A Relay Algorithm of BCH Codes for a Quick Start of the Berlekamp-Massey Algorithm
Naoaki Kokubun, Yuki Kondo, Hironori Uchikawa, Kioxia Corporation, Japan
An Earlier Termination Algorithm to Find Error Locator Polynomial in Error Correction of RS Codes
Zhengyi Jiang, Hao Shi, Zhongyi Huang, Tsinghua University, China; Bo Bai, Gong Zhang, Hanxu Hou, Huawei Tech. Co. Ltd., China
An Explicit Construction of $q$-ary MDS Array Codes and Their Efficient Decoding
Jingjie Lv, Dongguan University of Technology, China; Weijun Fang, Shandong University, China; Shu-Tao Xia, Tsinghua University, China; Hanxu Hou, Dongguan University of Technology, China
Coset Error Patterns in Recursive Projection-Aggregation Decoding
Fanyun Chen, Bin Zhang, Qin Huang, Beihang University, China
Omega
Private Sum Computation: Trade-Off between Shared Randomness and Privacy
Remi Chou, University of Texas at Arlington, United States; Joerg Kliewer, NJIT, United States; Aylin Yener, OSU, United States
Perfect Subset Privacy in Polynomial Computation
Zirui (Ken) Deng, Washington University in St. Louis, United States; Vinayak Ramkumar, Tel Aviv University, Israel; Netanel Raviv, Washington University in St. Louis, United States
Private Multiple Linear Computation: A Flexible Communication-Computation Tradeoff
Jinbao Zhu, Lanping Li, Xiaohu Tang, Ping Deng, Southwest Jiaotong University, China
On Multi-Message Private Computation
Ali Gholami, Technische Universitat Berlin, Germany; Kai Wan, Huazhong University of Science and Technology, China; Tayyebeh Jahani-Nezhad, Technische Universitat Berlin, Germany; Hua Sun, University of North Texas, United States; Mingyue Ji, University of Utah, United States; Giuseppe Caire, Technische Universitat Berlin, Germany
Lamda
Peak Age of Information under Tandem of Queues
Ashirwad Sinha, Shubhransh Singhvi, Praful Mankar, International Institute of Information Technology - Hyderabad, India; Harpreet Dhillon, Virginia Tech, United States
AoI-optimal Scheduling for Arbitrary K-channel Update-Through-Queue Systems
Won Jun Lee, Chih-Chun Wang, Purdue University, United States
Optimizing Information Freshness in Mobile Networks with Age-Threshold ALOHA
Fangming Zhao, Zhejiang University, China; Nikolaos Pappas, Linköping University, Sweden; Chuan Ma, Chongqing University, China; Xinghua Sun, Sun Yat-sen University, China; Tony Q. S. Quek, Singapore University of Technology and Design, Singapore; H. Howard Yang, Zhejiang University, China
Protocol Sequences for Age of Information under Multiple-Packet Reception
Yinian Zheng, Nanjing University of Science and Technology, China; Fang Liu, The Chinese University of Hong Kong, Hong Kong SAR of China; Yuan-Hsun Lo, National Pingtung University, Taiwan; Tsai-Lien Wong, Kangkang Xu, National Sun Yat-sen University, Taiwan; Yijin Zhang, Nanjing University of Science and Technology, China
Tue, 9 Jul, 11:05 - 11:30
Tue, 9 Jul, 11:30 - 12:50
Ballroom II & III
Low Complexity Approximate Bayesian Logistic Regression for Sparse Online Learning
Gil I. Shamir, Google, United States; Wojciech Szpankowski, Purdue University, United States
Personalized heterogeneous Gaussian mean estimation under communication constraints
Ruida Zhou, Suhas Diggavi, University of California Los Angeles, United States
Multivariate Priors and the Linearity of Optimal Bayesian Estimators under Gaussian Noise
Leighton Barnes, Center for Communications Research, United States; Alex Dytso, Qualcomm, United States; Jingbo Liu, University of Illinois, United States; H Vincent Poor, Princeton University, United States
Bayesian Persuasion: From Persuasion toward Counter-suasion
Ananya Das, IIT Kharagpur, India; Aishwarya Soni, Independent researcher, India; Amitalok Budkuley, IIT Kharagpur, India
Ypsilon I-II-III
Quantum Intersection and Union
Naqueeb Ahmad Warsi, Ayanava Dasgupta, Indian Statistical Institute, India
Min-Entropic Quantities Induced by Cones: Properties & Operational Interpretations
Ian George, Eric Chitambar, University of Illinois at Urbana-Champaign, United States
Fully quantum arbitrarily varying channel coding for entanglement-assisted communication
Paula Belzig, University of Waterloo, Canada
Secure Communication with Unreliable Entanglement Assistance
Meir Lederman, Uzi Pereg, Technion, Israel
Ypsilon IV-V-VI
Universal Framework for Parametric Constrained Coding
Adir Kobovich, Orian Leitersdorf, Daniella Bar-Lev, Eitan Yaakobi, Technion - Israel Institute of Technology, Israel
Decoding Sparse Reed-Solomon Codes with Known Support
Wilton Kim, Joel Nathanael Raj, Stanislav Kruglik, Han Mao Kiah, Nanyang Technological University, Singapore
Thermal-Aware Channel with Multiple Wires
Yeow Meng Chee, National University of Singapore, Singapore; Tuvi Etzion, Technion-Israel Institute of Technology, Israel; Schouhamer Immink Kees, Turing Machines Inc, Netherlands; Tuan Thanh Nguyen, Singapore University of Technology and Design, Singapore; Van Khu Vu, National University of Singapore, Singapore; Jos H. Weber, Delft University of Technology, Netherlands; Eitan Yaakobi, Technion-Israel Institute of Technology, Israel
Tight Lower Bound on Cross-Rack Update Bandwidth and Explicit Constructions
Zhengyi Jiang, Bin Yu, Zhongyi Huang, Tsinghua University, China; Linqi Song, City University of Hong Kong, China; Bo Bai, Gong Zhang, Hanxu Hou, Huawei Tech. Co. Ltd., China
Omikron II
High Probability Latency Quickest Change Detection over a Finite Horizon
Yu-Han Huang, Venugopal Veeravalli, University of Illinois at Urbana-Champaign, United States
Syndrome-based Fusion Rules in Heterogeneous Distributed Quickest Change Detection
Wen-Hsuan Li, Yu-Chih Huang, National Yang Ming Chiao Tung University, Taiwan
Quickest Detection in High-Dimensional Linear Regression Models via Implicit Regularization
Qunzhi Xu, Georgia Institute of Technology, United States; Yi Yu, University of Warwick, United Kingdom; Yajun Mei, Georgia Institute of Technology and New York University, United States
Monitoring High-dimensional Streaming Data via Fusing Nonparametric Shiryaev-Roberts Statistics
Xinyuan Zhang, Yajun Mei, Georgia Institute of Technology, United States
Omikron I
Rate-Distortion-Perception Tradeoff for Lossy Compression Using Conditional Perception Measure
Sadaf Salehkalaibar, University of Toronto, Canada; Jun Chen, McMaster University, Canada; Ashish Khisti, Wei Yu, University of Toronto, Canada
Computation of the Multivariate Gaussian Rate-Distortion-Perception Function
Giuseppe Serra, Photios A. Stavrou, Marios Kountouris, EURECOM, France
The Rate-Distortion-Perception Trade-off: The Role of Private Randomness
Yassine Hamdi, Imperial College London, United Kingdom; Aaron B. Wagner, Cornell University, United States; Deniz Gündüz, Imperial College London, United Kingdom
Copula-based Estimation of Continuous Sources for a Class of Constrained Rate-Distortion Functions
Giuseppe Serra, Photios A. Stavrou, Marios Kountouris, EURECOM, France
Sigma/Delta
Improved Non-Asymptotic Lower Bound on the Size of Optimal Insertion/Deletion Correcting Code
Yuhang Pi, Zhifang Zhang, Chinese Academy of Sciences, University of Chinese Academy of Sciences., China; Yaqian Zhang, Shanghai Jiao Tong University, China
New Construction of $q$-ary Codes Correcting a Burst of at most $t$ Deletions
Wentu Song, Kui Cai, Tony Quek, Singapore University of Technology and Design, Singapore
Improving the Singleton-type Upper Bounds for Non-Linear Deletion Correcting Codes
Shiqin Liu, Chen Wang, Shandong University, China; Gennian Ge, Capital Normal University, China; Yiwei Zhang, Shandong University, China
On Fixed Length Systematic All Limited Magnitude Zero Deletion/Insertion Error Control Codes
Luca Tallini, University of Teramo, Italy; Hoang Vu, Bella Bose, Oregon State University, United States
VIP
Mixed-Weight Conflict-Avoiding Codes
Yijin Zhang, Nanjing University of Science and Technology, China; Tsai-Lien Wong, Kangkang Xu, National Sun Yat-sen University, Taiwan; Yuan-Hsun Lo, National Pingtung University, Taiwan
Frame Codes for the Block-Erasure Channel
Itamar Jacoby, Ram Zamir, Tel-Aviv University, Israel
Construction of 4-phase Golay Complementary Sequence Sets with Small Number of Constituent Sequences and Arbitrary Length
Cheng Du, Yi Jiang, Fudan University, China
A New Construction of Enhanced Cross Z-Complementary Sets With Maximum Zero Correlation Zone
Zhen-Ming Huang, Cheng-Yu Pai, National Cheng Kung University, Taiwan; Zilong Liu, University of Essex, United Kingdom; Chao-Yu Chen, National Cheng Kung University, Taiwan
Omega
Write Voltage Optimization to Increase Flash Lifetime in a Two-Variance Gaussian Channel
Ava Asmani, Semira Galijasevic, Richard Wesel, University of California, Los Angeles, United States
Fast Readable Multi-Cell Coding for Flash Memory
Hironori Uchikawa, Noboru Shibata, Taira Shibuya, Kioxia Corporation, Japan
Efficient and Timely Memory Access
Vishakha Ramani, Ivan Seskar, Roy Yates, Rutgers University, United States
On-access error correction in certain types of content-addressable memories
Ron M Roth, Technion, Israel; Giacomo Pedretti, Hewlett Packard Enterprise, United States
Lamda
Timely Gossip with Age-Dependent Networks
Han Xu, Yinfei Xu, Tiecheng Song, Southeast University, China
Age of Gossip in Random and Bipartite Networks
Thomas Maranzatto, University of Illinois Chicago, United States
Goal-Oriented Communications for Remote Inference under Two-Way Delay with Memory
Cagri Ari, Middle East Technical University, Turkey; Md Kamran Chowdhury Shisher, Auburn University, United States; Elif Uysal, Middle East Technical University, Turkey; Yin Sun, Auburn University, United States
Tue, 9 Jul, 12:50 - 14:25
Tue, 9 Jul, 13:05 - 14:05
Tue, 9 Jul, 14:25 - 15:45
Ballroom II & III
PAC Learnability for Reliable Communication over Discrete Memoryless Channels
Jiakun Liu, Wenyi Zhang, University of Science and Technology of China, China; H. Vincent Poor, Princeton University, United States
Neural Estimation of Multi-User Capacity Regions over Discrete Channels
Bashar Huleihel, Dor Tsur, Ziv Aharoni, Ben Gurion University of the Negev, Israel; Oron Sabag, The Hebrew University of Jerusalem, Israel; Haim Permuter, Ben Gurion University of the Negev, Israel
Neural Network Equalizers and Successive Interference Cancellation for Bandlimited Channels with a Nonlinearity
Daniel Plabst, Tobias Prinz, Francesca Diedolo, Thomas Wiegart, Technical University of Munich, Germany; Georg Böcherer, Huawei Technologies Düsseldorf GmbH, Germany; Norbert Hanik, Gerhard Kramer, Technical University of Munich, Germany
Graph Neural Network-based Joint Equalization and Decoding
Jannis Clausius, Marvin Geiselhart, Daniel Tandler, Stephan ten Brink, University of Stuttgart, Germany
Ypsilon I-II-III
Optimality of meta-converse for channel simulation
Mario Berta, RWTH Aachen University, Germany; Omar Fawzi, Ens de Lyon, France; Aadil Oufkir, RWTH Aachen University, Germany
New Bounds on Quantum Sample Complexity of Measurement Classes
Mohsen Heidari, Indiana University, United States; Wojciech Szpankowski, Purdue University, United States
Coherent Distributed Source Simulation as Multipartite Quantum State Splitting
Ian George, University of Illinois at Urbana-Champaign, United States; Hao-Chung Cheng, National Taiwan University, Taiwan
Data Transmission over a Bosonic Channel under Classical Noise
Janis Nötzel, Technical University of Munich, Germany
Ypsilon IV-V-VI
New EVENODD+ Codes with More Flexible Parameters and Lower Complexity
Panyu Zhu, Shenzhen Institute for Advanced Study, University of Electronic Science and Technology of China, China; Jingjie Lv, School of Electrical Engineering & Intelligentization, Dongguan University of Technology, China; Yunghsiang Sam Han, Shenzhen Institute for Advanced Study, University of Electronic Science and Technology of China, China; Linqi Song, Department of Computer Science, City University of Hong Kong, China; Hanxu Hou, School of Electrical Engineering & Intelligentization, Dongguan University of Technology, China
Upper Bound on Coding Rate over Resistive Random-Access Memory Channel under Arbitrary Input Distribution
Guanghui Song, Qi Cao, Ying Li, Xidian University, China; Xuan He, Southwest Jiaotong University, China; Kui Cai, Singapore University of Technology and Design, Singapore
Constructing $(h,k+1)$ cooperative MSR codes with sub-packetization $(h+1)2^{\lceil n/2 \rceil}$
Zihao Zhang, Guodong Li, Sihuang Hu, Shandong University, China
Error-Resilient Weakly Constrained Coding via Row-by-Row Coding
Prachi Mishra, Navin Kashyap, Indian Institute of Science, India
Omikron II
Detection of Correlated Random Vectors
Dor Elimelech, Ben-Gurion University of the Negev, Israel; Wasim Huleihel, Tel Aviv University, Israel
Testing Dependency of Weighted Random Graphs
Mor Oren-Loberman, Vered Paslev, Wasim Huleihel, Tel Aviv University, Israel
Neyman-Pearson Causal Inference
Joni Shaska, Urbashi Mitra, University of Southern California, United States
Large Deviations for Statistical Sequence Matching
Lin Zhou, Qianyun Wang, Jingjing Wang, Lin Bai, Beihang University, China; Alfred Hero, University of Michigan, Ann Arbor, United States
Omikron I
Error Exponents of Discrete Memoryless Channels Under Small Mismatch
Priyanka Patel, University of Cambridge, United Kingdom; Francesc Molina, Universitat Pompeu Fabra, Spain; Albert Guillén i Fàbregas, University of Cambridge, United Kingdom
The Method of Types for the AWGN Channel: Error Exponent
Sergey Tridenski, Anelia Somekh-Baruch, Bar-Ilan University, Israel
On guessing random additive noise decoding
Hamdi Joudeh, Eindhoven University of Technology, Netherlands
An Achievable Error Exponent for the Information Bottleneck Channel
Han Wu, Hamdi Joudeh, Eindhoven University of Technology, Netherlands
Sigma/Delta
Characterizing positive-rate secure multicast network coding with eavesdropping nodes
Michael Langberg, University at Buffalo, United States; Michelle Effros, Caltech, United States
The Langberg-Medard Multiple Unicast Conjecture for Networks with Collapsed Backbone
Kai Cai, Guangyue Han, The University of Hong Kong, Hong Kong SAR of China
Distributionally Robust Degree Optimization for BATS Codes
Hoover H. F. Yin, The Chinese University of Hong Kong, Hong Kong SAR of China; Jie Wang, Georgia Institute of Technology, United States; Sherman S. M. Chow, The Chinese University of Hong Kong, Hong Kong SAR of China
Efficient Binary Batched Network Coding employing Partial Recovery
Licheng Mao, Shenghao Yang, The Chinese University of Hong Kong, Shenzhen, China
VIP
A new family of binary sequences based on the generalized ERC construction
Francisco Javier Soto, Ana Isabel Gómez, Universidad Rey Juan Carlos, Spain; Domingo Gómez-Pérez, Universidad de Cantabria, Spain
Network Analysis of Baker's Map Implemented in a Fixed-point Arithmetic Domain
Kai Tan, Chengqing Li, Xiangtan University, China
The Unique Form of the Uncorrelated Optimal ZCZ Sequence Families
Gangsan Kim, Hong-Yeop Song, Yonsei University, Korea (South)
On de Bruijn Covering Sequences and Arrays
Yeow Meng Chee, National University Singapore, Singapore; Tuvi Etzion, Technion, Israel Technology Institute, Israel; Hoang Ta, Van Khu Vu, National University Singapore, Singapore
Omega
Perfect Multi-User Distributed Computing
Ali Khalesi, Petros Elia, Eurecom, France
Multi-access Distributed Computing Models using Map-Reduce Arrays
Shanuja Sasi, Onur Günlü, Linköping University, Sweden; Sundar Rajan, Indian Institute of Science, India
Decentralized Uncoded Storage Elastic Computing with Heterogeneous Computation Speeds
Wenbo Huang, Xudong You, Kai Wan, Robert Caiming Qiu, Huazhong University of Science and Technology, China; Mingyue Ji, University of Utah, United States
Sparse Gaussian Gradient Code
Yuxin Jiang, University of British Columbia, Canada; Wenqin Zhang, Yuan Luo, Shanghai Jiao Tong University, China; Lele Wang, University of British Columbia, Canada
Lamda
Optimal Denial-of-Service Attacks Against Status Updating
Saad Kriouile, Mohamad Assaad, Laboratory of Signals and Systems (L2S) CentraleSupelec, France; Deniz Gündüz, Touraj Soleymani, Department of Electrical and Electronic Engineering, United Kingdom
When to Preempt in a Status Update System?
Subhankar Banerjee, Sennur Ulukus, University of Maryland, College Park, United States
Optimal Update Policy for the Monitoring of Distributed Sources
Eric Graves, Jake Perazzone, Kevin Chan, DEVCOM Army Research Laboratory, United States
AoII-Optimum Sampling of CTMC Information Sources Under Sampling Rate Constraints
Ismail Cosandal, University of Maryland, United States; Nail Akar, Bilkent University, Turkey; Sennur Ulukus, University of Maryland, United States
Tue, 9 Jul, 15:00 - 16:00
Tue, 9 Jul, 15:45 - 16:05
Tue, 9 Jul, 16:05 - 17:25
Ballroom II & III
Section-wise Revolving NBP-like Decoders for QC-LDPC Codes
Qinshan Zhang, Tsinghua University, China; Bin Chen, Harbin Institute of Technology (Shenzhen), China; Tianqu Zhuang, Yong Jiang, Shu-Tao Xia, Tsinghua University, China
Interpreting Deepcode, a learned feedback code
Yingyao Zhou, Natasha Devroye, Gyorgy Turan, Milos Zefran, University of Illinois at Chicago, United States
Nested Construction of Polar Codes via Transformers
Sravan Ankireddy, University of Texas at Austin, United States; Ashwin Hebbar, Princeton University, United States; Heping Wan, Joonyoung Cho, Charlie Zhang, Samsung Research America, United States
Dense KO Codes: Faster Convergence and Reduced Complexity through Dense Connectivity
Shubham Srivastava, Adrish Banerjee, Indian Institute of Technology Kanpur, India
Ypsilon I-II-III
Quantum Channel Simulation in Fidelity is no more difficult than State Splitting
Michael Xuan Cao, Rahul Jain, Marco Tomamichel, National University of Singapore, Singapore
Quantum Soft Covering and Decoupling with Relative Entropy Criterion
Xingyi He, Touheed Atif, S. Sandeep Pradhan, University of Michigan, United States
Entanglement sharing across a damping-dephasing channel
Vikesh Siddhu, IBM Research India and IBM Quantum, IBM T.J. Watson Research Center, Yorktown Heights, NY, India; Dina Abdelhadi, École polytechnique fédérale de Lausanne, Switzerland; Tomas Jochym-O’Connor, IBM Quantum, Almaden Research Center, San Jose, CA and IBM Quantum, IBM T.J. Watson Research Center, Yorktown Heights, NY, United States; John Smolin, IBM Quantum, IBM T.J. Watson Research Center, Yorktown Heights, United States
Simulation of Separable Quantum Measurements on Bipartite States via Likelihood POVMs
Arun Padakandla, EURECOM, France; Naqueeb Warsi, Indian Statistical Institute, India
Ypsilon IV-V-VI
Constructions of Binary MDS Array Codes with Optimal Cooperative Repair Bandwidth
Lei Li, Department of Computer Science and Engineering, Shanghai Jiao Tong University, China; Xinchun Yu, Institute of Data and Informtion, Shenzhen International Graduate School of Tsinghua University, China; Chenhao Ying, Department of Computer Science and Engineering, Shanghai Jiao Tong University, China; Liang Chen, Yuanyuan Dong, Alibaba Group, China; Yuan Luo, Department of Computer Science and Engineering, Shanghai Jiao Tong University, China
Secure Storage using Maximally Recoverable Locally Repairable Codes
Tim Janz, University of Stuttgart, Germany; Hedongliang Liu, Rawad Bitar, Technical University of Munich, Germany; Frank R. Kschischang, University of Toronto, Canada
On Low Field Size Constructions of Access-Optimal Convertible Codes
Saransh Chopra, Francisco Maturana, Rashmi Korlakai Vinayak, Carnegie Mellon University, United States
On Existence of Latency Optimal Uncoded Storage Schemes in Geo-Distributed Data Storage Systems
Srivathsa Acharya, Vijay Kumar, Indian Institute of Science, India; Viveck R. Cadambe, Pennsylvania State University, United States
Omikron II
On the Optimal Tradeoffs among Error Exponents in Active Sequential Multiple Hypothesis Testing
Chia-Yu Hsu, I-Hsiang Wang, National Taiwan University, Taiwan
Sequential Adversarial Hypothesis Testing
Eeshan Modak, Tata Institute of Fundamental Research, India; Mayank Bakshi, Arizona State University, United States; Bikash Kumar Dey, Indian Institute of Technology, Mumbai, India; Vinod M. Prabhakaran, Tata Institute of Fundamental Research, India
A Unified Study on Sequentiality in Universal Classification with Empirically Observed Statistics
Ching-Fang Li, I-Hsiang Wang, National Taiwan University, Taiwan
Joint Sequential Detection and Isolation of Anomalies under Composite Hypotheses
Anamitra Chaudhuri, Texas A&M University, United States; Georgios Fellouris, University of Illinois, Urbana-Champaign, United States
Omikron I
Pre-Decoder Processing Functions for a DMC with Mismatched Decoding
Jonathan Solel, Anelia Somekh-Baruch, Bar-Ilan University, Israel
On Universal Decoding over Memoryless Channels with the Krichevsky–Trofimov Estimator
Henrique Miyamoto, Sheng Yang, Université Paris-Saclay, France
A Double Maximization Approach for Optimizing the LM Rate of Mismatched Decoding
Lingyi Chen, Shitong Wu, Xinwei Li, Tsinghua University, China; Huihui Wu, University of Electronic Science and Technology of China, China; Hao Wu, Tsinghua University, China; Wenyi Zhang, University of Science and Technology of China, China
Nearest Neighbor Decoding for a Class of Compound Channels
Francesc Molina, Universitat Pompeu Fabra, Spain; Priyanka Patel, Albert Guillén i Fàbregas, University of Cambridge, United Kingdom
Sigma/Delta
Secure Network Function Computation: Function-Security
Yang Bai, Xuan Guang, Nankai Univerisity, China; Raymond W. Yeung, The Chinese University of Hong Kong, China
Group Complete-{s} Pliable Index Coding
Sina Eghbal, Badri Vellambi, University of Cincinnati, United States; Lawrence Ong, University of Newcastle, Australia; Parastoo Sadeghi, University of New South Wales (Canberra), Australia
GRAND-Assisted Random Linear Network Coding in Wireless Broadcasts
Rina Su, Beijing Institute of Technology, China; Qifu Tyler Sun, Mingshuo Deng, University of Science and Technology Beijing, China; Zhongshan Zhang, Beijing Institute of Technology, China; Jinhong Yuan, University of New South Wales, Australia
Computing Capacity of Binary Arithmetic Sum over Asymmetric Diamond Network
Ruze Zhang, Xuan Guang, Nankai Univerisity, China; Shenghao Yang, The Chinese University of Hong Kong, Shenzhen, China; Xueyan Niu, Bo Bai, Huawei Technologies Co. Ltd., China
VIP
Two-weight rank-metric codes
Ferdinando Zullo, Olga Polverino, Paolo Santonastaso, University of Campania, Italy; John Sheekey, University College Dublin, Ireland
New Constructions for Linear Maximum Sum-Rank Distance Codes
Huimin Lao, Yeow Meng Chee, National University of Singapore, Singapore; Hao Chen, Jinan University, China; Van Khu Vu, National University of Singapore, Singapore
Fusion over the Grassmannian for High-Rank Matrix Completion
Jeremy Johnson, Huanran Li, Daniel Pimentel-Alarcon, University of Wisconsin - Madison, United States
Omega
New Results on Coded Caching in Partially Cooperative D2D Networks
Wenjie Guan, Kai Huang, Xinyu Xie, Jinbei Zhang, Kechao Cai, Xiaoxia Huang, Sun Yat-sen University, China
Two-Dimensional Multi-Access Coded Caching with Multiple Transmit Antennas
K. K. Krishnan Namboodiri, Elizabath Peter, Sundar Rajan, Indian Institute of Science, India
Improved Coded Caching from Two New Classes of PDAs from t-Designs
Rashid Ummer N T, Sundar Rajan, Indian Institute of Science, India
Improved Hotplug Caching Scheme Using PDAs
Charul Rajput, Aalto University, Finland; B Sundar Rajan, Indian Institute of Science, India
Lamda
Information-Energy Capacity Region for SLIPT Systems over Lognormal-Fading Channels
Kapila W. S. Palitharathna, Nizar Khalfet, Constantinos Psomas, University of Cyprus, Cyprus; George K. Karagiannidis, Aristotle University of Thessaloniki, Greece; Ioannis Krikidis, University of Cyprus, Cyprus
Computationally Efficient Codes for Strongly Dobrushin-Stambler Nonsymmetrizable Oblivious AVCs
Bikash Dey, IIT Bombay, India; Sidharth Jaggi, University of Bristol, United Kingdom; Michael Langberg, SUNY Buffalo, United States; Anand Sarwate, Rutgers University, United States; Yihan Zhang, IST Austria, Austria
Low-Complexity Pearson-Based Detection for AWGN Channels with Offset
Antonino Favano, Luca Barletta, Politecnico Di Milano, Italy; Marco Sforzin, Paolo Amato, Micron Technology Inc., Italy; Marco Ferrari, Consiglio Nazionale delle Ricerche, Italy
An Efficient Inversion Encoding Scheme with $k$ INV Signals on Bus Transmission
Hongru Cao, Qi Cheng, Sian-Jheng Lin, University of Science and Technology of China, China
Tue, 9 Jul, 17:30 - 18:30
Tue, 9 Jul, 18:30 - 20:30
Wed, 10 Jul, 08:15 - 13:00
Wed, 10 Jul, 08:30 - 09:40
Wed, 10 Jul, 09:40 - 09:50
Wed, 10 Jul, 09:50 - 11:10
Ballroom II & III
New Results on the Imbalance of FCSR Sequences and LFSR Subsequences
Yueying Lou, Qichun Wang, Nanjing Normal University, China
An Answer to an Open Problem on Balanced Boolean Functions with the Maximum Possible Walsh Supports
Yueying Lou, Qichun Wang, Nanjing Normal University, China
A Study of APN Functions in Dimension 7 using Antiderivatives
Lukas Kölsch, University of South Florida, United States; Alexandr Polujan, Otto von Guericke University, Germany
When does a bent concatenation not belong to the completed Maiorana-McFarland class?
Sadmir Kudin, Enes Pasalic, University of Primorska, Slovenia; Alexandr Polujan, Otto von Guericke University, Germany; Fengrong Zhang, Xidian University, China
Ypsilon I-II-III
Federated Learning via Lattice Joint Source-Channel Coding
Seyed Mohammad Azimi-Abarghouyi, KTH Royal Institute of Technology, Sweden; Lav R. Varshney, University of Illinois Urbana-Champaign, United States
Hierarchical Federated Learning: The Interplay of User Mobility and Data Heterogeneity
Wei Dong, Zhejiang University, China; Chenyuan Feng, EURECOM, France, France; Chen Sun, Sony (China) Research Laboratory, China; Howard H. Yang, Zhejiang University, China
Computation Selection: Scheduling Users to Enable Over-the-Air Federated Learning
Bobak Nazer, Boston University, United States; Krishna Narayanan, Texas A&M University, United States
Causal Impact Analysis for Asynchronous Decision Making
Mert Kayaalp, Yunus Inan, École Polytechnique Fédérale de Lausanne, Switzerland; Visa Koivunen, Aalto University, Finland; Ali H. Sayed, École Polytechnique Fédérale de Lausanne, Switzerland
Ypsilon IV-V-VI
Optimal Memory-Rate Tradeoff in Secure Coded Caching for Small Buffer or Small Rate
Han Fang, Nan Liu, Wei Kang, Southeast University, China
On Demand-Private Hotplug Caching Systems
Yinbin Ma, Daniela Tuninetti, University of Illinois Chicago, United States
Coded Caching with File and Demand Privacy
Chao Qi, Xihua University, China; Minquan Cheng, Guangxi Normal University, China; Xianhua Niu, Xihua University, China; Bin Dai, Southwest Jiaotong University, China
Placement Delivery Arrays for Coded Caching with Shared and Private Caches
K. K. Krishnan Namboodiri, Elizabath Peter, Sundar Rajan, Indian Institute of Science, India
Omikron II
Common Function Reconstruction with Information Swapping Terminals
Tharindu Adikari, Stark Draper, University of Toronto, Canada
Distributed Source Coding Using Constrained-Random-Number Generators
Jun Muramatsu, Nippon Telegraph and Telephone Corporation, Japan
On Channel Simulation with Causal Rejection Samplers
Daniel Goc, Gergely Flamich, University of Cambridge, United Kingdom
Implicit and Explicit Formulas of the Joint RDF for a Tuple of Multivariate Gaussian Sources with Individual Square-Error Distortions
Evagoras Stylianou, Technical University of Munich, Germany; Charalambos D. Charalambous, Themistoklis Charalambous, University of Cyprus, Cyprus
Omikron I
Blahut-Arimoto Algorithm for Computing Capacity Region of Gaussian Vector Broadcast Channels
Tian Jiao, Xi'an Jiaotong University, China; Yanlin Geng, Xidian University, China; Zai Yang, Xi'an Jiaotong University, China
Time-Shifted Alternating Gelfand-Pinsker Coding for Broadcast Channels
Constantin Runge, Gerhard Kramer, Technical University of Munich, Germany
Achieving Gaussian Vector Broadcast Channel Capacity with Scalar Lattices
Muhammed Yusuf Şener, Gerhard Kramer, Technical University of Munich, Germany; Shlomo Shamai (Shitz), Technion—Israel Institute of Technology, Israel; Ronald Böhnke, Wen Xu, Munich Research Center, Huawei Technologies Duesseldorf GmbH, Germany
Inter-Modal Coding in Broadcast Packet Erasure Channels with Varying Statistics
Alireza Vahid, Rochester Institute of Technology, United States; Shih-Chun Lin, National Taiwan University, Taiwan
Sigma/Delta
Efficient Constructions of Non-binary Codes over Absorption Channels
Tuan Thanh Nguyen, Kui Cai, Tony Q. S. Quek, Singapore University of Technology and Design, Singapore; Schouhamer Immink Kees, Turing Machines Inc., Netherlands
Code Design for Duplex Read Sequencing
Adrian Vidal, Viduranga Bandara Wijekoon, Emanuele Viterbo, Monash University, Australia
On Achievable Rates for the Shotgun Sequencing Channel with Erasures
Hrishi Narayanan, Prasad Krishnan, Nita Parekh, International Institute of Information Technology, Hyderabad (IIIT-H), India
On the Long-Term Behavior of $k$-tuples Frequencies in Mutation Systems
Ohad Elishco, Ben-Gurion University of the Negev, Israel
VIP
Pseduo-Random and de Bruijn Array Codes
TUVI ETZION, Technion, Israel
A New Construction of Optimal Symmetrical ZCCS
Rajen Kumar, Indian Institute of Technology Patna, India; Prashant Kumar Srivastava, Indian Institute of Technolog Patna, India; Sudhan Majhi, Indian Institute of Science, India
Construction of Binary Odd Shift Complementary Pairs of All Lengths
Piyush Priyanshu, Indian Institute of Technology, Patna, Bihar, India, India; Sudhan Majhi, Indian Institute of Science, Bengaluru, Karnataka, India, India; Subhabrata Paul, Indian Institute of Technology, Patna, Bihar, India, India
Improved Upper Bound for the Size of a Trifferent Code
Siddharth Bhandari, Toyota Technological Institute at Chicago, United States; Abhishek Khetan, Indian Institute of Science, India
Omega
Algorithms for Computing the Free Distance of Convolutional Codes
Zita Abreu, University of Aveiro, Portugal; Joachim Rosenthal, Michael Schaller, University of Zurich, Switzerland
Linearity-Enhanced Serial List Decoding of Linearly Expurgated Tail-Biting Convolutional Codes
Wenhui Sui, Brendan Towell, Zihan Qu, Eugene Min, Richard Wesel, University of California, Los Angeles, United States
Complementary Exclusion of Full Polynomials to Enable Dual List Decoding of Convolutional Codes
Zihan Qu, Amaael Antonini, Wenhui Sui, Eugene Min, Arthur Yang, Richard Wesel, University of California, Los Angeles, United States
On Streaming Codes for Burst and Random Errors
Shobhit Bhatnagar, P Vijay Kumar, Indian Institute of Science, India
Lamda
Generalized Step-Chirp Sequences With Flexible Bandwidth
Cheng Du, Yi Jiang, Fudan University, China
Accelerating Quadratic Transform and WMMSE
Kaiming Shen, Chinese University of Hong Kong, Shenzhen, China; Ziping Zhao, ShanghaiTech University, China; Yannan Chen, The Chinese University of Hong Kong (Shenzhen), China; Zepeng Zhang, ShanghaiTech University, China; Hei Victor Cheng, Aarhus University, Denmark
Electromagnetic Information Theory Motivated Near-Field Channel Model
Zhongzhichao Wan, Jieao Zhu, Linglong Dai, Tsinghua University, China
Task-Based Quantizer Design for Sensing With Random Signals
Hang Ruan, Fan Liu, Southern University of Science and Technology, China
Wed, 10 Jul, 11:10 - 11:30
Wed, 10 Jul, 11:30 - 12:50
Ballroom II & III
Projective Systematic Authentication via Reed-Muller Codes
Hsuan-Po Liu, University of Michigan, United States; Hessam Mahdavifar, Northeastern University, United States
A Convolutional Variant of the Niederreiter Cryptosystem with GRS Codes
Paulo Almeida, University of Aveiro, Portugal; Miguel Beltrá, Diego Napp, University of Alicante, Spain
A Key-recovery Attack on the LCMQ Authentication Protocol
Vu Nguyen, Thomas Johansson, Qian Guo, Lund University, Sweden
Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform Information
Saar Tarnopolsky, Alejandro Cohen, Technion - Institue of Technology, Israel
Ypsilon I-II-III
Fast FixMatch: Faster Semi-Supervised Learning with Curriculum Batch Size
John Chen, Chen Dun, Anastasios Kyrillidis, Rice University, United States
Robust Semi-supervised Learning via f-Divergence and ɑ-Rényi Divergence
Gholamali Aminian, The Alan Turing Institute, United Kingdom; Amirhossien Bagheri, Sharif University Technology, Iran; Mahyar JafariNodeh, Massachusetts Institute of Technology, United States; Radmehr Karimian, Mohammad-Hossein Yassaee, Sharif University Technology, Iran
Fed-IT: Addressing Class Imbalance in Federated Learning through an Information-Theoretic Lens
Shayan Mohajer Hamidi, Renhao Tan, Linfeng Ye, En-Hui Yang, University of Waterloo, Canada
Efficient Unbiased Sparsification
Leighton Barnes, Timothy Chow, Emma Cohen, Keith Frankston, Benjamin Howard, Fred Kochman, Daniel Scheinerman, Jeffrey VanderKam, Center for Communications Research - Princeton, United States
Ypsilon IV-V-VI
A Multi-Server Publicly Verifiable Computation Scheme with Context-Hiding Property
Hong Chen, Jinyuan Li, Liang Feng Zhang, School of Information Science and Technology, ShanghaiTech University, China
Unconditional Security using (Random) Anonymous Bulletin Board
Albert Yu, Purdue University, United States; Hai H. Nguyen, ETH Zurich, Switzerland; Aniket Kate, Hemanta K. Maji, Purdue University, United States
An Improved Lower Bound on Oblivious Transfer Capacity via Interactive Erasure Emulation
So Suda, Shun Watanabe, Haruya Yamaguchi, Tokyo University of Agriculture and Technology, Japan
Towards Optimal Non-interactive Secure Multiparty Computation for Abelian Programs
Maki Yoshida, National Institute of Information and Communications Technology, Japan
Omikron II
Rejection-Sampled Universal Quantization for Smaller Quantization Errors
Chih Wei Ling, Cheuk Ting Li, The Chinese University of Hong Kong, Hong Kong SAR of China
Non-Linear Analog Processing Gains in Task-Based Quantization
Marian Temprana Alonso, Farhad Shirani, Florida International University, United States; Neil Irwin Bernardo, University of the Philippines Diliman, Philippines; Yonina C. Eldar, Weizmann Institute of Science, Israel
One-Shot Wyner–Ziv Compression of a Uniform Source
Oğuzhan Kubilay Ülger, Elza Erkip, New York University, United States
Distributed Local Sketching for $\ell_2$ Embeddings
Neophytos Charalambides, Arya Mazumdar, University of California, San Diego, United States
Omikron I
Gaussian Channel Simulation with Rotated Dithered Quantization
Szymon Kobus, Imperial College London, United Kingdom; Lucas Theis, Google DeepMind, United Kingdom; Deniz Gündüz, Imperial College London, United Kingdom
Optimal Redundancy in Exact Channel Synthesis
Sharang Sriramu, Aaron Wagner, Cornell University, United States
Broadcast Channel Synthesis from Shared Randomness
Malhar A. Managoli, Vinod M. Prabhakaran, Tata Institute of Fundamental Research, India
Multi-terminal Strong Coordination over Noisy Channels with Secrecy Constraints
Viswanathan Ramachandran, Tobias J. Oechtering, Mikael Skoglund, KTH Royal Institute of Technology, Sweden
Sigma/Delta
Mutual Information of a class of Poisson-type Channels using Markov Renewal Theory
Maximilian Gehri, Nicolai Engelmann, Heinz Koeppl, Technische Universität Darmstadt, Germany
Capacity of Runlength-Limited and GC-Content Constrained Codes for DNA Data Storage
Filip Paluncic, Daniella Paluncic, B. T. Maharaj, University of Pretoria, South Africa
Representing Information on DNA using Patterns Induced by Enzymatic Labeling
Daniella Bar-Lev, Tuvi Etzion, Technion – Israel Institute of Technology, Haifa, Israel, Israel; Eitan Yaakobi, Technion – Israel Institute of Technology, Israel; Zohar Yakhini, Reichman University, Israel
Optimizing the Decoding Probability and Coverage Ratio of Composite DNA
Tomer Cohen, Eitan Yaakobi, Technion, Israel
VIP
On the Asymptotic Nonnegative Rank of Matrices and its Applications in Information Theory
Yeow Meng Chee, National University of Singapore, Singapore; Quoc Tung Le, Toulouse School of Economics, Universit ́e de Toulouse, France; Hoang Ta, National University of Singapore, Singapore
Group-Sparse Subspace Clustering with Elastic Stars
Huanran Li, Daniel Pimentel-Alarcón, University of Wisconsin-Madison, United States
On Counting Subsequences and Higher-Order Fibonacci Numbers
Hsin-Po Wang, UC Berkeley, United States; Chi-Wei Chin, Apricob Biomedicals Co Ltd, Taiwan
Directed Redundancy in Time Series
Jan Ostergaard, Aalborg University, Denmark
Omega
Streaming Codes for Three-Node Relay Networks With Burst Erasures
Vinayak Ramkumar, Tel Aviv University, Israel; Myna Vajha, Indian Institute of Technology Hyderabad, India; Nikhil Krishnan Muralee Krishnan, Indian Institute of Technology Palakkad, India
An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes
Zita Abreu, University of Aveiro, Portugal; Julia Lieb, TU Ilmenau, Germany; Michael Schaller, University of Zurich, Switzerland
On Streaming Codes for Simultaneously Correcting Burst and Random Erasures
Shobhit Bhatnagar, Indian Institute of Science, India; Biswadip Chakraborty, Qualcomm, India; P Vijay Kumar, Indian Institute of Science, India
Subset Adaptive Relaying for Streaming Erasure Codes
Muhammad Ahmad Kaleem, Gustavo Kasper Facenda, Ashish Khisti, University of Toronto, Canada
Lamda
Potential Functions and Percolation Thresholds of Coded Poisson Receivers
Cheng-En Lee, Kuo-Yu Liao, Cheng-Shang Chang, Duan-Shin Lee, National Tsing Hua University, Taiwan
A Novel Cross Domain Iterative Detection based on the Interplay between SPA and LMMSE
Shuangyang Li, Giuseppe Caire, Technical University of Berlin, Germany
Multi-User SR-LDPC Codes via Coded Demixing with Applications to Cell-Free Systems
Jamison Ebert, Jean-Francois Chamberland, Krishna Narayanan, Texas A&M University, United States
Quality Adaptation for Cache-aided Degraded Broadcast Channels
Eleftherios Lampiris, Giuseppe Caire, Technische Universität Berlin, Germany
Wed, 10 Jul, 13:00 - 18:00
Wed, 10 Jul, 13:00 - 14:00
Wed, 10 Jul, 14:00 - 15:00
Wed, 10 Jul, 14:00 - 14:30
Wed, 10 Jul, 14:30 - 15:00
Wed, 10 Jul, 15:00 - 15:30
Wed, 10 Jul, 15:30 - 18:00
Thu, 11 Jul, 08:00 - 12:00
Thu, 11 Jul, 08:15 - 17:30
Thu, 11 Jul, 08:30 - 09:35
Thu, 11 Jul, 09:35 - 09:45
Thu, 11 Jul, 09:45 - 11:05
Ballroom II & III
Asymptotics of Language Model Alignment
Joy Yang, University of Sydney, Australia; Salman Salamatian, MIT, United States; Ziteng Sun, Ananda Theertha Suresh, Ahmad Beirami, Google, Australia
Predicting Uncertainty of Generative LLMs with MARS: Meaning-Aware Response Scoring
Yavuz Faruk Bakman, Duygu Nur Yaldiz, Baturalp Buyukates, University of Southern California, United States; Chenyang Tao, Dimitrios Dimitriadis, Amazon, United States; Salman Avestimehr, University of Southern California, United States
TexShape: Information Theoretic Sentence Embedding for Language Models
Kaan Kale, Bogazici University, Turkey; Homa Esfahanizadeh, Nokia Bell Labs, United States; Noel Elias, Oguzhan Baser, University of Texas at Austin, United States; Muriel Medard, MIT, United States; Sriram Vishwanath, University of Texas at Austin, United States
The Likelihood Gain of a Language Model as a Metric for Text Summarization
Dana Levin, Alon Kipnis, Reichman University, Israel
Ypsilon I-II-III
Quantum State Compression with Polar Codes
Jack Weinberg, Avijit Mandal, Henry Pfister, Duke University, United States
Amplitude Transformation of Quantum State Based on QSVT
Lu Hou, School of Cyber Security, University of Chinese Academy of Sciences, China; Chang Lv, Key Laboratory of Cyberspace Security Defense,\\ Institute of Information Engineering, CAS, China
Feynman Meets Turing: The Uncomputability of Quantum Gate-Circuit Emulation and Concatenation
Yannik Böck, Holger Boche, Zoe Garcia del Toro, Technical University of Munich, Germany; Frank Fitzek, Technische Universität Dresden, Germany
Rate-Limited Optimal Transport for Quantum Gaussian Observables
Hafez M. Garmaroudi, McMaster University, Canada; S. Sandeep Pradhan, University of Michigan, United States; Jun Chen, McMaster University, Canada
Ypsilon IV-V-VI
Improved Bound for Robust Causal Bandits with Linear Models
Zirui Yan, Arpan Mukherjee, Burak Varıcı, Ali Tajer, Rensselaer Polytechnic Institute, United States
Multi-armed Bandits with Probing
Eray Can Elumar, Carnegie Mellon University, United States; Cem Tekin, Bilkent University, Turkey; Osman Yagan, Carnegie Mellon University, United States
Federated Learning for Heterogeneous Bandits with Unobserved Contexts
Jiabin Lin, Shana Moothedath, Iowa State University, United States
Explore-then-Commit Algorithms for Decentralized Two-sided Matching Markets
Tejas Pagare, Department of Electrical Engineering, IIT Bombay, India; Avishek Ghosh, SysCon and CMInDS, IIT Bombay, India
Omikron II
InfoMat: A Tool for the Analysis and Visualization Sequential Information Transfer
Dor Tsur, Haim Permuter, Ben Gurion University of the Negev, Israel
Symmetric Entropy Regions of Degrees Six and Seven
Zihan Li, Shaocheng Liu, Qi Chen, Xidian University, China
Variational Characterizations of Sibson’s α-Mutual Information
Amedeo Roberto Esposito, ISTA, Austria; Michael Gastpar, EPFL, Switzerland; Ibrahim Issa, American University of Beirut, Lebanon
Neural Estimation of Entropic Optimal Transport
Tao Wang, University of Pennsylvania, United States; Ziv Goldfeld, Cornell University, United States
Omikron I
Repairing a Single Erasure in Reed-Solomon Codes with Side Information
Thi Xinh Dinh, RMIT University, Australia; Ba Thong Le, Tay Nguyen University, Viet Nam; Son Hoang Dau, Serdar Boztas, RMIT University, Australia; Stanislav Kruglik, Han Mao Kiah, Nanyang Technological University, Singapore; Emanuele Viterbo, Monash University, Australia; Tuvi Etzion, Yeow Meng Chee, National University of Singapore, Singapore
A Formula for the I/O Cost of Linear Repair Schemes and Application to Reed-Solomon Codes
Zhongyan Liu, Zhifang Zhang, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, China
Repairing with Zero Skip Cost
Yeow Meng Chee, National University of Singapore, Singapore; Son Hoang Dau, RMIT University, Australia; Tuvi Etzion, Technion-Israel Institute of Technology, Israel; Han Mao Kiah, Nanyang Technological University, Singapore; Yuan Luo, Wenqin Zhang, Shanghai Jiao Tong University, China
Repairing Schemes for Tamo-Barg Codes
Han Cai, Southwest Jiaotong University, China; Ying Miao, University of Tsukuba, Japan; Moshe Schwartz, McMaster University, Ben-Gurion University of the Negev, Canada; Xiaohu Tang, Southwest Jiaotong University, China
Sigma/Delta
On the Separability of Beamforming for Reconfigurable Intelligent Surfaces under Statistical CSI
Maryam Farahnak-Ghazani, Negar Daryanavardan, Aria Nosratinia, University of Texas at Dallas, United States
Decentralized Expectation Propagation for Semi-Blind Channel Estimation in Cell-Free Networks
Zilu Zhao, Dirk Slock, EURECOM, France
Novel Bounds for Semi-Blind Multiple-Access in Massive MIMO
George Vershinin, Asaf Cohen, Omer Gurewitz, Ben-Gurion University of the Negev, Israel
Achievable Rate for RIS-Assisted Sparse Channel with State Training
Negar Daryanavardan, Aria Nosratinia, University of Texas at Dallas, United States
VIP
On the Existence of Cyclic Lattice Codes
Chengpin Luo, Brian Kurkoski, Japan Advanced Institute of Science and Technology, Japan
On the equivalence between probabilistic shaping and geometric shaping: a polar lattice perspective
Ling Liu, Xidian University, China; Shanxiang Lyu, Jinan University, China; Cong Ling, Imperial College London, United Kingdom; Baoming Bai, Xidian University, China
Voronoi Constellations of Generalized Construction D' Lattices from q-ary Codes
Ana Paula S. Pierini, Franciele C. Silva, Sueli I. R. Costa, Universidade Estadual de Campinas, Brazil
Construction πA lattices extended to Hurwitz quaternion integers
Juliana G F Souza, Sueli I R Costa, University of Campinas, Brazil; Cong Ling, Imperial College London, United Kingdom
Omega
New Partial Orders of Polar Codes for BMSC
Liu-quan Yao, Zhi-chao Liu, University of Chinese Academy and Sciences, China; Yuan Li, Hua-zi Zhang, Jun Wang, Huawei Technologies Co. Ltd., China; Gui-ying Yan, Zhi-Ming Ma, Academy of Mathematics and Systems Science, CAS, China
Strong Polarization for Shortened and Punctured Polar Codes
Boaz Shuval, Ido Tal, Technion, Israel
PAC Code Rate-Profile Design Using Search-Constrained Optimization Algorithms
Mohsen Moradi, David Mitchell, New Mexico State University, United States
Trellis-Based Construction of Polar Codes for SCL Decoding
XINYUANMENG YAO, XIANGPING ZHENG, XIAO MA, Sun Yat-sen University, China
Lamda
Throughput and Latency of Network Coding in Line Networks with Outages
Yanyan Dong, Shenghao Yang, The Chinese University of Hong Kong, Shenzhen, China; Jie Wang, Georgia Institute of Technology, United States; Fan Cheng, Shanghai Jiao Tong University, China
Coded Caching for Hierarchical Two-Layer Networks with Coded Placement
Rajlaxmi Pandey, Indian Institute of Science, India; Charul Rajput, Aalto University, Finland; B Sundar Rajan, Indian Institute of Science, India
A Linear Feedback Coding Scheme for Computation Over Gaussian Multiple-Access Channels
Bin Dai, Southwest Jiaotong University, China; Fan Cheng, Shanghai Jiao Tong University, China; Yuhan Yang, Dengfeng Xia, Southwest Jiaotong University, China
Coded Multi-User Information Retrieval with a Multi-Antenna Helper Node
Milad Abolpour, MohammadJavad Salehi, University of Oulu, Finland; Soheil Mohajer, University of Minnesota, United States; Seyed Pooya Shariatpanahi, University of Tehran, Iran; Antti Tölli, University of Oulu, Finland
Thu, 11 Jul, 11:05 - 11:30
Thu, 11 Jul, 11:30 - 12:50
Ballroom II & III
Boundary Multiple Measurement Vectors for Multi-Coset Sampler
Dong Xiao, Yun Lin, Harbin Engineering University, China; Jian Wang, Fudan University, China
On the Generalized Sampling Expansion (GSE) for Graph Signals
Reeteswar Rajguru, IIT Kharagpur, India; Balaji Udayagiri, Independent Researcher, India; Amitalok J. Budkuley, IIT Kharagpur, India; Stefano Rini, NYCU Taiwan, Taiwan
Log-Concave Coupling for Sampling Neural Net Posteriors
Curtis McDonald, Andrew Barron, Yale University, United States
Towards Optimal Inverse Temperature in the Gibbs Algorithm
Yuheng Bu, University of Florida, United States
Ypsilon I-II-III
A Joint Code and Belief Propagation Decoder Design for Quantum LDPC Codes
Sisi Miao, Jonathan Mandelbaum, Holger Jäkel, Laurent Schmalen, Karlsruhe Institute of Technology (KIT), Germany
Upper bounds on the size of entanglement-assisted codeword stabilized codes using semidefinite programming
Ching-Yi Lai, Pin-Chieh Tseng, National Yang Ming Chiao Tung University, Taiwan; Wei-Hsuan Yu, National Central University, Taiwan
Quantum Codes Derived from One-Generator Quasi-Twisted Codes
Akram Saleh, Mohammad Reza Soleymani, Concordia University, Canada
Robust Syndrome Extraction via BCH Encoding
Eren Guttentag, Andrew Nemec, Kenneth R. Brown, Duke University, United States
Ypsilon IV-V-VI
BAI in Exponential Family: Efficiency and Optimality
Arpan Mukherjee, Ali Tajer, Rensselaer Polytechnic Institute, United States
Best Arm Identification with Arm Erasures
Srinivas Reddy Kota, Indian Institute of Technology Madras, India; Karthik Periyapattana Narayana Prasad, Indian Institute of Technology Hyderabad, India; Vincent Y. F. Tan, National University of Singapore, Singapore
Optimal Stopping Rules for Best Arm Identification in Stochastic Bandits under Uniform Sampling
Vedang Gupta, Yash Gadhia, Shivaram Kalyanakrishnan, Nikhil Karamchandani, Indian Institute of Technology Bombay, India
Minimax Regret with Unbounded Weights
Michael Drmota, TU Wien, Austria; Philippe Jacquet, INRIA, France; Changlong Wu, Wojciech Szpankowski, Purdue University, United States
Omikron II
On the Relation Between the Common Information Dimension and Wyner Common Information
Osama Hanna, Xinlin Li, Suhas Diggavi, Christina Fragouli, University of California, Los Angeles, United States
Common Randomness Generation from Finite Compound Sources
Rami Ezzine, Moritz Wiese, Technical University of Munich, Germany; Christian Deppe, Technische Universität Braunschweig, Germany; Holger Boche, Technical University of Munich, Germany
Shared Information under Simple Markov Independencies
Madhura Pathegama, Sagnik Bhattacharya, University of Maryland, College Park, United States
Explicit Formula for Partial Information Decomposition
Aobo Lyu, Andrew Clark, Netanel Raviv, Washington University in St. Louis, United States
Omikron I
A Binary Linear Functional-repair Regenerating Code on 72 Coding Spaces Related to PG(2,8)
Junming Ke, Henk D.L. Hollmann, Ago-Erik Riet, University of Tartu, Estonia
Construction of Locally Repairable Array Codes with Optimal Repair Bandwidth under the Rack-Aware Storage Model
Yumeng Yang, Han Cai, Xiaohu Tang, Southwest Jiaotong University, China
Set Transformation: Trade-off Between Repair Bandwidth and Sub-packetization
Hao Shi, Zhengyi Jiang, Zhongyi Huang, Tsinghua University, China; Bo Bai, Gong Zhang, Hanxu Hou, Huawei Tech. Co. Ltd, China
A Family of Access-Friendly MDS Array Codes
Zhongyan Liu, Zhifang Zhang, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, China
Sigma/Delta
Asymptotic Capacity of Non-Coherent One-Bit MIMO Channels with Block Fading
Sheng Yang, Richard Combes, Université Paris-Saclay, CNRS, CentraleSupélec, France
On $2 \times 2$ MIMO Gaussian Channels with a Small Discrete-Time Peak-Power Constraint
Alex Dytso, Qualcomm Flarion Technologies, United States; Luca Barletta, Politecnico di Milano, Italy; Gerhard Kramer, Technical University of Munich, Germany
On the Capacity of Gaussian “Beam-Pointing” Channels with Block Memory and Feedback
Siyao Li, Fernando Pedraza, Giuseppe Caire, Technical University of Berlin, Germany
Universal Transmission and Combining for Ultra-Reliable MIMO Relaying
Barak Avraham, Elad Domanovitz, Uri Erez, Tel Aviv University, Israel
VIP
On one-orbit cyclic subspace codes of $\mathcal{G}_q(n,3)$
Chiara Castello, Olga Polverino, Ferdinando Zullo, Università degli Studi della Campania, Italy
Optimal full-length cyclic orbit flag codes
Clementa Alonso-González, University of Alicante, Spain; Miguel Ángel Navarro-Pérez, University Carlos III of Madrid, Spain
Subspace Coding for Spatial Sensing
Hessam Mahdavifar, Northeastern University, United States; Robin Rajamäki, Piya Pal, University of California San Diego, United States
Decoding Analog Subspace Codes: Algorithms for Character-Polynomial Codes
Samin Riasat, Hessam Mahdavifar, Northeastern University, United States
Omega
A Path Metric Based Construction of Polarization-Adjusted Convolutional Codes
Tyler Kann, Georgia Institute of Technology, United States; Shrinivas Kudekar, Aiterate, LLC, United States; Matthieu Bloch, Georgia Institute of Technology, United States
Successive Cancellation Sampling Decoder: An Attempt to Analyze List Decoding Theoretically
Hsin-Po Wang, Venkatesan Guruswami, UC Berkeley, United States
Outer Code Designs for Augmented and Local-Global Polar Code Architectures
Ziyuan Zhu, Paul Siegel, University of California, San Diego, United States
Code Rate Optimization via Neural Polar Decoders
Ziv Aharoni, Bashar Huleihel, Ben Gurion University of the Negev, Israel; Henry D. Pfister, Duke University, Israel; Haim H. Permuter, Ben Gurion University of the Negev, Israel
Lamda
A probabilistic analysis on general probabilistic scheduling problems
Daiki Suruga, Nagoya University, Japan
GRLinQ: A Distributed Link Scheduling Mechanism with Graph Reinforcement Learning
Zhiwei Shan, University of Liverpool, United Kingdom; Xinping Yi, Le Liang, Southeast University, China; Chung-Shou Liao, National Tsing Hua University, Taiwan; Shi Jin, Southeast University, China
Networked Control with Hybrid Automatic Repeat Request Protocols
Touraj Soleymani, University of London, United Kingdom; John Baras, University of Maryland, United States; Deniz Gunduz, Imperial College London, United Kingdom
Tight Differentiable Relaxation of Sum Ergodic Capacity Maximization for Clustered Cell-Free Networking
Boxiang Ren, Han Hao, Ziyuan Lyu, Jingchen Peng, Tsinghua University, China; Junyuan Wang, Tongji University, China; Hao Wu, Tsinghua University, China
Thu, 11 Jul, 12:50 - 14:35
Thu, 11 Jul, 13:05 - 14:05
Thu, 11 Jul, 14:35 - 15:55
Ballroom II & III
QML-IB: Quantized Collaborative Intelligence between Multiple Devices and the Mobile Network
Jingchen Peng, Boxiang Ren, Tsinghua University, China; Lu Yang, Chenghui Peng, Huawei Tech. Co. Ltd, China; Panpan Niu, Hao Wu, Tsinghua University, China
An Achievable and Analytic Solution to Information Bottleneck for Gaussian Mixtures
Yi Song, Technische Universitat Berlin, Germany; Kai Wan, Zhenyu Liao, Huazhong University of Science and Technology, China; Hao Xu, University College London, United Kingdom; Giuseppe Caire, Technische Universitat Berlin, Germany; Shlomo Shamai, Technion-Israel Institute of Technology, Israel
An Expectation-Maximization Relaxed Method for Privacy Funnel
Lingyi Chen, Jiachuan Ye, Shitong Wu, Tsinghua University, China; Huihui Wu, Hao Wu, University of Electronic Science and Technology of China, China; Wenyi Zhang, University of Science and Technology of China, China
The Persuasion Bottleneck
Michael Gastpar, EPFL, Switzerland; Aayush Rajesh, IIT Bombay, India
Ypsilon I-II-III
Belief Propagation Decoding of Quantum LDPC Codes with Guided Decimation
Hanwen Yao, Duke University, United States; Waleed Abu Laban, Christian Häger, Alexandre Graell i Amat, Chalmers University of Technology, Sweden; Henry D. Pfister, Duke University, United States
Entanglement-Assisted Quantum Codes from a Class of Unitary Matrices
Lin Sok, Martianus Frederic Ezerman, San Ling, Nanyang Technical University, Singapore; Mareth Mam, Royal University of Phnom Penh, Cambodia
Decoding Strategies for Generalized Quantum Data-Syndrome Coding Problems
Kao-Yueh Kuo, The University of Sheffield, United Kingdom; Ching-Yi Lai, National Yang Ming Chiao Tung University, Taiwan
Improved Logical Error Rate via List Decoding of Quantum Polar Codes
Anqi Gong, Joseph Renes, ETH Zürich, Switzerland
Ypsilon IV-V-VI
VALID: a Validated Algorithm for Learning in Decentralized Networks with Possible Adversarial Presence
Mayank Bakshi, Arizona State University, United States; Sara Ghasvarianjahromi, Yauhen Yakimenka, New Jersey Institute of Technology, United States; Allison Beemer, University of Wisconsin-Eau Claire, United States; Oliver Kosut, Arizona State University, United States; Joerg Kliewer, New Jersey Institute of Technology, United States
Secure Inference for Vertically Partitioned Data Using Multiparty Homomorphic Encryption
Shuangyi Chen, University of Toronto, Canada; Yue Ju, Zhongwen Zhu, Ericsson, Canada; Ashish Khisti, University of Toronto, Canada
Byzantine-Resilient Federated Principal Subspace Estimation
Ankit Pratap Singh, Namrata Vaswani, Iowa State University, United States
Robust Distributed Gradient Descent to Corruption over Noisy Channels
Shuche Wang, Vincent Y. F. Tan, National University of Singapore, Singapore
Omikron II
Several Interpretations of Max-Sliced Mutual Information
Dor Tsur, Haim Permuter, Ben-Gurion University of the Negev, Israel; Ziv Goldfeld, Cornell University, United States
Computing Augustin Information via Hybrid Geodesically Convex Optimization
Guan-Ren Wang, Chung-En Tsai, Hao-Chung Cheng, Yen-Huan Li, National Taiwan University, Taiwan
A New Characterization Of Augustin Information And Mean
Hao-Chung Cheng, National Taiwan University, Taiwan; Barış Nakiboğlu, Middle East Technical University, Turkey
On Doeblin Curves and Their Properties
William Lu, Anuran Makur, Japneet Singh, Purdue University, United States
Omikron I
Distributed Structured Matrix Multiplication
Derya Malak, EURECOM, France
Distributed matrix multiplication with straggler tolerance using algebraic function fields
Adrián Fidalgo-Díaz, Umberto Martínez-Peñas, University of Valladolid, Spain
Flexible Field Sizes in Secure Distributed Matrix Multiplication via Efficient Interference Cancellation
Okko Makkonen, Aalto University, Finland
Secure Distributed Matrix Multiplication with Precomputation
Ryann Cartor, Rafael D'Oliveira, Clemson University, United States; Salim El Rouayheb, Rutgers University, United States; Daniel Heinlein, Arcada University of Applied Sciences, Finland; Dave Karpuk, Aalto University, Finland; Alex Sprintson, Texas A&M University, United States
Sigma/Delta
Distribution-Preserving Integrated Sensing and Communication with Secure Reconstruction
Yiqi Chen, Shanghai Jiao Tong University, China; Tobias Oechtering, KTH Royal Institute of Technology, Sweden; Holger Boche, Technical University of Munich, Germany; Mikael Skoglund, KTH Royal Institute of Technology, Sweden; Yuan Luo, Shanghai Jiao Tong University, China
Transmitter Actions for Secure Integrated Sensing and Communication
Truman Welling, The Ohio State University, United States; Onur Günlü, Linköping University, Sweden; Aylin Yener, The Ohio State University, United States
Fundamental Limits of Communication-Assisted Sensing in ISAC Systems
Fuwang Dong, Fan Liu, Shihang Lu, Southern University of Science and Technology, China; Yifeng Xiong, Beijing University of Posts and Telecommunications, China; Weijie Yuan, Yuanhao Cui, Southern University of Science and Technology, China
Bistatic Integrated Sensing and Communication over Memoryless Relay Channels
Yao Liu, Min Li, Zhejiang University, China; Lawrence Ong, The University of Newcastle, Australia; Aylin Yener, The Ohio State University, United States
VIP
Nested Construction of $\mathbb{Z}_{2^L}$-Linear Codes
Gustavo Terra Bastos, Federal University of São João del-Rei, Brazil; Maiara Francine Bollauf, Simula UiB, Norway; Agnaldo José Ferrari, São Paulo State University, Brazil; Øyvind Ytrehus, Simula UiB, Norway
Efficient Root-Finding for Interpolation-Based Decoding of Elliptic and Hyperelliptic Codes
Jianguo Zhao, Jiwei Liang, Li Chen, Sun Yat-sen University, China
Upper bounds on the rate of linear q-ary k-hash codes
Stefano Della Fiore, University of Salerno, Italy; Marco Dalai, University of Brescia, Italy
Weighted-Hamming Metric for Parallel Channels
Sebastian Bitzer, Technical University of Munich, Germany; Alberto Ravagnani, Eindhoven University of Technology, Netherlands; Violetta Weger, Technical University of Munich, Germany
Omega
Random Staircase Generator Matrix Codes
Qianfan Wang, Yixin Wang, Yiwen Wang, Jifan Liang, Xiao Ma, Sun Yat-sen University, China
Optimal Almost-Balanced Sequences
Daniella Bar-Lev, Adir Kobovich, Orian Leitersdorf, Eitan Yaakobi, Technion - Israel Institute of Technology, Israel
One Code Fits All: Strong Stuck-at Codes for Versatile Memory Encoding
Roni Con, Technion - Israel Institute of Technology, Israel; Ryan Gabrys, University of California San Diego, United States; Eitan Yaakobi, Technion - Israel Institute of Technology, Israel
Private Repair of a Single Erasure in Reed-Solomon Codes
Stanislav Kruglik, Han Mao Kiah, Nanyang Technological University, Singapore; Son Hoang Dau, RMIT University, Australia; Eitan Yaakobi, Technion, Israel
Lamda
A New Approach to Harnessing Side Information in Multi-Server Private Information Retrieval
Ningze Wang, Texas A&M University, United States; Anoosheh Heidarzadeh, Santa Clara University, United States; Alex Sprintson, Texas A&M University, United States
Achieving Capacity of PIR with Private Side Information with Low Sub-packetization and without MDS Codes
Leila Erhili, Anoosheh Heidarzadeh, Santa Clara University, United States
The Capacity of Symmetric Private Information Retrieval with Private Noisy Side Information
Hassan ZivariFard, Columbia University, United States; Rémi A. Chou, The University of Texas at Arlington, United States; Xiaodong Wang, Columbia University, United States
Dual-Source Symmetric PIR without Data Replication or Shared Randomness
Remi Chou, University of Texas at Arlington, United States
Thu, 11 Jul, 15:00 - 16:00
Thu, 11 Jul, 15:55 - 16:25
Thu, 11 Jul, 16:25 - 17:45
Ballroom II & III
An Information-Theoretic Framework for Out-of-Distribution Generalization
Wenliang Liu, Guanding Yu, Zhejiang University, China; Lele Wang, Renjie Liao, The University of British Columbia, Canada
A note on generalization bounds for losses with finite moments
Borja Rodríguez-Gálvez, KTH Royal Institute of Technology, Sweden; Omar Rivasplata, UCL, United Kingdom; Ragnar Thobaben, Mikael Skoglund, KTH Royal Institute of Technology, Sweden
Data-Dependent Generalization Bounds via Variable-size Compressibility
Milad Sefidgaran, Paris Research Center, Huawei Technologies France, France; Abdellatif Zaidi, Université Gustave Eiffel, France, France
Hierarchical Generalization Bounds for Deep Neural Networks
Haiyun He, Christina Lee Yu, Ziv Goldfeld, Cornell University, United States
Ypsilon I-II-III
Optimal Lower Bound of the Average Indeterminate Length Lossless Quantum Block Encoding
George Androulakis, Rabins Wosti, University of South Carolina, United States
Graph Neural Networks for Enhanced Decoding of Quantum LDPC Codes
Anqi Gong, ETH Zürich, Switzerland; Sebastian Cammerer, NVIDIA, Germany; Joseph Renes, ETH Zürich, Switzerland
A family of permutationally invariant quantum codes
Arda Aydin, University of Maryland, United States; Max Alekseyev, George Washington University, United States; Alexander Barg, University of Maryland, United States
Abelian Group Codes for Classical and CQ Channel Coding: One-shot and Asymptotic Rate Bounds
James (Chin-Jen) Pang, Marvell Technology, Inc., United States; S. Sandeep Pradhan, University of Michigan, United States; Hessam Mahdavifar, Northeastern University, United States
Ypsilon IV-V-VI
Sparsity-Based Secure Gradient Aggregation for Resource-Constrained Federated Learning
Hasin Us Sami, Basak Guler, University of California Riverside, United States
Secure Submodel Aggregation for Resource-Aware Federated Learning
Hasin Us Sami, Basak Guler, University of California Riverside, United States
On the Optimality of Secure Aggregation with Uncoded Groupwise Keys Against User Dropouts and User Collusion
Ziting Zhang, Jiayu Liu, Kai Wan, Huazhong University of Science and Technology, China; Hua Sun, University of North Texas, United States; Mingyue Ji, University of Utah, United States; Giuseppe Caire, Technische Universitat Berlin, Germany
Optimal Information Theoretic Secure Aggregation with Uncoded Groupwise Keys
Kai Wan, Huazhong University of Science and Technology, China; Hua Sun, University of North Texas, United States; Mingyue Ji, University of Utah, United States; Tiebin Mi, Huazhong University of Science and Technology, China; Giuseppe Caire, Technische Universitat Berlin, Germany
Omikron II
Statistic Maximal Leakage
Shuaiqi Wang, Carnegie Mellon University, United States; Zinan Lin, Microsoft Research, United States; Giulia Fanti, Carnegie Mellon University, United States
Binary Maximal Leakage
Robinson D. H. Cung, Yanina Y. Shkel, École Polytechnique Fédérale de Lausanne (EPFL), Switzerland and Ibrahim Issa, American University of Beirut
Maximal Guesswork Leakage
Gowtham R. Kurri, International Institute of Information Technology, Hyderabad, India, India; Malhar A. Managoli, Vinod M. Prabhakaran, Tata Institute of Fundamental Research, Mumbai, India, India
A Cross Entropy Interpretation of Rényi Entropy for $α$-leakage
Ni Ding, University of Auckland, New Zealand; Mohammad Amin Zarrabian, Australian National University, Australia; Parastoo Sadeghi, University of New South Wales, Canberra, Australia
Omikron I
Local Decoding in Distributed Approximate Computing
Deheng Yuan, Tsinghua University, China; Tao Guo, Southeast University, China; Zhongyi Huang, Tsinghua University, China; Shi Jin, Southeast University, China
Non-Binary Covering Codes for Low-Access Computations
Vinayak Ramkumar, Tel Aviv University, Israel; Netanel Raviv, Washington University in St. Louis, United States; Itzhak Tamo, Tel Aviv University, Israel
Rate-limited Shuffling for Distributed Computing
Shanuja Sasi, Onur Günlü, Linköping University, Sweden
On Decentralized Linearly Separable Computation With the Minimum Computation Cost
Haoning Chen, ShanghaiTech University, China; Minquan Cheng, Guangxi Normal University, China; Ziyu Zhang, Kai Liang, Zhenhao Huang, Youlong Wu, ShanghaiTech University, China
Sigma/Delta
Integrated Sensing and Communication in the Finite Blocklength Regime
Homa Nikbakht, Princeton University, United States; Michèle Wigger, Telecom Paris, France; Shlomo Shamai (Shitz), Technion, Israel; H. Vincent Poor, Princeton University, United States
On the Fundamental Tradeoff of Joint Communication and Quickest Change Detection
Daewon Seo, Daegu Gyeongbuk Institute of Science and Technology, Korea (South); Sung Hoon Lim, Hallym University, Korea (South)
Integrated Sensing and Communication Exploiting Prior Information: How Many Sensing Beams are Needed?
Chan Xu, Shuowen Zhang, The Hong Kong Polytechnic University, Hong Kong SAR of China
Beamforming Design for Integrated Sensing and Communications Using Uplink-Downlink Duality
Kareem M. Attiah, Wei Yu, University of Toronto, Canada
VIP
Error correction from partial information via norm-trace codes
Eduardo Camps-Moreno, Gretchen L. Matthews, Virginia Tech, United States; Welington Santos, University of Wisconsin-Stout, United States
Asymptotic construction of locally repairable codes with multiple recovering sets
Songsong Li, Shanghai Jiao Tong University, China; Shu Liu, University of Electronic Science and Technology of China, China; Liming Ma, University of Science and Technology of China, China; Yunqi Wan, Huawei Technology Co. Ltd., China; Chaoping Xing, University of Electronic Science and Technology of China, China
On ML Decoding of Binary Cyclic-gap Constant Weight Codes
Birenjith Sasidharan, Emanuele Viterbo, Monash University, Australia; Son Hoang Dau, RMIT University, Australia
An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes
Shubhransh Singhvi, International Institute of Information Technology - Hyderabad, India; Roni Con, Technion - Israel Institute of Technology, Israel; Han Mao Kiah, Nanyang Technological University, Singapore; Eitan Yaakobi, Technion - Israel Institute of Technology, Israel
Omega
Approximate Locally Decodable Codes with Constant Query Complexity and Nearly Optimal Rate
Geoffrey Mon, Dana Moshkovitz, Justin Oh, University of Texas at Austin, United States
Reverse PAC Codes: Look-ahead List Decoding
Xinyi Gu, Mohammad Rowshan, Jinhong Yuan, UNSW, Australia
Game of Coding: Beyond Trusted Majorities
Hanzaleh Akbari Nodehi, University of Minnesota, United States; Viveck R. Cadambe, Pennsylvania State University, United States; Mohammad Ali Maddah-Ali, University of Minnesota, United States
PoW Security-Latency and Transaction Rate
Mustafa Doger, Sennur Ulukus, University of Maryland, United States
Lamda
Weakly Private Information Retrieval from Heterogeneously Trusted Servers
Yu-Shin Huang, Wenyuan Zhao, Texas A&M University, United States; Ruida Zhou, University of California, Los Angeles, United States; Chao Tian, Texas A&M University, United States
A Capacity Result on Weakly-Private Information Retrieval
song chen, Haobo Jia, Zhuqing Jia, Beijing University of Posts and Telecommunications, China
Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval
Okko Makkonen, Aalto University, Finland; David Karpuk, WithSecure Corporation, Finland; Camilla Hollanti, Aalto University, Finland
Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack
Neehar Verma, Camilla Hollanti, Aalto University, School of Science, Finland
Thu, 11 Jul, 17:45 - 18:40
Thu, 11 Jul, 19:30 - 00:30
Fri, 12 Jul, 08:00 - 12:00
Fri, 12 Jul, 08:15 - 17:30
Fri, 12 Jul, 08:30 - 09:35
Fri, 12 Jul, 09:35 - 09:45
Fri, 12 Jul, 09:45 - 11:05
Ballroom II & III
CRYSTALS-Kyber With Lattice Quantizer
Shuiyin Liu, Holmes Institute, Australia; Amin Sakzad, Monash University, Australia
Network Coding-Based Post-Quantum Cryptography for Multi-Users with Different Security Permissions
Alejandro Cohen, Technion, Israel; Rafael G. L. D’Oliveira, Clemson University, United States
Optimum Fingerprinting Function for Winternitz One-Time Signature
Motonari Honda, Yuichi Kaji, Nagoya University, Japan
Exploiting signature leakages: breaking Enhanced pqsigRM
Thomas Debris-Alazard, Pierre Loisel, Inria Saclay, Laboratoire LIX, Ecole Polytechnique, France; Valentin Vasseur, Thales, France
Ypsilon I-II-III
An Improved Upper Bound for Distributed Hypothesis Testing
Yuval Kochman, HUJI, Israel
Practical Short-Length Coding Schemes for Binary Distributed Hypothesis Testing
Elsa Dupraz, Ismaila Salihou Adamou, IMT Atlantique, France; Reza Asvadi, Shahid Beheshti University, Iran; Tad Matsumoto, Japan Advanced Institute of Science and Technology, Japan
Sample Complexity of Locally Differentially Private Quantum Hypothesis Testing
Hao-Chung Cheng, National Taiwan University, Taiwan; Christoph Hirche, Technical University of Munich, Germany; Cambyse Rouzé, Institut Polytechnique de Paris, France
Optimal Distributed Quantizer Design for Binary Classification of Conditionally Independent Vector Sources
Sara Zendehboodi, Sorina Dumitrescu, McMaster University, Canada
Ypsilon IV-V-VI
Generalized concatenated polarization kernels
Petr Trifonov, ITMO University, Russia
Near-Optimal Generalized Decoding of Polar-like Codes
Peihong Yuan, MIT, United States; Ken Duffy, Northeastern University, United States; Muriel Médard, MIT, United States
Weight Structure of Low/High-Rate Polar Codes and Its Applications
Mohammad Rowshan, University of New South Wales (UNSW), Australia; Vlad-Florin Dragoi, Aurel Vlaicu University, Romania; Jinhong Yuan, University of New South Wales (UNSW), Australia
Finite-Length Analysis of Polar Secrecy Codes for Wiretap Channels
Hessam Mahdavifar, Northeastern University, United States; Fariba Abbasi, University of Michigan, United States
Omikron II
Soft Guessing Under Log-Loss Distortion Allowing Errors
Shota Saito, Gunma University, Japan
What can Information Guess ? Guessing Advantage vs. Rényi Entropy for Small Leakages
Julien Béguinot, Olivier Rioul, Télécom Paris, France
Feedback Capacity of Nonlinear Decision Models with General Noise: Gaussian Applications with Filtering and Control Riccati Equations
Charalambos Charalambous, Stelios Louka, University of Cyprus, Cyprus
Improved bounds on the interactive capacity via error pattern analysis
Mudit Aggarwal, University of British Columbia, Vancouver, Canada; Manuj Mukherjee, Indraprastha Institute of Information Technology Delhi, India
Omikron I
One-shot multiple access channel simulation
Aditya Nema, Sreejith Sreekumar, Mario Berta, RWTH Aachen University, Germany
Coded Many-User Multiple Access via Approximate Message Passing
Xiaoqi Liu, University of Cambridge, United Kingdom; Kuan Hsieh, Luminance Technologies Ltd, United Kingdom; Ramji Venkataramanan, University of Cambridge, United Kingdom
Many-user multiple access with random user activity
Xiaoqi Liu, Pablo Pascual Cobo, Ramji Venkataramanan, University Of Cambridge, United Kingdom
Compute-Forward Multiple Access for Gaussian Fast Fading Channels
Lanwei Zhang, Jamie Evans, Jingge Zhu, The University of Melbourne, Australia
Sigma/Delta
Efficient designs for threshold group testing without gap
Thach V. Bui, Yeow Meng Chee, Van Khu Vu, National University of Singapore, Singapore
Threshold Saturation for Quantitative Group Testing with Low-Density Parity-Check Codes
Mgeni Makambi Mashauri, Lund University, Sweden; Alexandre Graell I Amat, Chalmers University, Sweden; Michael Lentmaier, Lund University, Sweden
Quantitative Group Testing with Tunable Adaptation
Mahdi Soleymani, Tara Javidi, University of California San Diego, United States
Noise-Tolerant Codebooks for Semi-Quantitative Group Testing: Application to Spatial Genomics
Kok Hao Chen, Duc Tu Dao, Genome Institute of Singapore, Agency for Science, Technology and Research (A*STAR), Singapore; Han Mao Kiah, Van Long Phuoc Pham, School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore, Singapore; Eitan Yaakobi, Department of Computer Science, Technion — Israel Institute of Technology, Israel, Singapore
VIP
The Bethe Partition Function and the SPA for Factor Graphs based on Homogeneous Real Stable Polynomials
Yuwen Huang, Pascal Vontobel, The Chinese University of Hong Kong, Hong Kong SAR of China
Bounding Weakly Correlated Products from Below: Supermodularity is All You Need
Dimitris Achlioptas, University of Athens, Greece; Kostas Zampetakis, University of Warwick, United Kingdom
A Random CSP with Connections to Discrepancy Theory and Randomized Trials
Eren Kizildag, University of Illinois Urbana-Champaign, United States
An Encoder-Decoder Approach for Packing Circles
Akshay Kiran Jose, Gangadhar Karevvanavar, Rajshekhar V Bhat, IIT Dharwad, India
Omega
Differential-Privacy Capacity
Wael Alghamdi, Harvard University, United States; Shahab Asoodeh, McMaster University, Canada; Flavio P. Calmon, Harvard University, United States; Oliver Kosut, Lalitha Sankar, Arizona State University, United States
On the Extreme Points of the (0, δ)-Differential Privacy Polytope
Karan Elangovan, Varun Jog, University of Cambridge, United Kingdom
Achieving the Exactly Optimal Privacy-Utility Trade-Off with Low Communication Cost via Shared Randomness
Seung-Hyun Nam, Hyun-Young Park, Si-Hyeon Lee, KAIST, Korea (South)
Quantifying Privacy via Information Density
Leonhard Grosse, Sara Saeidian, KTH Royal Institute of Technology, Sweden; Parastoo Sadeghi, University of New South Wales, Australia; Tobias J. Oechtering, Mikael Skoglund, KTH Royal Institute of Technology, Sweden
Lamda
Nearest Neighbor Representations of Neural Circuits
Kordag Mehmet Kilic, California Institute of Technology, United States; Jin Sima, University of Illinois Urbana-Champaign, United States; Jehoshua Bruck, California Institute of Technology, United States
On the Non-Computability of Convex Optimization Problems
Holger Boche, Andrea Grigorescu, Technical University of Munich, Germany; Rafael F. Schaefer, Technische Universität Dresden, Germany; H. Vincent Poor, Princeton University, United States
A Mathematical Framework for Computability Aspects of Algorithmic Transparency
Holger Boche, Technical University of Munich, Germany; Adalbert Fono, Gitta Kutyniok, Ludwig-Maximilians-Universität München, Germany
Coded Computing Meets Quantum Circuit Simulation: Coded Parallel Tensor Network Contraction Algorithm
Jin Lee, Zheng Zhang, Haewon Jeong, Sofia Gonzalez-Garcia, University of California, Santa Barbara, United States
Fri, 12 Jul, 11:05 - 11:30
Fri, 12 Jul, 11:30 - 12:50
Ballroom II & III
Quantum Wiretap Channel Coding Assisted by Noisy Correlation
Minglai Cai, Universitat Autònoma de Barcelona, Spain; Andreas Winter, ICREA-Institució Catalana de Recerca i Estudis Avançats, Spain
Resource-Efficient Entanglement-Assisted Covert Communications over Bosonic Channels
Shi-Yuan Wang, Shang-Jen Su, Matthieu Bloch, Georgia Institute of Technology, United States
Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement
Soham Ghosh, Vladlen Galetsky, Technical University of Munich, Germany; Pol Julià Farré, Christian Deppe, Technical University of Braunschweig, Germany; Roberto Ferrara, Holger Boche, Technical University of Munich, Germany
New Security Proof of a Restricted High-Dimensional QKD Protocol
Hasan Iqbal, Walter Krawec, University of Connecticut, United States
Ypsilon I-II-III
One-Shot Coding over General Noisy Networks
Yanxiao Liu, Cheuk Ting Li, The Chinese University of Hong Kong, Hong Kong SAR of China
DoF Analysis for (M, N)-Channels through a Number-Filling Puzzle
Yue Bi, Yue Wu, Cunqing Hua, Shanghai Jiao Tong University, China
On the capacity region of some classes of interference channels
Amin Aminzadeh Gohari, Chandra NAIR, Jinpei Zhao, The Chinese University of Hong Kong, Hong Kong SAR of China
On Permutation Capacity Regions of Multiple-Access Channels
William Lu, Anuran Makur, Purdue University, United States
Ypsilon IV-V-VI
Break-Resilient Codes for Forensic 3D Fingerprinting
Canran Wang, Washington University in St. Louis, United States; Jin Sima, University of Illinois Urbana-Champaign, United States; Netanel Raviv, Washington University in St. Louis, United States
Near optimal constructions of frameproof codes
Miao Liu, Zengjiao Ma, Chong Shangguan, Shandong University, China
On the affine permutation group of certain decreasing Cartesian codes
Eduardo Camps Moreno, Hiram López, Virginia Tech, United States; Eliseo Sarmiento, Instituto Politécnico Nacional, Mexico; Ivan Soprunov, Cleveland State University, United States
Window Weight Limited Gray Codes And Robust Positioning Sequences
Yeow Meng Chee, Huimin Lao, Tien Long Nguyen, Van Khu Vu, National University of Singapore, Singapore
Omikron II
Proving Information Inequalities by Gaussian Elimination
Laigang Guo, Beijing Normal University, China; Raymond Yeung, The Chinese University of Hong Kong, China; Xiao-Shan Gao, Chinese Academy of Sciences, China
Properties of the Strong Data Processing Constant for Rényi Divergence
Lifu Jin, École Polytechnique Fédérale de Lausanne, Switzerland; Amedeo Roberto Esposito, Institute of Science and Technology Austria, Austria; Michael Gastpar, École Polytechnique Fédérale de Lausanne, Switzerland
Self Improvement of the McEliece-Yu Inequality
Andrei Tanasescu, Pantelimon-George Popescu, University Politehnica of Bucharest, Romania
A Poisson Decomposition for Information and the Information-Event Diagram
Cheuk Ting Li, The Chinese University of Hong Kong, Hong Kong SAR of China
Omikron I
Enhancing the Maximum Tolerable Number of Active Users for Unsourced Random Access
Shan Lu, Nagoya University, Japan; Hiroshi Kamabe, Gifu University, Japan
Enhanced ODMA with Channel Code Design and Pattern Collision Resolution for Unsourced Multiple Access
Jianxiang Yan, Guanghui Song, Ying Li, Zhaoji Zhang, Yuhao Chi, Xidian University, China
Worst-Case Per-User Error Bound for Asynchronous Unsourced Multiple Access
Jyun-Sian Wu, Pin-Hsun Lin, Marcel Mross, Eduard Jorswieck, Technische Universität Braunschweig, Germany
Unsourced Random Access in MIMO Quasi-Static Rayleigh Fading Channels with Finite Blocklength
Junyuan Gao, Yongpeng Wu, Shanghai Jiao Tong University, China; Giuseppe Caire, Technical University of Berlin, Germany; Wei Yang, Qualcomm Technologies, United States; Wenjun Zhang, Shanghai Jiao Tong University, China
Sigma/Delta
Sparsity-Constrained Community-Based Group Testing
Sarthak Jain, Martina Cardone, Soheil Mohajer, University of Minnesota, Twin Cities, United States
Group Testing with General Correlation Using Hypergraphs
Hesam Nikpey, Saswati Sarkar, Shirin Saeedi Bidokhti, University of Pennsylvania, United States
Isolate and then Identify: Rethinking Adaptive Group Testing
Hsin-Po Wang, Venkatesan Guruswami, UC Berkeley, United States
List-Decoding Separable Matrices for Non-Adaptive Combinatorial Group Testing
Jinping Fan, Shanghai Normal University, China; Yujie Gu, Kyushu University, Japan; Ying Miao, University of Tsukuba, Japan; Zhebin Yu, Hitachi Astemo, Ltd., Japan
VIP
Less than 1-Bit Control of an Unstable AR Process with 1--Bit Quantizers
Rachel Bonen, Asaf Cohen, Ben-Gurion University of the Negev, Israel
Detection of False Data Injection Attacks in Cyber-Physical Systems
Souvik Das, Avishek Ghosh, Debasish Chatterjee, Indian Institute of Technology Bombay, India
Coordination Coding with Causal Encoder for Vector-valued Witsenhausen Counterexample
Mengyuan Zhao, KTH Royal Institute of Technology, Sweden; Maël Le Treust, University of Rennes, France; Tobias Oechtering, KTH Royal Institute of Technology, Sweden
Coded Kalman Filtering over MIMO Gaussian Channels with Feedback
Barron Han, California Institute of Technology, United States; Oron Sabag, The Hebrew University of Jerusalem, Israel; Victoria Kostina, Babak Hassibi, California Institute of Technology, United States
Omega
HetDAPAC: Distributed Attribute-Based Private Access Control with Heterogeneous Attributes
Shreya Meel, Sennur Ulukus, University of Maryland, College Park, United States
Interactive Byzantine-Resilient Gradient Coding for General Data Assignments
Shreyas Jain, Luis Maßny, Christoph Hofmeister, Eitan Yaakobi, Rawad Bitar
On Securing Analog Lagrange Coded Computing from Colluding Adversaries
Rimpi Borah, Harshan Jagadeesh, Indian Institute of Technology Delhi, India
Lamda
Information Exchange is Harder with Noise at Source
Manuj Mukherjee, Indraprastha Institute of Information Technology Delhi, India; Ran Gelles, Bar Ilan University, Israel
Infodemic Source Detection: Enhanced Formulations with Information Flow
Chao Zhao, Zimeng Wang, City University of Hong Kong, Hong Kong SAR of China; Qiaoqiao Zhou, Chee Wei Tan, Nanyang Technological University, Singapore; Chung Chan, City University of Hong Kong, Hong Kong SAR of China
Computation in Server-Assisted Noisy Networks
Manuj Mukherjee, Indraprastha Institute of Information Technology Delhi, India; Ran Gelles, Bar Ilan University, Israel
The Benefit of More Bad Choices in Observational Learning
Pawan Poojary, Randall Berry, Northwestern University, United States
Fri, 12 Jul, 12:50 - 14:35
Fri, 12 Jul, 13:05 - 14:05
Fri, 12 Jul, 14:35 - 15:55
Ballroom II & III
Maximal α-Leakage for Quantum Privacy Mechanisms and Operational Meaning of Measured Rényi Capacity
Bo-Yu Yang, Hsuan Yu, Hao-Chung Cheng, National Taiwan University, Taiwan
Quantum Private Membership Aggregation
Alptug Aytekin, Mohamed Nomeir, Sennur Ulukus, University of Maryland, College Park, United States
Information Theoretic Analysis of a Quantum PUF
Kumar Nilesh, Technical University of Munich, Germany; Christian Deppe, Technical University of Braunschweig, Germany; Holger Boche, Technical University of Munich, Germany
An Information-Theoretic Approach to Anonymous Access Control
Alfredo De Santis, University of Salerno, Italy; Anna Lisa Ferrara, University of Molise, Italy; Barbara Masucci, University of Salerno, Italy; Giorgio Venditti, University of Molise, Italy
Ypsilon I-II-III
Nobody Expects a Differential Equation: Minimum Energy-Per-Bit for the Gaussian Relay Channel with Rank-1 Linear Relaying
Oliver Kosut, Arizona State University, United States; Michelle Effros, California Institute of Technology, United States; Michael Langberg, University of Buffalo, United States
Sliding Secure Symmetric Multilevel Diversity Coding
Tao Guo, Southeast University, China; Laigang Guo, Beijing Normal University, China; Yinfei Xu, Southeast University, China; Congduan Li, Sun Yat-sen University, China; Shi Jin, Southeast University, China; Raymond W. Yeung, The Chinese University of Hong Kong, Hong Kong SAR of China
Universal Source Encryption under Side-Channel Attacks
Yasutada Oohama, Bagus Santoso, University of Electro-Communications, Japan
Simultaneous Computation and Communication over MAC
Matthias Frey, The University of Melbourne, Australia; Igor Bjelaković, Fraunhofer Heinrich Hertz Institute, Germany; Michael Gastpar, École Polytechnique Fédérale de Lausanne, Switzerland; Jingge Zhu, The University of Melbourne, Australia
Ypsilon IV-V-VI
Generalized Gradient Flow Decoding and Its Tensor-Computability
Tadashi Wadayama, Lantian Wei, Nagoya Institute of Technology, Japan
Performance Analysis of Generalized Product Codes with Irregular Degree Distribution
Sisi Miao, Jonathan Mandelbaum, Karlsruhe Institute of Technology, Germany; Lukas Rapp, Massachusetts Institute of Technology, United States; Holger Jäkel, Laurent Schmalen, Karlsruhe Institute of Technology, Germany
Precoded Polar Product Codes
Mustafa Cemil Coskun, Nokia Bell Labs, United States
Bit-flipping Decoder Failure Rate Estimation for (v,w)-regular Codes
Alessandro Annechini, Alessandro Barenghi, Gerardo Pelosi, Politecnico di Milano, Italy
Omikron II
On the Optimality of Dictator functions and Isoperimetric Inequalities on Boolean Hypercubes
Zijie Chen, Chandra NAIR, The Chinese University of Hong Kong, Hong Kong SAR of China
Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining
Uri Erez, Tel Aviv University, Israel; Or Ordentlich, Hebrew University of Jerusalem, Israel; Shlomo Shamai (Shitz), Technion, Israel
A Quantitative Version of More Capable Channel Comparison
Donald Kougang-Yombi, Jan Hązła, AIMS Rwanda, Rwanda
An information-theoretic proof of the Shannon-Hagelbarger theorem
Venkat Anantharam, University of California at Berkeley, United States
Omikron I
On Semi-supervised Estimation of Discrete Distributions under f-divergences
Hasan Sabri Melihcan Erol, Lizhong Zheng, Massachusetts Institute of Technology, United States
Asymptotic Estimates for Spectral Estimators of Rotationally Invariant Matrices
Zhuohang He, University of Electronic Science and Technology of China, China; Junjie Ma, Chinese Academy of Sciences, China; Xiaojun Yuan, University of Electronic Science and Technology of China, China
Guaranteed Robust Large Precision Matrix Estimation Under t-distribution
Fengpei Li, Ziping Zhao, ShanghaiTech University, China
Second-Order Characterization of Minimax Parameter Estimation in Restricted Parameter Space
Tianren Peng, Xinyi Tong, Shao-Lun Huang, Tsinghua Shenzhen International Graduate School, China
Sigma/Delta
Exact Error Exponents for a Concatenated Coding Based Class of DNA Storage Codes
Yan Hao Ling, Jonathan Scarlett, National University of Singapore, Singapore
Performance Limits in 3D Localization via Molecular Diffusion
Flavio Zabini, University of Bologna, Italy; Barbara Masini, National Research Council (CNR), Italy
On Noisy Duplication Channels with Markov Sources
Brendon McBain, James Saunderson, Emanuele Viterbo, Monash University, Australia
On the Capacity of Channels with Markov Insertions, Deletions and Substitutions
Ruslan Morozov, Tolga Duman, Bilkent University, Turkey
VIP
Exact Graph Matching in Correlated Gaussian-Attributed Erdos-Renyi Model
Joonhyuk Yang, Hye Won Chung, Korea Advanced Institute of Science and Technology(KAIST), Korea (South)
Subgraph Matching via Partial Optimal Transport
Wen-Xin Pan, Isabel Haasler, Pascal Frossard, École polytechnique fédérale de Lausanne (EPFL), LTS4, Switzerland
Graph Reconstruction from Noisy Random Subgraphs
Andrew McGregor, University of Massachusetts Amherst, United States; Rik Sengupta, IBM Research, United States
Spectral Convergence of Simplicial Complex Signals
Purui Zhang, Xingchao Jian, Feng Ji, Wee Peng Tay, Bihan Wen, Nanyang Technological University, Singapore
Omega
E_gamma-Mixing Time
Behnoosh Zamanlooy, Shahab Asoodeh, McMaster University, Canada; Mario Diaz, Universidad Nacional Autónoma de México, Mexico; Flavio Calmon, Harvard University, United States
Multi-Task Private Semantic Communication
Amirreza Zamani, Sajad Daei, Tobias Oechtering, Mikael Skoglund, KTH Royal Institute of Technology, Sweden
A New Multi-receiver Authentication Scheme For General Access Structure
Jing Yang, Shu-Tao Xia, Tsinghua University, China; Xianfang Wang, CETC Cyberspace Security Technology Co.,Ltd., China; Can Xiang, South China Agricultural University, China; Fang-Wei Fu, Nankai University, China
Entropy-Achieving Compression with Private Local Decodability
Venkat Chandar, DE Shaw, United States; Aslan Tchamkerten, Telecom Paris, France; Shashank Vatedka, Indian Institute of Technology Hyderabad, India
Lamda
Modulo Sampling with 1-bit Side Information: Performance Guarantees in the Presence of Quantization
Neil Irwin Bernardo, University of the Philippines Diliman, Philippines; Shaik Basheeruddin Shah, Yonina Eldar, Weizmann Institute of Science, Israel
Preconditioned Gradient Descent for Sketched Mixture Learning
Joseph Gabet, CentraleSupélec, Université Paris Saclay, France; Maxime Ferreira Da Costa, CentraleSupélec, Université Paris-Saclay, France
Distributed Sampling for the Detection of Poisson Sources under Observation Erasures
Vanlalruata Ralte, Amitalok J. Budkuley, IIT Kharagpur, India; Stefano Rini, NYCU Taiwan, Taiwan
Overflow-Avoiding Memory AMP
Shunqi Huang, Japan Advanced Institute of Science and Technology, Japan; Lei Liu, Zhejiang University, China; Brian Kurkoski, Japan Advanced Institute of Science and Technology, Japan
Fri, 12 Jul, 15:00 - 16:00
Fri, 12 Jul, 15:55 - 16:25
Fri, 12 Jul, 16:25 - 17:45
Ballroom II & III
An Unconditionally Secure Encryption Protocol for Cloud Storage
Mohammad Moltafet, Hamid R. Sadjadpour, Zouheir Rezki, University of California Santa Cruz, United States
Wiretapped Commitment over Binary Channels
Anuj Kumar Yadav, EPFL, Switzerland; Manideep Mamindlapally, University of Amsterdam, Netherlands; Amitalok Budkuley, IIT Kharagpur, India
Error Correction Capabilities of Non-Linear Cryptographic Hash Functions
Alejandro Cohen, Technion, Israel; Rafael G. L. D’Oliveira, Clemson, United States
Ypsilon I-II-III
Generalization of LiNGAM that allows confounding
Joe Suzuki, Tian-Le Yang, Osaka University, Japan
Prediction with noisy expert advice
Alankrita Bhatt, Victoria Kostina, Caltech, United States
Batch Universal Prediction
Marco Bondaschi, Michael Gastpar, EPFL, Switzerland
Ypsilon IV-V-VI
Points-Polynomials Incidence Theorem with an Application to Reed-Solomon Codes
Itzhak Tamo, Tel-Aviv University, Israel
Explicit Subcodes of Reed–Solomon Codes that Efficiently Achieve List Decoding Capacity
Amit Berman, Yaron Shany, Samsung Semiconductor, Israel; Itzhak Tamo, Tel-Aviv University, Israel
Multiplicity assignments for Koetter-Vardy decoding. The case of traceability codes.
Marcel Fernandez, Josep Cotrina Navau, Universitat Politecnica de Catalunya, Spain
Quasi-OSD of Binary Image of RS Codes with Applications to JSCC
Xiangping Zheng, Qianfan Wang, Baodian Wei, Xiao Ma, Sun Yat-sen University, China
Omikron II
Dimensional discrete entropy power inequalities for log-concave random vectors
Matthieu Fradelizi, Lampros Gavalakis, Martin Rapaport, Univ Gustave Eiffel, Univ Paris Est Creteil, CNRS, LAMA UMR8050 F-77447, France
An entropic inequality in finite Abelian groups analogous to the unified Brascamp-Lieb and Entropy Power Inequality
Chin Wa (Ken) Lau, Chandra NAIR, The Chinese University of Hong Kong, Hong Kong SAR of China
Gaussian mixtures: convexity properties and CLT rates for the entropy and Fisher information
Alexandros Eskenazis, CNRS, Sorbonne Universite, France; Lampros Gavalakis, Gustave Eiffel University, France
McKean’s Conjecture Under the Log-Concavity Assumption
Yanlin Geng, Xidian University, China
Omikron I
Ziv–Merhav estimation for hidden-Markov processes
Nicholas Barnfield, Raphaël Grondin, McGill University, Canada; Gaia Pozzoli, CY Cergy Paris Université, France; Renaud Raquépas, New York University, United States
Parameter Estimation Based on Noisy Chaotic Signals in the Weak-Noise Regime
Neri Merhav, Technion - Israel Institute of Technology, Israel
Unbiased Estimating Equation on Inverse Divergence and Its Conditions
Masahiro Kobayashi, Kazuho Watanabe, Toyohashi University of Technology, Japan
Sigma/Delta
The Lattice-Input Discrete-Time Poisson Channel
Federico Bello, Álvaro Martín, Tatiana Rischewski, Gadiel Seroussi, Universidad de la República, Uruguay
Improved Bounds on the Number of Support Points of the Capacity-Achieving Input for Amplitude Constrained Poisson Channels
Luca Barletta, Politecnico di Milano, Italy; Alex Dytso, Qualcomm Flarion Technologies, United States; Shlomo Shamai (Shitz), Technion – Israel Institute of Technology, Israel
On the Coverage Required for Diploid Genome Assembly
Daanish Mahajan, Chirag Jain, Navin Kashyap, Indian Institute of Science, India
VIP
DIST-CURE: A Robust Distributed Learning Algorithm with Cubic Regularized Newton
Avishek Ghosh, Indian Institute of Technology, Bombay, India; Raj Kumar Maity, University of Massachusetts Amherst, United States; Arya Mazumdar, University of California, San Diego, United States
SignSGD-FV: Communication-Efficient Distributed Learning through Heterogeneous Edges
Chanho Park, POSTECH, Korea (South); H. Vincent Poor, Princeton University, United States; Namyoon Lee, Korea University, Korea (South)
Distributed Learning for Dynamic Congestion Games
Hongbo Li, Lingjie Duan, Singapore University of Technology and Design, Singapore
The Entrapment Problem in Random Walk Decentralized Learning
Zonghong Liu, Salim El Rouayheb, Rutgers University, United States; Matthew Dwyer, DEVCOM Army Research Laboratory, United States
Omega
Private Approximate Nearest Neighbor Search for Vector Database Querying
Sajani Vithana, Harvard University, United States; Martina Cardone, University of Minnesota, Minneapolis, United States; Flavio Calmon, Harvard University, United States
An Efficient, High-Rate Scheme for Private Information Retrieval over the Gaussian MAC
Or Elimelech, Asaf Cohen, Ben Gurion University, Israel
Equal Requests are Asymptotically Hardest for Data Recovery
Jüri Lember, Ago-Erik Riet, University of Tartu, Estonia
Lamda
Anomaly Search of a Hidden Markov Model
Levli Citron, Kobi Cohen, Ben-Gurion University of the Negev, Israel; Qing Zhao, Cornell University, United States
Numerical Stability of DFT Computation for Signals with Structured Support
Charantej Reddy Pochimireddy, Aditya Siripuram, IIT Hyderabad, India; Osgood Brad, Stanford university, India
Optimized Parameter Design for Channel State Information-Free Location Spoofing
Jianxiu Li, Urbashi Mitra, University of Southern California, United States
Sharp analysis of out-of-distribution error for "importance-weighted" estimators in the overparameterized regime
Kuo-Wei Lai, Vidya Muthukumar, Georgia Institute of Technology, United States