default search action
ISIT 2022: Espoo, Finland
- IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland, June 26 - July 1, 2022. IEEE 2022, ISBN 978-1-6654-2159-1
- Hoover H. F. Yin
, Harry W. H. Wong
Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix Codes. 1-6 - Felicitas Hörmann
Error-Erasure Decoding of Linearized Reed-Solomon Codes in the Sum-Rank Metric. 7-12 - Tadashi Wadayama:
Fully Analog Noise-Resilient Dynamical Systems Storing Binary Sequence. 13-18 - Ran Tamir, Neri Merhav:
Universal Decoding for the Typical Random Code and for the Expurgated Code. 19-24 - Alejandro Cohen, Muriel Médard, Shlomo Shamai Shitz:
Broadcast Approach Meets Network Coding for Data Streaming. 25-30 - Cheuk Ting Li:
The Undecidability of Network Coding with some Fixed-Size Messages and Edges. 31-36 - Jiaxin Qing
Enhancing the Decoding Rates of BATS Codes by Learning With Guided Information. 37-42 - Sagi Marcovich, Tuvi Etzion, Eitan Yaakobi:
Covering Sequences for ℓ-Tuples. 43-48 - Rebecca Golm, Mina Nahvi, Ryan Gabrys, Olgica Milenkovic:
The Gapped k-Deck Problem. 49-54 - Yunus Can Gültekin
Log-CCDM: Distribution Matching via Multiplication-free Arithmetic Coding. 55-60 - Sayantan Chakraborty, Arun Padakandla, Pranab Sen:
Centralised multi link measurement compression with side information. 61-66 - Hao Lou, Farzad Farnoud:
Universal Compression of Large Alphabets with Constrained Compressors. 67-72 - Tingting Zhu, Jifan Liang, Xiao Ma:
Ternary Convolutional LDGM Codes with Applications to Gaussian Source Compression. 73-78 - Eric Chitambar
The Communication Value of a Quantum Channel. 79-84 - Manideep Mamindlapally
Singleton bounds for entanglement-assisted classical and quantum error correcting codes. 85-90 - Masahito Hayashi:
Analytical calculation formulas for capacities of classical and classical-quantum channels. 91-96 - Mohamed Ridha Znaidi, Gaurav Gupta, Paul Bogdan:
Secure Distributed/Federated Learning: Prediction-Privacy Trade-Off for Multi-Agent System. 97-102 - Tayyebeh Jahani-Nezhad
SwiftAgg: Communication-Efficient and Dropout-Resistant Secure Aggregation for Federated Learning with Worst-Case Security Guarantees. 103-108 - Chun-Ying Hou, I-Hsiang Wang:
Fundamental Limits of Personalized Federated Linear Regression with Data Heterogeneity. 109-114 - Yunus Inan, Mert Kayaalp, Emre Telatar, Ali H. Sayed:
Social Learning under Randomized Collaborations. 115-120 - Tina Behnia, Ke Wang, Christos Thrampoulidis:
On how to avoid exacerbating spurious correlations when models are overparameterized. 121-126 - Hossein Taheri, Ramtin Pedarsani, Christos Thrampoulidis:
Asymptotic Behavior of Adversarial Training in Binary Linear Classification. 127-132 - Shelvia Wongso, Rohan Ghosh, Mehul Motani:
Understanding Deep Neural Networks Using Sliced Mutual Information. 133-138 - Mohammad Moltafet, Markus Leinonen, Marian Codreanu:
AoI in Source-Aware Preemptive M/G/1/1 Queueing Systems: Moment Generating Function. 139-143 - Muhammed Emrullah Ildiz, Orhan Tahir Yavascan, Elif Uysal
Query Age of Information: Optimizing AoI at the Right Time. 144-149 - Ali Maatouk, Mohamad Assaad, Anthony Ephremides:
Analysis of an Age-Dependent Stochastic Hybrid System. 150-155 - Peng Zou, Jin Zhang, Suresh Subramaniam:
Performance Modeling of Scheduling Algorithms in a Multi-Source Status Update System. 156-161 - Aviv Adler, Jennifer Tang, Yury Polyanskiy:
Efficient Representation of Large-Alphabet Probability Distributions via Arcsinh-Compander. 162-167 - Spencer Compton:
A Tighter Approximation Guarantee for Greedy Minimum Entropy Coupling. 168-173 - Yuta Nakahara
Probability Distribution on Rooted Trees. 174-179 - Yunqi Wan, Li Chen, Fangguo Zhang
Algebraic Chase Decoding of Elliptic Codes Through Computing the Gröbner Basis. 180-185 - Kao-Yueh Kuo
Comparison of 2D topological codes and their decoding performances. 186-191 - Liudmila Karakchieva, Peter Trifonov:
Dual-domain recursive SISO decoding of linear block codes. 192-197 - Yajuan Liu
Capacity-Achieving Constrained Codes with GC-Content and Runlength Limits for DNA Storage. 198-203 - Krishna Gopal Benerjee
On Homopolymers and Secondary Structures Avoiding, Reversible, Reversible-Complement and GC-balanced DNA Codes. 204-209 - Aditya Narayan Ravi, Alireza Vahid, Ilan Shomorony:
Capacity of the Shotgun Sequencing Channel. 210-215 - Brendon McBain
Finite-State Semi-Markov Channels for Nanopore Sequencing. 216-221 - Siming Sun, Michelle Effros:
Source Coding with Unreliable Side Information in the Finite Blocklength Regime. 222-227 - Ryo Nomura
Relationship Between Intrinsic Randomness with f-Divergence and Fixed-Length Source Coding. 228-233 - Zhuangfei Wu, Lin Bai, Lin Zhou:
Excess-Distortion Exponents for Successive Refinement Using Gaussian Codebooks. 234-239 - Omri Lev, Anatoly Khina
Universal Joint Source-Channel Coding Under an Input Energy Constraint. 240-245 - Mordecai J. Golin, Albert John L. Patupat:
Speeding Up AIFV-m Dynamic Programs by m-1 Orders of Magnitude. 246-251 - Jun-Kai You, Hao-Chung Cheng, Yen-Huan Li:
Minimizing Quantum Rényi Divergences via Mirror Descent with Polyak Step Size. 252-257 - Uzi Pereg, Johannes Rosenberger
Identification Over Quantum Broadcast Channels. 258-263 - Yeow Meng Chee, Duc Tu Dao, Long Nguyen Tien, Duy Hoang Ta, Van Khu Vu:
Run Length Limited de Bruijn Sequences for Quantum Communications. 264-269 - Yonglong Li, Christoph Hirche, Marco Tomamichel:
Sequential Quantum Channel Discrimination. 270-275 - Gowtham R. Kurri, Monica Welfert, Tyler Sypherd, Lalitha Sankar:
α-GAN: Convergence and Estimation Guarantees. 276-281 - Seyed Mohammadreza Mousavi Kalan, Mahdi Soltanolkotabi
Statistical Minimax Lower Bounds for Transfer Learning in Linear Binary Classification. 282-287 - Madison Lee, Shubhanshu Shekhar, Tara Javidi
Multi-Scale Zero-Order Optimization of Smooth Functions in an RKHS. 288-293 - Amedeo Roberto Esposito
From Generalisation Error to Transportation-cost Inequalities and Back. 294-299 - Jae Oh Woo:
Analytic Mutual Information in Bayesian Neural Networks. 300-305 - Hassan ZivariFard, Matthieu R. Bloch, Aria Nosratinia:
Covert Communication in the Presence of an Uninformed, Informed, and Coordinated Jammer. 306-311 - Qiaosheng Eric Zhang, Vincent Y. F. Tan:
Covert Communication with Mismatched Decoders. 312-317 - Shi-Yuan Wang, Tuna Erdogan, Matthieu R. Bloch:
Towards a Characterization of the Covert Capacity of Bosonic Channels under Trace Distance. 318-323 - Meng-Che Chang, Matthieu R. Bloch:
Covert Best Arm Identification of Stochastic Bandits. 324-329 - Ziv Aharoni, Dor Tsur, Haim H. Permuter:
Density Estimation of Processes with Memory via Donsker Vardhan. 330-335 - Qi Chen, Minquan Cheng, Baoming Bai:
Matroidal Entropy Functions: Constructions, Characterizations and Representations. 336-341 - Jiheon Woo, Chanhee Yoo, Young-Sik Kim, Yuval Cassuto, Yongjune Kim
Generalized Longest Repeated Substring Min-Entropy Estimator. 342-347 - Somya Singh, Fady Alajaji, Bahman Gharesifard:
Modeling Network Contagion Via Interacting Finite Memory Pólya Urns. 348-353 - Utkarsh Gupta, Hessam Mahdavifar:
A New Algebraic Approach for String Reconstruction from Substring Compositions. 354-359 - Serge Kas Hanna:
Coding for Trace Reconstruction over Multiple Channels with Vanishing Deletion Probabilities. 360-365 - Yingyin Pan, Jianghua Zhong, Dongdai Lin:
Nonsingularity of Galois Nonlinear Feedback Shift Registers. 366-371 - Vladimir Edemskiy
4-adic complexity of quaternary cyclotomic sequences and Ding-Helleseth sequences with period pq. 372-377 - Sima Naseri, Ali Dehghan, Amir H. Banihashemi:
On Average Number of Cycles in Finite-Length Spatially Coupled LDPC Codes. 378-383 - Xiaomeng Guo, Yongchao Wang:
Efficient ADMM Decoder for Non-binary LDPC Codes based on Bit Embedding Technique. 384-389 - Emily McMillon
Cycle-Free Windows of SC-LDPC Codes. 390-395 - Asma Maalaoui, Charly Poulliat, Iryna Andriyanova:
Geometric versus Probabilistic Shaping for Circular-QAM with Nonbinary LDPC Codes. 396-401 - Zhusheng Wang, Sennur Ulukus:
Communication Cost of Two-Database Symmetric Private Information Retrieval: A Conditional Disclosure of Multiple Secrets Perspective. 402-407 - Pengzhen Ke, Liang Feng Zhang:
Two-Server Private Information Retrieval with Result Verification. 408-413 - Anoosheh Heidarzadeh, Alex Sprintson:
The Role of Reusable and Single-Use Side Information in Private Information Retrieval. 414-419 - Xiang Zhang, Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
Fundamental Limits of Cache-aided Multiuser PIR: The Two-message Two-user Case. 420-425 - Fatih Furkan Yilmaz, Reinhard Heckel:
Regularization-wise double descent: Why it occurs and how to eliminate it. 426-431 - Chin Wa Ken Lau
Uniqueness of local maximizers for some non-convex log-determinant optimization problems using information theory. 432-437 - Changlong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski:
Sequential vs. Fixed Design Regrets in Online Learning. 438-443 - Philippe Jacquet, Gil I. Shamir, Wojciech Szpankowski:
Precise Minimax Regret for Logistic Regression. 444-449 - Anatoly Khina
Monotonicity of the Trace-Inverse of Covariance Submatrices and Two-Sided Prediction. 450-455 - Shahar Stein Ioushua, Ofer Shayevitz:
On the Number of Graphs with a Given Histogram. 456-461 - Akiharu Omae, Kazuho Watanabe
Approximate Empirical Bayes Estimation of the Regularization Parameter in ℓ1 Trend Filtering. 462-467 - Marco Bondaschi, Michael Gastpar:
Alpha-NML Universal Predictors. 468-473 - Michael Rudow, K. V. Rashmi:
Learning-Augmented Streaming Codes are Approximately Optimal for Variable-Size Messages. 474-479 - Moon Jeong Park, Jungseul Ok, Yo-Seb Jeon, Dongwoo Kim:
MetaSSD: Meta-Learned Self-Supervised Detection. 480-485 - Austin Warner, Georgios Fellouris:
CuSum for sequential change diagnosis. 486-491 - Bashar Huleihel, Oron Sabag
Capacity of the Trapdoor Channel with Delayed Feedback. 492-497 - Andrea Grigorescu, Holger Boche, Rafael F. Schaefer
Capacity of Finite State Channels with Feedback: Algorithmic and Optimization Theoretic Properties. 498-503 - Pranav Joshi, Amritakshya Purkayastha, Yihan Zhang
On the Capacity of Additive AVCs with Feedback. 504-509 - Ville Junnila
On the List Size in the Levenshtein's Sequence Reconstruction Problem. 510-515 - Yeow Meng Chee
Robust Locally Positioning Sequences and Codes: Capacity, Constructions and Applications. 516-521 - Shibsankar Das
New Family of Cross Z-Complementary Sequences With Large ZCZ Width. 522-527 - Minghui Yang, Shiyuan Qiang
The 4-Adic Complexity of Quaternary Sequences of Even Period With Ideal Autocorrelation. 528-531 - Zilong Wang, Qian Chen
An Upper Bound of the Set Size of Perfect Sequences with Optimal Cross-correlation. 532-535 - Min Zhu, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.:
Systematic Doping of SC-LDPC Codes. 536-541 - Farzane Amirzade, Daniel Panario, Mohammad-Reza Sadeghi:
Trade-Based LDPC Codes. 542-547 - Roxana Smarandache, Anthony Gómez-Fonseca, David G. M. Mitchell:
Using Minors to Construct Generator Matrices for Quasi-Cyclic LDPC Codes. 548-553 - Min Jang
A Design of Layered Decoding for QC-LDPC Codes Based on Reciprocal Channel Approximation. 554-559 - Sangwoo Hong, Heecheol Yang, Jungwoo Lee:
Byzantine Attack Identification in Distributed Matrix Multiplication via locally testable codes. 560-565 - Yue Bi, Philippe Ciblat, Michèle A. Wigger, Yue Wu:
DoF of a Cooperative X-Channel with an Application to Distributed Computing. 566-571 - Hongru Cao, Wei Yan, Sian-Jheng Lin, Weiming Zhang:
A New Coding Scheme for Matrix-Vector Multiplication via Universal Decodable Matrices. 572-577 - Prathamesh Mayekar, Shubham K. Jha
Wyner-Ziv compression is (almost) optimal for distributed optimization. 578-583 - Sourbh Bhadane, Aaron B. Wagner:
On One-Bit Quantization. 584-589 - Photios A. Stavrou, Marios Kountouris:
A Rate Distortion Approach to Goal-Oriented Communication. 590-595 - Adeel Mahmood, Aaron B. Wagner:
Lossy Compression with Universal Distortion. 596-601 - Adeel Mahmood, Aaron B. Wagner:
Minimax Rate-Distortion. 602-607 - Eric Lei, Hamed Hassani, Shirin Saeedi Bidokhti:
Neural Estimation of the Rate-Distortion Function for Massive Datasets. 608-613 - Ziqi Zhou, Onur Günlü, Rafael G. L. D'Oliveira, Muriel Médard, Parastoo Sadeghi, Rafael F. Schaefer
Rainbow Differential Privacy. 614-619 - Amirreza Zamani, Tobias J. Oechtering, Mikael Skoglund:
Bounds for Privacy-Utility Trade-off with Non-zero Leakage. 620-625 - Sara Saeidian, Giulia Cervia, Tobias J. Oechtering, Mikael Skoglund:
Pointwise Maximal Leakage. 626-631 - Ajaykrishnan Nageswaran:
Gaussian Data Privacy Under Linear Function Recoverability. 632-636 - Shu Hong, Lingjie Duan
Multi-user Privacy Cooperation Game by Leveraging Users' Service Flexibility. 637-642 - Saeede Enayati, Dennis L. Goeckel, Amir Houmansadr, Hossein Pishro-Nik:
Constrained Obfuscation to Thwart Pattern Matching Attacks. 643-648 - Maki Yoshida:
Hybrid Multiplicative Non-perfect Secret Sharing. 649-653 - Wei Cheng, Yi Liu, Sylvain Guilley, Olivier Rioul:
Attacking Masked Cryptographic Implementations: Information-Theoretic Bounds. 654-659 - Hiroki Koga:
Construction of the Visual Cryptography Scheme with the Maximum Relative Difference under a Strong General Access Structure. 660-665 - Irina E. Bocharova, Henk D. L. Hollmann, Karan Khathuria, Boris D. Kudryashov, Vitaly Skachek:
Coding with Cyclic PAM and Vector Quantization for the RLWE/MLWE Channel. 666-671 - Ziyi Chen, Shaocong Ma, Yi Zhou:
Accelerated Proximal Alternating Gradient-Descent-Ascent for Nonconvex Minimax Machine Learning. 672-677 - Yiling Luo, Xiaoming Huo, Yajun Mei:
The Directional Bias Helps Stochastic Gradient Descent to Generalize in Kernel Regression Models. 678-683 - Samir M. Perlaza, Gaetan Bisson
Empirical Risk Minimization with Relative Entropy Regularization: Optimality and Sensitivity Analysis. 684-689 - Ruida Zhou, Chao Tian, Tie Liu
Stochastic Chaining and Strengthened Information-Theoretic Generalization Bounds. 690-695 - Yiling Luo, Xiaoming Huo, Yajun Mei:
Implicit Regularization Properties of Variance Reduced Stochastic Mirror Descent. 696-701 - Ioannis Papageorgiou, Ioannis Kontoyiannis:
The Posterior Distribution of Bayesian Context-Tree Models: Theory and Applications. 702-707 - Lampros Gavalakis, Ioannis Kontoyiannis:
The Entropic Central Limit Theorem for Discrete Random Variables. 708-713 - Dimitris Achlioptas, Kostas Zampetakis:
A Simpler Proof of the Four Functions Theorem and Some New Variants. 714-717 - Martina Cardone, Alex Dytso, Cynthia Rush:
Entropic CLT for Order Statistics. 718-723 - Xu Wang
Smoothed InfoNCE: Breaking the log N Curse without Overshooting. 724-729 - Yijun Fan, Yanxiao Liu, Shenghao Yang:
Continuity of Link Scheduling Rate Region for Wireless Networks with Propagation Delays. 730-735 - Babak Badnava, Sravan Reddy Chintareddy, Morteza Hashemi:
QoE-Centric Multi-User mmWave Scheduling: A Beam Alignment and Buffer Predictive Approach. 736-741 - Ouyang Zhou, Junyuan Wang, Fuqiang Liu:
Average Downlink Rate Analysis for Clustered Cell-Free Networks with Access Point Selection. 742-747 - Xi Zhang, Qixuan Zhu, H. Vincent Poor:
Average Coverage Probability for Base-Station-to-UAV Communications Over 6G Multiple Access Wireless Networks. 748-753 - Daewon Seo, Yongjune Kim
Information and Energy Transmission with Wavelet-Reconstructed Harvesting Functions. 754-759 - Emirhan Gürpinar:
Symmetries in Linear Programming for Information Inequalities. 760-765 - Oisin Faust, Hamza Fawzi:
Strong Data Processing Inequalities via Sums of Squares. 766-771 - Laigang Guo, Raymond W. Yeung, Xiao-Shan Gao:
Proving Information Inequalities and Identities with Symbolic Computation. 772-777 - David Gamarnik, Eren C. Kizildag:
The Random Number Partitioning Problem: Overlap Gap Property and Algorithmic Barriers. 778-783 - Yu Tsunoda
Weak Superimposed Codes of Improved Asymptotic Rate and Their Randomized Construction. 784-789 - Maxim Goukhshtein, Stark C. Draper, Jeebak Mitra:
Rate-Energy Optimal Probabilistic Shaping Using Linear Codes. 790-795 - Michael X. Cao, Navneeth Ramakrishnan, Mario Berta, Marco Tomamichel:
One-Shot Point-to-Point Channel Simulation. 796-801 - Anisha Banerjee, Antonia Wachter-Zeh, Eitan Yaakobi:
Insertion and Deletion Correction in Polymer-based Data Storage. 802-807 - Ziyang Lu, Yiwei Zhang
t-Deletion-1-Insertion-Burst Correcting Codes. 808-813 - Evagoras Stylianou, Lorenz Welter, Rawad Bitar, Antonia Wachter-Zeh, Eitan Yaakobi:
Equivalence of Insertion/Deletion Correcting Codes for d-dimensional Arrays. 814-819 - Sarthak Jain, Martina Cardone, Soheil Mohajer:
Identifying Reliable Machines for Distributed Matrix-Vector Multiplication. 820-825 - Neophytos Charalambides, Hessam Mahdavifar, Mert Pilanci, Alfred O. Hero III:
Orthonormal Sketches for Secure Coded Regression. 826-831 - Jinbao Zhu
Generalized Lagrange Coded Computing: A Flexible Computation-Communication Tradeoff. 832-837 - Shahrzad Kiani, Stark C. Draper:
Successive Approximation for Coded Matrix Multiplication. 838-843 - Onur Günlü, Matthieu R. Bloch, Rafael F. Schaefer
Secure Joint Communication and Sensing. 844-849 - Antonino Favano, Luca Barletta, Alex Dytso:
On the Capacity Achieving Input of Amplitude Constrained Vector Gaussian Wiretap Channel. 850-855 - Holger Boche, Minglai Cai, Moritz Wiese:
Mosaics of Combinatorial Designs for Semantic Security on Quantum Wiretap Channels. 856-861 - Yasutada Oohama, Bagus Santoso:
A Framework for Shannon Ciphers under Side-Channel Attacks: a Strong Converse and More. 862-867 - Benjamin Aram Berendsohn, László Kozma
Group Testing with Geometric Ranges. 868-873 - Mira Gonen, Michael Langberg, Alex Sprintson:
Group Testing on General Set-Systems. 874-879 - Hesam Nikpey, Jungyeol Kim
Group Testing with Correlation via Edge-Faulty Graphs. 880-885 - Akhil Bhimaraju, Lav R. Varshney:
Scheduling Group Tests over Time. 886-891 - Christina Lee Yu:
Nonparametric Matrix Estimation with One-Sided Covariates. 892-897 - Bruce E. Hajek, Xiaohan Kang:
Maximum Likelihood Estimation of Optimal Receiver Operating Characteristic Curves From Likelihood Ratio Observations. 898-903 - Jingbo Liu:
Interaction Improves Two-party Nonparametric Pointwise Density Estimation. 904-909 - Prafulla Chandra
Missing Mass Estimation from Sticky Channels. 910-915 - Omur Ozel, Aylin Yener, Sennur Ulukus:
State Amplification and Masking While Timely Updating. 916-921 - Mohammad Hatami, Markus Leinonen, Zheng Chen, Nikolaos Pappas, Marian Codreanu:
Asymptotically Optimal On-Demand AoI Minimization in Energy Harvesting IoT Networks. 922-927 - Priyanka Kaswan, Sennur Ulukus:
Timely Gossiping with File Slicing and Network Coding. 928-933 - Melih Bastopcu
The Dissemination of Time-Varying Information over Networked Agents with Gossiping. 934-939 - Neri Merhav:
Reversing Jensen's Inequality for Information-Theoretic Analyses. 940-945 - Yinfei Xu, Guojun Chen
A New Proof of the Extremal Inequality. 946-950 - Chin Wa Ken Lau, Chandra Nair, David Ng
A mutual information inequality and some applications. 951-956 - Ian Zieder, Alex Dytso, Martina Cardone:
An MMSE Lower Bound via Poincaré Inequality. 957-962 - Hsin-Po Wang
PCR, Tropical Arithmetic, and Group Testing. 963-968 - Johan Chrisnata, Han Mao Kiah, Alexander Vardy, Eitan Yaakobi:
Bee Identification Problem for DNA Strands. 969-974 - Sankeerth Rao Karingula, Alexander Vardy, Mary Wootters:
Lower bounds on the redundancy of linear codes with disjoint repair groups. 975-979 - Hanwen Yao, Jinfeng Du, Alexander Vardy:
Polar Coded Modulation via Hybrid Bit Labeling. 980-985 - Luca G. Tallini, Nawaf Alqwaifly, Bella Bose:
Zero Deletion/Insertion Codes and Zero Error Capacity*. 986-991 - Van Long Phuoc Pham, Keshav Goyal, Han Mao Kiah:
Sequence Reconstruction Problem for Deletion Channels: A Complete Asymptotic Solution. 992-997 - Yotam Gershon, Yuval Cassuto:
Genomic Compression with Decoder Alignment under Single Deletion and Multiple Substitutions. 998-1003 - Wentu Song, Kui Cai, Tuan Thanh Nguyen
List-decodable Codes for Single-deletion Single-substitution with List-size Two. 1004-1009 - Anindya Bijoy Das, Aditya Ramamoorthy:
An Integrated Method to Deal with Partial Stragglers and Sparse Matrices in Distributed Computations. 1010-1015 - Kai Yuan, Youlong Wu:
Coded Wireless Distributed Computing via Interference Alignment. 1016-1021 - Xuan Guang, Yang Bai, Raymond W. Yeung:
An Improved Capacity Bound for Secure Network Function Computation. 1022-1027 - Marvin Xhemrishi, Rawad Bitar, Antonia Wachter-Zeh:
Distributed Matrix-Vector Multiplication with Sparsity and Privacy Guarantees. 1028-1033 - Sijie Li, Cheuk Ting Li:
Arithmetic Network Coding for Secret Sum Computation. 1034-1039 - Sergey Loyka, Neri Merhav:
The Secrecy Capacity of The Gaussian Wiretap Channel with Rate-Limited Help at the Decoder. 1040-1045 - Neri Merhav:
Encoding Individual Sequences for the Wiretap Channel. 1046-1051 - Aria Nouri
Matched Information Rate Codes for Binary-Input Intersymbol Interference Wiretap Channels. 1052-1057 - Masahito Hayashi, Naqueeb Ahmad Warsi:
Commitment capacity of classical-quantum channels. 1058-1063 - Tania Sidana, Navin Kashyap:
Entanglement-Assisted Quantum Error-Correcting Codes over Local Frobenius Rings. 1064-1069 - Shikha Patel, Om Prakash
Quantum codes construction from skew polycyclic codes. 1070-1075 - Uzi Pereg, Christian Deppe, Holger Boche:
The Quantum MAC with Cribbing Encoders. 1076-1081 - Thach V. Bui, Yeow Meng Chee
Group Testing with Blocks of Positives. 1082-1087 - Javad Zahedi Moghaddam, Mohammad Esmaeili, Aria Nosratinia:
Exact Recovery Threshold in Dynamic Binary Censored Block Model. 1088-1093 - Xiao-Nan Lu
Error-Correcting Locating Arrays for Interaction Fault Location in Combinatorial Testing. 1094-1099 - Banghua Zhu, Jiantao Jiao, Michael I. Jordan:
Robust Estimation for Non-parametric Families via Generative Adversarial Networks. 1100-1105 - Adrien Vandenbroucque, Amedeo Roberto Esposito
Lower-bounds on the Bayesian Risk in Estimation Procedures via f-Divergences. 1106-1111 - Jesús Gutiérrez-Gutiérrez, Adam Podhorski
The Pisarenko spectral estimation method: Extension to AR vector processes. 1112-1114 - Aditya Deshmukh, Jing Liu, Venugopal V. Veeravalli:
Robust Mean Estimation in High Dimensions: An Outlier Fraction Agnostic and Efficient Algorithm. 1115-1120 - Aniruddha Phatak, Mahesh K. Varanasi:
An improved coded caching scheme for partially cooperative D2D networks. 1121-1126 - Aniruddha Phatak, Mahesh K. Varanasi:
An improved lower bound for device-to-device coded caching. 1127-1132 - Yinbin Ma, Daniela Tuninetti:
On Coded Caching Systems with Offline Users. 1133-1138 - Federico Brunero, Petros Elia:
Coded Caching Does Not Generally Benefit From Selfish Caching. 1139-1144 - Yanqing Liu, Yanlin Geng:
Blahut-Arimoto Algorithms for Computing Capacity Bounds of Broadcast Channels. 1145-1150 - Yuhang Yao, Syed Ali Jafar:
Capacity of 3-user Linear Computation Broadcast over Fq with 1D Demand and Side-Information. 1151-1156 - Neha Sangwan, Varun Narayanan, Vinod M. Prabhakaran:
Byzantine Consensus Over Broadcast Channels. 1157-1162 - Ziao Wang, Ning Zhang, Weina Wang, Lele Wang:
On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment. 1163-1168 - Iryna Andriyanova, Charly Poulliat:
Analysis of Non-Binary High-Rate Repetition-Parity-Parity Codes Over the BEC. 1169-1174 - Ting-Chun Lin, Min-Hsiu Hsieh
c3-Locally Testable Codes from Lossless Expanders. 1175-1180 - D. Shivakrishna, V. Lalitha:
Some Results on Maximally Recoverable Codes with Locality and Hierarchical Locality. 1181-1186 - Nikolajs Skuratovs, Mike E. Davies:
Warm-Starting in Message Passing algorithms. 1187-1192 - Emna Ben Yacoub, Balázs Matuz:
Analysis of Symbol Message Passing LDPC Decoder for the Poisson PPM Channel. 1193-1198 - Semih Akbayrak, Ismail Senöz, Bert de Vries:
Adaptive Importance Sampling Message Passing. 1199-1204 - Sisi Miao, Lukas Rapp, Laurent Schmalen:
Error-and-erasure Decoding of Product and Staircase Codes with Simplified Extrinsic Message Passing. 1205-1210 - Okko Makkonen
Analog Secure Distributed Matrix Multiplication over Complex Numbers. 1211-1216 - Elahe Vedadi, Yasaman Keshtkarjahromi, Hulya Seferoglu:
Adaptive Gap Entangled Polynomial Coding for Multi-Party Computation at the Edge. 1217-1222 - Rémi A. Chou
Function Computation Without Secure Links: Information and Leakage Rates. 1223-1228 - Jingzhen Hu, Qingzhong Liang, A. Robert Calderbank:
Co-design of CSS Codes and Diagonal Gates. 1229-1234 - David Hunn, Willie K. Harrison:
Subspace Decomposition of Extreme-Rate Secrecy Codes. 1235-1240 - Ali Bereyhi, Bruno Loureiro, Florent Krzakala
Secure Coding via Gaussian Random Fields. 1241-1246 - Siddharth Sankar Acharjee, Arpan Chattopadhyay:
Controller Manipulation Attack on Reconfigurable Intelligent Surface Aided Wireless Communication. 1247-1252 - Joakim Algrøy, Angela I. Barbero, Øyvind Ytrehus:
Determining the equivocation in coded transmission over a noisy channel. 1253-1258 - Haibo Yang, Peiwen Qiu, Jia Liu, Aylin Yener:
Over-the-Air Federated Learning with Joint Adaptive Computation and Power Control. 1259-1264 - Selim F. Yilmaz, Burak Hasircioglu, Deniz Gündüz:
Over-the-Air Ensemble Inference with Model Privacy. 1265-1270 - Nitish Mital, Deniz Gündüz:
Bandwidth Expansion for Over-the-Air Computation with One-Sided CSI. 1271-1276 - Yujia Mu, Cong Shen, Yonina C. Eldar:
Optimizing Federated Averaging over Fading Channels. 1277-1281 - Arian Eamaz
Generalized Probability Density Function Estimation via Convex Optimization. 1282-1287 - Farzad Pourkamali, Nicolas Macris:
Mismatched Estimation of Non-Symmetric Rank-One Matrices Under Gaussian Noise. 1288-1293 - George V. Moustakides:
Data-Driven Parameter Estimation. 1294-1299 - Jinyu Wang, Minquan Cheng, Kai Wan, Giuseppe Caire:
A Novel Framework for Coded Caching via Cartesian Product with Reduced Subpacketization. 1300-1305 - Xianzhang Wu
Design of Coded Caching Schemes through Proper Orthogonal Arrays. 1306-1311 - Xinyu Xie, Kai Huang, Jinbei Zhang, Shushi Gu, Qinyu Zhang
Coded Caching in Satellite Networks. 1312-1317 - Hao-Chung Cheng, Li Gao:
Error Exponent and Strong Converse for Quantum Soft Covering. 1318-1323 - Yihan Zhang
Lower Bounds on List Decoding Capacity using Error Exponents. 1324-1329 - Mohsen Heidari, Achilleas Anastasopoulos, S. Sandeep Pradhan:
Upper Bounds on the Feedback Error Exponent of Channels With States and With Memory. 1330-1335 - Lin Bai, Jun Diao, Lin Zhou:
Achievable Error Exponents for Almost Fixed-Length Binary Classification. 1336-1341 - Chen Wang, Ziyang Lu, Zhaojun Lan, Gennian Ge, Yiwei Zhang
Coding schemes for locally balanced constraints. 1342-1347 - Keshav Goyal, Han Mao Kiah:
Evaluating the Gilbert-Varshamov Bound for Constrained Systems. 1348-1353 - Yi Liu, Yonglong Li, Pengfei Huang, Paul H. Siegel:
Rate-Constrained Shaping Codes for Finite-State Channels With Cost. 1354-1359 - Jonathan Keeler, Tamás Linder, Serdar Yüksel:
An Asymptotically Optimal Two-Part Coding Scheme for Networked Control under Fixed-Rate Constraints. 1360-1365 - Keigo Takeuchi:
On the Convergence of Orthogonal/Vector AMP: Long-Memory Message-Passing Strategy. 1366-1371 - Tianqi Hou, Yuhao Liu, Teng Fu, Jean Barbier:
Sparse superposition codes under VAMP decoding with generic rotational invariant coding matrices. 1372-1377 - Lei Liu
Sufficient Statistic Memory Approximate Message Passing. 1378-1383 - Lei Liu
Capacity Optimality of OAMP in Coded Large Unitarily Invariant Systems. 1384-1389 - Kai Wan, Minquan Cheng, Dequan Liang, Giuseppe Caire:
Multiaccess Coded Caching with Private Demands. 1390-1395 - Ali Gholami
Coded Caching With Private Demands and Caches. 1396-1401 - Elizabath Peter, K. K. Krishnan Namboodiri, B. Sundar Rajan:
A Secretive Coded Caching for Shared Cache Systems using Placement Delivery Arrays. 1402-1407 - Parthajit Mohapatra:
Secure Communication Over 2-User Gaussian Interference Channel with Caching. 1408-1413 - Erixhen Sula, Michael Gastpar:
Shannon Bounds on Lossy Gray-Wyner Networks. 1414-1419 - Tharindu Adikari, Stark C. Draper:
Two-terminal source coding with common sum reconstruction. 1420-1424 - Millen Kanabar
Multi-User Random Coding Techniques for Mismatched Rate-Distortion Theory. 1425-1429 - Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten:
Locally Decodable Slepian-Wolf Compression. 1430-1435 - Simeng Yuan, Wei Yu, Kunpeng Wang, Xiuxiu Li:
Partial Key Exposure Attacks on RSA with Moduli N=prqs. 1436-1440 - Paolo Santini, Marco Baldi, Franco Chiaraluce:
A Novel Attack to the Permuted Kernel Problem. 1441-1446 - Yujie Gu, Sonata Akao, Navid Nasr Esfahani, Ying Miao, Kouichi Sakurai:
On the Security Properties of Combinatorial All-or-nothing Transforms. 1447-1452 - Changhun Jo, Jy-yong Sohn, Kangwook Lee:
Breaking Fair Binary Classification with Optimal Flipping Attacks. 1453-1458 - Loïc Bidoux, Philippe Gaborit, Mukul Kulkarni, Nicolas Sendrier:
Quasi-Cyclic Stern Proof of Knowledge. 1459-1464 - Leighton Pate Barnes, Alex Dytso, H. Vincent Poor:
Improved Information Theoretic Generalization Bounds for Distributed and Federated Learning. 1465-1470 - Michal Yemini, Rajarshi Saha, Emre Ozfatura, Deniz Gündüz, Andrea J. Goldsmith:
Semi-Decentralized Federated Learning with Collaborative Relaying. 1471-1476 - Mehrdad Pournaderi, Yu Xiang:
Communication-Efficient Distributed Multiple Testing for Large-Scale Inference. 1477-1482 - Doyeon Kim, Jeonghwan Lee, Hye Won Chung:
A Generalized Worker-Task Specialization Model for Crowdsourcing: Optimal Limits and Algorithm. 1483-1488 - Tianren Peng, Weida Wang, Shao-Lun Huang:
A Mathematical Framework to Characterize the Dependency Structures in Multimodal Learning with Minimax Principle. 1489-1494 - Pawan Poojary, Randall Berry:
Observational Learning with Negative Externalities. 1495-1496 - Yaniv Fogel, Meir Feder:
Another Look at Universal Individual Learning. 1501-1505 - Endrit Dosti, Sergiy A. Vorobyov, Themistoklis Charalambous:
Generalizing Nesterov's Acceleration Framework by Embedding Momentum Into Estimating Sequences: New Algorithm and Bounds. 1506-1511 - Anjana Ambika Mahesh, B. Sundar Rajan:
Space Time Codes in Multi-Antenna Coded Caching Systems. 1512-1517 - K. K. Krishnan Namboodiri, Elizabath Peter, B. Sundar Rajan:
Extended Placement Delivery Arrays for Multi-Antenna Coded Caching Scheme. 1518-1523 - Ting Yang, Kai Wan, Minquan Cheng, Giuseppe Caire:
Multiple-antenna Placement Delivery Array for Cache-aided MISO Systems. 1524-1529 - Holger Boche, Christian Deppe:
Computability of the Channel Reliability Function and Related Bounds1. 1530-1535 - Cheuk Ting Li:
First-Order Theory of Probabilistic Independence and Single-Letter Characterizations of Capacity Regions. 1536-1541 - Lei Yu, Venkat Anantharam:
Sequential Channel Synthesis. 1542-1547 - Wafa Labidi, Rami Ezzine, Christian Deppe, Holger Boche:
Common Randomness Generation from Gaussian Sources. 1548-1553 - Allison Beemer, Rutuja Kshirsagar, Gretchen L. Matthews
Graph-based codes for hierarchical recovery. 1554-1559 - Adway Patra, Alexander Barg:
Interior-point regenerating codes on graphs. 1560-1565 - Hongna Yang, Yiwei Zhang
On an extremal problem of regular graphs related to fractional repetition codes. 1566-1571 - Luying Li, Wei Yu, Minzhong Luo:
Deterministic Encoding into Generalized Huff curves. 1572-1577 - Vinayak Ramkumar, M. Nikhil Krishnan, Myna Vajha, P. Vijay Kumar:
On Information-Debt-Optimal Streaming Codes With Small Memory. 1578-1583 - Hoover H. F. Yin
Packet Size Optimization for Batched Network Coding. 1584-1589 - Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan:
Coding Size of Traffic Partition in Switch Memories. 1590-1595 - Ray Li, Mary Wootters:
Improved batch code lower bounds. 1596-1599 - Holger Boche, Ullrich J. Mönich, Yannik N. Böck:
Computing Upper and Lower Bounds for the Bandwidth of Bandlimited Signals. 1600-1605 - Dorian Florescu, Ayush Bhandari:
Unlimited Sampling via Generalized Thresholding. 1606-1611 - Xiao Lv, Wei Cui, Yulong Liu:
Time-Data Tradeoffs in Structured Signals Recovery via the Proximal-Gradient Homotopy Method. 1612-1616 - Karan Srivastava, Daniel L. Pimentel-Alarcón:
A Perturbation Bound on the Subspace Estimator from Canonical Projections. 1617-1622 - Sahel Torkamani, Javad B. Ebrahimi, Parastoo Sadeghi, Rafael G. L. D'Oliveira, Muriel Médard:
Heterogeneous Differential Privacy via Graphs. 1623-1628 - Jasper Goseling, Milan Lopuhaä-Zwakenberg
Robust Optimization for Local Differential Privacy. 1629-1634 - Wenxin Ding, Gautam Kamath
Calibration with Privacy in Peer Review. 1635-1640 - Netanel Raviv, Rawad Bitar, Eitan Yaakobi:
Information Theoretic Private Inference in Quantized Models. 1641-1646 - Nir Weinberger, Michal Yemini:
Upper Confidence Interval Strategies for Multi-Armed Bandits with Entropy Rewards. 1647-1652 - Maximilian Egger, Rawad Bitar, Antonia Wachter-Zeh, Deniz Gündüz:
Efficient Distributed Machine Learning via Combinatorial Multi-Armed Bandits. 1653-1658 - Ahmadreza Moradipari, Mohammad Ghavamzadeh, Taha Rajabzadeh, Christos Thrampoulidis, Mahnoosh Alizadeh:
Multi-Environment Meta-Learning in Stochastic Linear Bandits. 1659-1664 - Francesco Pase, Deniz Gündüz, Michele Zorzi:
Remote Contextual Bandits. 1665-1670 - Abram Magner, Amith Kumar Singh:
Local Limit Theorems for Approximate Maximum Likelihood Estimation of Network Information Spreading Models. 1671-1676 - Christopher Rose:
Hide and Seek On A Budget. 1677-1682 - Sajjad Bahrami, Ertem Tuncel:
Challenging the Deployment of Fiducial Points in Minimum Error Entropy. 1683-1688 - Toshiaki Koike-Akino, Ye Wang:
AutoVAE: Mismatched Variational Autoencoder with Irregular Posterior-Prior Pairing. 1689-1694 - Nir Weinberger, Meir Feder:
On Information-Theoretic Determination of Misspecified Rates of Convergence. 1695-1700 - Federico Brunero, Petros Elia:
The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial Topology. 1701-1706 - Mingming Zhang
Coded Caching for Two-Dimensional Multi-Access Networks. 1707-1712 - K. K. Krishnan Namboodiri, B. Sundar Rajan:
An Improved Lower Bound for Multi-Access Coded Caching. 1713-1718 - Niladri Das, B. Sundar Rajan:
Multi-Access Coded Caching Schemes from Maximal Cross Resolvable Designs. 1719-1724 - Zhen-Ming Huang, Cheng-Yu Pai
A Novel Construction of Optimal Cross Z-Complementary Sets Based on Generalized Boolean Functions. 1725-1730 - Payam Delgosha, Hamed Hassani, Ramtin Pedarsani:
Binary Classification Under ℓ0 Attacks for General Noise Distribution. 1731-1736 - Maxime Ferreira Da Costa, Urbashi Mitra:
On the Stability of Super-Resolution and a Beurling-Selberg Type Extremal Problem. 1737-1742 - Jiaxin Wang, Fang-Wei Fu:
Three New Constructions of 5-valued Spectrum Functions with Totally Disjoint Spectra Duals. 1743-1748 - Dor Elimelech, Hengjia Wei, Moshe Schwartz:
On the Generalized Covering Radii of Reed-Muller Codes. 1749-1754 - V Arvind Rameshwar
On the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS Channels. 1755-1760 - Lakshmi Prasad Natarajan, Prasad Krishnan:
Berman Codes: A Generalization of Reed-Muller Codes that Achieve BEC Capacity. 1761-1766 - Mohammad Rowshan
Constrained Error Pattern Generation for GRAND. 1767-1772 - Ioannis Chatzigeorgiou
Transversal GRAND for Network Coded Data. 1773-1778 - Alejandro Cohen, Rafael G. L. D'Oliveira, Ken R. Duffy
Partial Encryption after Encoding for Security and Reliability in Data Systems. 1779-1784 - Praneeth Kumar Vippathalla
The Secure Storage Capacity of a DNA Wiretap Channel Model. 1785-1790 - Tuan Thanh Nguyen
Optimal Single Chromosome-Inversion Correcting Codes for Data Storage in Live DNA. 1791-1796 - Yuanyuan Tang, Shuche Wang, Ryan Gabrys, Farzad Farnoud:
Correcting multiple short duplication and substitution errors. 1797-1802 - Nir Weinberger, Neri Merhav:
The DNA Storage Channel: Capacity and Error Probability Bounds. 1803-1808 - Hengjia Wei, Moshe Schwartz:
Perfect Codes Correcting a Single Burst of Limited-Magnitude Errors. 1809-1814 - Baris Can Esmer
On (1 + ϵ)-Approximate Block Sparse Recovery. 1815-1820 - Kumar Vijay Mishra, Samuel Pinilla, Ali Pezeshki, A. Robert Calderbank:
Group-Theoretic Wideband Radar Waveform Design. 1821-1825 - Sihan Mao, Jinchi Chen:
Blind Super-Resolution via Projected Gradient Descent. 1826-1831 - Mohamad Rida Rammal, Suhas N. Diggavi, Ashutosh Sabharwal:
3D Orientation Estimation With Configurable Backscatter Arrays. 1832-1837 - Wael Alghamdi, Shahab Asoodeh, Flávio P. Calmon
Cactus Mechanisms: Optimal Differential Privacy Mechanisms in the Large-Composition Regime. 1838-1843 - Berivan Isik, Tsachy Weissman:
Learning under Storage and Privacy Constraints. 1844-1849 - Netanel Raviv, Ziv Goldfeld:
Perfect Subset Privacy for Data Sharing and Learning. 1850-1855 - Di Wang, Jinhui Xu:
Differentially Private ℓ1-norm Linear Regression with Heavy-tailed Data. 1856-1861 - Ke Li, Yongsheng Yao, Masahito Hayashi:
Exponents in smoothing the max-relative entropy and of randomness extraction against quantum side information. 1862-1867 - Mohammad Aamir Sohail, Touheed Anwar Atif, S. Sandeep Pradhan:
Unified approach for computing sum of sources over CQ-MAC. 1868-1873 - Omar Amer, Walter O. Krawec:
High-Dimensional Quantum Conference Key Agreement. 1874-1879 - Yu-Chen Shen, Li Gao, Hao-Chung Cheng:
Strong Converse for Privacy Amplification against Quantum Side Information. 1880-1885 - Yi Wei, Zixin Zhong, Vincent Y. F. Tan, Chan Wang:
Fast Beam Alignment via Pure Exploration in Multi-armed Bandits. 1886-1891 - Duo Cheng, Ruiquan Huang, Cong Shen, Jing Yang:
Cascading Bandits with Two-Level Feedback. 1892-1896 - Arpan Mukherjee, Ali Tajer:
SPRT-based Best Arm Identification in Stochastic Bandits. 1897-1902 - Fei Sha, Ruizhi Zhang:
Quickest Detection of the Change of Community via Stochastic Block Models. 1903-1908 - Liyan Xie:
Minimax Robust Quickest Change Detection using Wasserstein Ambiguity Sets. 1909-1914 - Qunzhi Xu, Yajun Mei:
Active Quickest Detection When Monitoring Multi-streams with Two Affected Streams. 1915-1920 - Georgios Fellouris, Venugopal V. Veeravalli:
Quickest Change Detection with Controlled Sensing. 1921-1926 - Yu Chen
Optimal Shaping Gains for Continuous Spectrum Nonlinear Frequency Signalling over Long Fibers. 1927-1932 - Mohammadamin Baniasadi, Yu Chen, Majid Safari:
On the Capacity of b-Modulated Nonlinear Frequency Division Multiplexing. 1933-1938 - Sufang Yang, Longguang Li, Jintao Wang:
Diversity-Multiplexing Tradeoff Analysis on Block Fading Optical Wireless Channels. 1939-1944 - Oliver Kosut, Michelle Effros, Michael Langberg:
On the Benefit of Cooperation in Relay Networks. 1945-1950 - Gustavo Kasper Facenda, Elad Domanovitz, M. Nikhil Krishnan, Ashish Khisti, Silas L. Fong, Wai-Tian Tan, John G. Apostolopoulos:
On State-Dependent Streaming Erasure Codes over the Three-Node Relay Network. 1951-1956 - Shubhransh Singhvi, Gayathri R., P. Vijay Kumar:
Rate-Optimal Streaming Codes Over the Three-Node Decode-And-Forward Relay Network. 1957-1962 - James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan:
New Bounds on the Size of Binary Codes with Large Minimum Distance. 1963-1968 - Yang Xu, Haibin Kan, Guangyue Han:
Minimal Length of Nontrivial Solutions of the Isometry Equation and MacWilliams Extension Property with Respect to Weighted Poset Metric. 1969-1974 - Yang Xu, Haibin Kan, Guangyue Han:
Fourier-Reflexive Partitions and Group of Linear Isometries with Respect to Weighted Poset Metric. 1975-1980 - Henk D. L. Hollmann:
Non-standard linear recurring sequence subgroups and automorphisms of irreducible cyclic codes. 1981-1986 - Jennifer Tang, Yury Polyanskiy:
Capacity of Noisy Permutation Channels. 1987-1992 - Min-Oh Jeong, Martina Cardone, Alex Dytso:
On the Ranking Recovery from Noisy Observations up to a Distortion. 1993-1998 - Akira Kamatsuka
A Generalization of the Stratonovich's Value of Information and Application to Privacy-Utility Trade-off. 1999-2004 - Theshani Nuradha, Ziv Goldfeld:
An Information-Theoretic Characterization of Pufferfish Privacy. 2005-2010 - Kanishak Vaidya
Private Information Delivery with Coded Storage. 2011-2015 - Ateet Devulapalli, Viveck R. Cadambe
Differentially Private Distributed Matrix Multiplication: Fundamental Accuracy-Privacy Trade-Off Limits. 2016-2021 - Mohamed S. Nafea, Eugine Shin, Aylin Yener:
Proportional Fair Clustered Federated Learning. 2022-2027 - Yuchang Sun, Jiawei Shao, Songze Li, Yuyi Mao, Jun Zhang:
Stochastic Coded Federated Learning with Convergence and Privacy Guarantees. 2028-2033 - Marvin Xhemrishi, Alexandre Graell i Amat, Eirik Rosnes, Antonia Wachter-Zeh:
Computational Code-Based Privacy in Coded Federated Learning. 2034-2039 - Natalie Lang, Nir Shlezinger:
Joint Privacy Enhancement and Quantization in Federated Learning. 2040-2045 - Praneeth Narayanamurthy, Urbashi Mitra:
Uncertainty-Based Non-Parametric Active Peak Detection. 2046-2051 - Alon Kipnis:
Rare and Weak Detection Models under Moderate Deviations Analysis and Log-Chisquared P-values. 2052-2057 - Konstantinos Konstantinidis
Aspis: Robust Detection for Distributed Learning. 2058-2063 - Zeynep K, Bobak Nazer:
Detecting Correlated Gaussian Databases. 2064-2069 - Subhankar Banerjee, Sennur Ulukus:
Game Theoretic Analysis of an Adversarial Status Updating System. 2070-2075 - Nitya Sathyavageeswaran, Roy D. Yates, Anand D. Sarwate, Narayan B. Mandayam:
Privacy Leakage in Discrete-Time Updating Systems. 2076-2081 - Yunus Inan, Emre Telatar:
Age-Optimal Causal Labeling of Memoryless Processes. 2082-2087 - Qian Wang, He Henry Chen:
Age of Information in Reservation Multi-Access Networks with Stochastic Arrivals. 2088-2093 - Felipe Areces, Dan Song, Richard D. Wesel, Aaron B. Wagner:
Efficiently Computable Converses for Finite-Blocklength Communication. 2094-2099 - Homa Nikbakht, Malcolm Egan, Jean-Marie Gorce:
Dirty Paper Coding for Consecutive Messages with Heterogeneous Decoding Deadlines in the Finite Blocklength Regime. 2100-2105 - Sadaf ul Zuhra, Samir M. Perlaza
Achievable Information-Energy Region in the Finite Block-Length Regime with Finite Constellations. 2106-2111 - Xi Zhang, Jingqing Wang, H. Vincent Poor:
Statistical Delay and Error-Rate Bounded QoS Control for URLLC in the Non-Asymptotic Regime. 2112-2117 - Meraiah Martinez, Christine A. Kelley:
Minimum distance and other properties of quasi-dyadic parity check codes. 2118-2123 - Min Qiu
Sub-Block Rearranged Staircase Codes for Optical Transport Networks. 2124-2129 - Samet Gelincik, Philippe Mary, Anne Savard
Preserving the Minimum Distance of Polar-Like Codes while Increasing the Information Length. 2130-2135 - Saurav R. Pandey, Nuh Aydin, Matthew J. Harrington, Dev Akre:
A Generalization of the ASR Search Algorithm to 2-Generator Quasi-Twisted Codes. 2136-2141 - Guodong Li, Min Ye, Sihuang Hu
Adjacent-Bits-Swapped Polar codes: A new code construction to speed up polarization. 2142-2147 - Jun Muramatsu
Binary Polar Codes Based on Bit Error Probability. 2148-2153 - Dorsa Fathollahi, Marco Mondelli:
Polar Coded Computing: The Role of the Scaling Exponent. 2154-2159 - Peter Trifonov:
Design of Multilevel Polar Codes with Shaping. 2160-2165 - Ron M. Roth:
Higher-Order MDS Codes. 2166-2171 - Jie Li, Xiaohu Tang, Hanxu Hou, Yunghsiang S. Han, Bo Bai, Gong Zhang:
PMDS Array Codes With Small Sub-packetization Level and Small Repair Bandwidth. 2172-2177 - Odae Al Aboud, Daniel Panario, Brett Stevens:
Maximum-Length Low-Density MDS Codes and Near Resolvable Designs. 2178-2183 - Jingjie Lv, Weijun Fang, Bin Chen, Shu-Tao Xia, Xiangyu Chen:
New constructions of binary MDS array codes and locally repairable array codes. 2184-2189 - Chenglin Fan, Ping Li:
Distances Release with Differential Privacy in Tree and Grid Graph. 2190-2195 - Antonious M. Girgis
Distributed User-Level Private Mean Estimation. 2196-2201 - Jiangnan Cheng, Ao Tang:
Maximum Mutual Information under Local Differential Privacy Constraint. 2202-2206 - Birenjith Sasidharan
Private Balance-Checking on Blockchain Accounts Using Private Integer Addition. 2207-2212 - Ching-Yi Lai
Learning quantum circuits of T -depth one. 2213-2218 - Christoph Hirche, Felix Leditzky:
Bounding quantum capacities via partial orders and complementarity. 2219-2224 - Christophe Piveteau, Joseph M. Renes
Quantum message-passing algorithm for optimal and efficient decoding. 2225-2230 - Uzi Pereg, Christian Deppe, Holger Boche:
Communication with Unreliable Entanglement Assistance. 2231-2236 - Sameera Bharadwaja H., Monika Bansal, Chandra R. Murthy:
Approximate Set Identification: PAC Analysis for Group Testing. 2237-2242 - Sundara Rajan Srinivasavaradhan, Pavlos Nikolopoulos, Christina Fragouli, Suhas N. Diggavi:
Improving Group Testing via Gradient Descent. 2243-2248 - Batuhan Arasli, Sennur Ulukus:
Group Testing with a Dynamic Infection Spread. 2249-2254 - Sundara Rajan Srinivasavaradhan, Pavlos Nikolopoulos, Christina Fragouli, Suhas N. Diggavi:
Dynamic group testing to control and monitor disease progression in a population. 2255-2260 - Vanlalruata Ralte, Praveen Sharma, Amitalok J. Budkuley, Stefano Rini:
On Distributed Sampling for Detection of Poisson Sources. 2261-2266 - Yunfeng Cai, Guanhua Fang, Ping Li:
Sensitivity of Under-Determined Linear System. 2267-2272 - Tadashi Wadayama, Satoshi Takabe:
Asymptotic Mean Squared Error of Noisy Periodical Successive Over-Relaxation. 2273-2278 - Yuval Ben-Hur, Asaf Goren, Da El Klang, Yongjune Kim
Mitigating Noise in Ensemble Classification with Real-Valued Base Functions. 2279-2284 - Cheng-Yu Pai
Designing Two-Dimensional Complete Complementary Codes for Omnidirectional Transmission in Massive MIMO Systems. 2285-2290 - Yuhao Chi, Lei Liu
Capacity Optimal Coded Generalized MU-MIMO. 2291-2296 - Yue Qi, Mojtaba Vaezi:
Optimal Order of Encoding for Gaussian MIMO Multi-Receiver Wiretap Channel. 2297-2302 - Abbas Khalili, Elza Erkip, Sundeep Rangan:
Quantized MIMO: Channel Capacity and Spectrospatial Power Distribution. 2303-2308 - Recep Can Yavas, Victoria Kostina
Third-order Analysis of Channel Coding in the Moderate Deviations Regime. 2309-2314 - Henri Hentilä, Yanina Shkel, Visa Koivunen:
Second-Order Converse for Rate-Limited Common Randomness Generation. 2315-2320 - Pin-Wen Su, Yu-Chih Huang
Sequentially Mixing Randomly Arriving Packets Improves Channel Dispersion Over Block-Based Designs. 2321-2326 - Hengjie Yang, Recep Can Yavas, Victoria Kostina
Variable-Length Stop-Feedback Codes With Finite Optimal Decoding Times for BI-AWGN Channels. 2327-2332 - Marcus Greferath, Jens Zumbrägel:
List Decoding of Quaternary Codes in the Lee Metric. 2333-2337 - Chih-Chiang Huang, Hedongliang Liu, Lukas Holzbaur, Sven Puchinger, Antonia Wachter-Zeh:
List Decoding of 2-Interleaved Binary Alternant Codes. 2338-2343 - Xiangyu Chen, Min Ye:
Improving the List Decoding Version of the Cyclically Equivariant Neural Decoder. 2344-2349 - Yujie Gu, Ilya Vorobyev, Ying Miao:
Secure codes with list decoding. 2350-2355 - Bolin Wu, Jincheng Dai, Kai Niu:
Joint Source-Channel Polar-Coded Modulation. 2356-2361 - Yanfei Dong
Distributed Joint Source-Channel Polar Coding. 2362-2367 - Zicheng Ye, Yuan Li, Huazi Zhang, Rong Li, Jun Wang, Guiying Yan, Zhiming Ma:
The Complete SC-Invariant Affine Automorphisms of Polar Codes. 2368-2373 - Kirill Ivanov, Rüdiger L. Urbanke:
Polar Codes Do Not Have Many Affine Automorphisms. 2374-2378 - Zhengrui Li, Wai Ho Mow, Lei Deng
Optimal-Repair-Cost MDS Array Codes for a Class of Heterogeneous Distributed Storage Systems. 2379-2384 - Chao Pan, Ryan Gabrys, Xujun Liu, Charles J. Colbourn, Olgica Milenkovic:
Balanced and Swap-Robust Trades for Dynamical Distributed Storage. 2385-2390 - Sajani Vithana, Sennur Ulukus:
Private Read Update Write (PRUW) with Storage Constrained Databases. 2391-2396 - Zhiquan Tan, Sian-Jheng Lin, Yunghsiang S. Han, Zhongyi Huang, Bo Bai, Gong Zhang:
Data Integrity Check in Distributed Storage Systems. 2397-2402 - Kayvon Mazooji, Sreeram Kannan, William Stafford Noble, Ilan Shomorony:
Fundamental Limits of Multi-Sample Flow Graph Decomposition. 2403-2408 - Adel M. Elmahdy, Junhyung Ahn, Soheil Mohajer, Changho Suh:
The Optimal Sample Complexity of Matrix Completion with Hierarchical Similarity Graphs. 2409-2414 - Ivo Kubjas, Vitaly Skachek:
Partial Extraction from Invertible Bloom Filters. 2415-2420 - Benjamin Wolff, Tomer Gafni, Guy Revach
Composite Anomaly Detection via Hierarchical Dynamic Search. 2421-2426 - Mario Berta, Marco Tomamichel:
Chain rules for quantum channels. 2427-2432 - Felix Leditzky, Debbie W. Leung, Vikesh Siddhu, Graeme Smith, John A. Smolin:
The platypus of the quantum channel zoo. 2433-2438 - Jens Eisert, Mark M. Wilde:
A smallest computable entanglement monotone. 2439-2444 - Arun Padakandla:
Communicating over a Classical-Quantum MAC with State Information Distributed at Senders. 2445-2450 - Mikolaj Jankowski, Deniz Gündüz, Krystian Mikolajczyk:
AirNet: Neural Network Transmission over the Air. 2451-2456 - Natasha Devroye
Interpreting Deep-Learned Error-Correcting Codes. 2457-2462 - Mehrdad Salmasi, Maneesh Sahani:
Learning neural codes for perceptual uncertainty. 2463-2468 - Amit Tsvieli, Nir Weinberger:
Learning Maximum Margin Channel Decoders for Non-linear Gaussian Channels. 2469-2474 - Michael Dikshtein, Nir Weinberger, Shlomo Shamai Shitz:
The Compound Information Bottleneck Program. 2475-2480 - Gholamali Aminian, Yuheng Bu
Tighter Expected Generalization Error Bounds via Convexity of Information Measures. 2481-2486 - Mahdi Haghifam, Shay Moran, Daniel M. Roy, Gintare Karolina Dziugaite:
Understanding Generalization via Leave-One-Out Conditional Mutual Information. 2487-2492 - Gowtham R. Kurri, Oliver Kosut, Lalitha Sankar:
A Variational Formula for Infinity-Rényi Divergence with Applications to Information Leakage. 2493-2498 - Bharath Shamasundar, Aria Nosratinia:
Canonical Training is Bad for Reconfigurable Intelligent Surfaces. 2499-2504 - Mahdi Barzegar Khalilsarai, Yi Song, Tianyu Yang, Giuseppe Caire:
Channel State Acquisition in FDD Massive MIMO: Rate-Distortion Bound and Effectiveness of "Analog" Feedback. 2505-2510 - Farhad Shirani, Hamidreza Aghasi:
MIMO Systems with One-bit ADCs: Capacity Gains using Nonlinear Analog Operations. 2511-2516 - Andreas Nicolaides, Constantinos Psomas, Ghassan M. Kraidy, Ioannis Krikidis:
A Partition-based Scheme for IRS-aided MIMO Fading Channels: Outage and DMT Analysis. 2517-2522 - Yihan Zhang
The Capacity of Causal Adversarial Channels. 2523-2528 - Eric Ruzomberka, Chih-Chun Wang, David J. Love:
Channel Capacity for Adversaries with Computationally Bounded Observations. 2529-2534 - Anuj Kumar Yadav
New Results on AVCs with Omniscient and Myopic Adversaries. 2535-2540 - Ziao Wang, Nadim Ghaddar, Lele Wang:
Noisy Sorting Capacity. 2541-2546 - Oron Sabag
Feedback Capacity of Gaussian Channels with Memory. 2547-2552 - Nikita Polyanskii, Yihan Zhang
List-Decodable Zero-Rate Codes for the Z-Channel. 2553-2558 - Yihan Zhang
List-Decodability of Poisson Point Processes. 2559-2564 - Eitan Goldberg, Chong Shangguan, Itzhak Tamo:
Singleton-type bounds for list-decoding and list-recovery, and related results. 2565-2570 - Yonatan Urman, Guy Mogilevsky, David Burshtein:
Improving Belief Propagation List Decoding of Polar Codes by Post-Processing. 2571-2576 - Sadra Seyedmasoumian
Approximate Weight Distribution of Polarization-Adjusted Convolutional (PAC) Codes. 2577-2582 - Debarnab Mitra, Lev Tauz, Lara Dolecek:
Polar Coded Merkle Tree: Improved Detection of Data Availability Attacks in Blockchain Systems. 2583-2588 - Wen-Yao Chen, Chung-Chin Lu:
On the Bit-Channels for Channel Polarization. 2589-2594 - Constantin Runge
Multilevel Binary Polar-Coded Modulation Achieving the Capacity of Asymmetric Channels. 2595-2600 - Hao Shi, Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, Zhengyi Jiang, Zhongyi Huang, Bo Bai:
New Piggybacking Codes with Lower Repair Bandwidth for Any Single-Node Failure. 2601-2606 - Dinh Thi Xinh, Luu Y. Nhi Nguyen, Lakshmi J. Mohan, Serdar Boztas, Tran Thi Luong, Son Hoang Dau:
Practical Considerations in Repairing Reed-Solomon Codes. 2607-2612 - Gianira N. Alfarano, Alberto Ravagnani, Emina Soljanin:
Dual-Code Bounds on Multiple Concurrent (Local) Data Recovery. 2613-2618 - Wenjing Chen, Chao Tian:
A New Approach to Compute Information Theoretic Outer Bounds and Its Application to Regenerating Codes. 2619-2624 - Han Cai, Moshe Schwartz:
A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It. 2625-2630 - Hila Naaman, Satish Mulleti, Yonina C. Eldar:
Uniqueness and Robustness of Tem-Based FRI Sampling. 2631-2636 - Alexander Barg, Ohad Elishco, Ryan Gabrys, Eitan Yaakobi:
Recoverable systems on lines and grids. 2637-2642 - Zhi Gu
A Computational Design of Aperiodic Mismatched Filtering Sequences. 2643-2647 - Shuai Ma, Stefan M. Moser, Ligong Wang, Michèle A. Wigger:
Signaling for MISO Channels Under First- and Second-Moment Constraints. 2648-2653 - Farzin Salek, Andreas J. Winter:
Distillation of Secret Key and GHZ States from Multipartite Mixed States. 2654-2659 - Tao Guo, Jie Han, Huihui Wu, Yizhu Wang, Bo Bai, Wei Han:
Protecting Semantic Information Using An Efficient Secret Key. 2660-2665 - Vamoua Yachongka
Secret Key-based Authentication With Passive Eavesdropper for Scalar Gaussian Sources. 2666-2671 - Jari Lietzén, Olav Tirkkonen
Secret Keys from Parity Bits in the Satellite Setting. 2672-2677 - Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Mingyuan Wang:
Improved Bound on the Local Leakage-resilience of Shamir's Secret Sharing. 2678-2683 - Yoel Bokobza, Ron Dabora, Kobi Cohen:
Simultaneous Sensing and Channel Access based on Partial Observations via Deep Reinforcement Learning. 2684-2689 - Alejandro Cohen, Amit Solomon, Nir Shlezinger:
DeepNP: Deep Learning-Based Noise Prediction for Ultra-Reliable Low-Latency Communications. 2690-2695 - Roy Karasik, Osvaldo Simeone, Shlomo Shamai Shitz:
Learning to Broadcast with Layered Division Multiplexing. 2696-2701 - Joni Shaska, Urbashi Mitra:
Information Structures for State-Dependent Decentralized Detection. 2702-2707 - Shun Watanabe:
On Sub-optimality of Random Binning for Distributed Hypothesis Testing. 2708-2713 - Mustapha Hamad, Mireille Sarkiss, Michèle A. Wigger:
Benefits of Rate-Sharing for Distributed Hypothesis Testing. 2714-2719 - Osama A. Hanna, Xinlin Li, Christina Fragouli, Suhas N. Diggavi:
Can we break the dependency in distributed detection? 2720-2725 - Kalle Alaluusua, Lasse Leskelä:
Consistent Bayesian community recovery in multilayer networks. 2726-2731 - Rami Ezzine, Moritz Wiese, Christian Deppe, Holger Boche:
A Rigorous Proof of the Capacity of MIMO Gauss-Markov Rayleigh Fading Channels. 2732-2737 - Kangning Ma, Yinfei Xu, Shuo Shao:
On Broadcast Approach to MIMO Fading Channels. 2738-2743 - Yinfei Xu, Tong Zhang, Yong Dong
MIMO Gaussain Cognitive Interference Channels With Confidential Messages. 2744-2749 - Omar Fawzi
Beating the Sum-Rate Capacity of the Binary Adder Channel with Non-Signaling Correlations. 2750-2755 - Akshay Seshadri, Felix Leditzky, Vikesh Siddhu, Graeme Smith:
On the separation of correlation-assisted sum capacities of multiple access channels. 2756-2761 - Qi Cao, Qi Chen:
On Zero-Error Capacity of "One-Edge" Binary Channels with Two Memories. 2762-2767 - Xiao Ma, Yixin Wang, Tingting Zhu:
A New Framework for Proving Coding Theorems for Linear Codes. 2768-2773 - Holger Boche, Rafael F. Schaefer
Capacity-Achieving Input Distributions: Algorithmic Computability and Approximability. 2774-2779 - Sebastian Bitzer, Martin Bossert:
On Multibasis Information Set Decoding. 2780-2784 - Johann-Philipp Thiers, Jürgen Freudenberger:
Decoding of Generalized Concatenated Codes Over the One-Lee Error Channel for the McEliece Cryptosystem. 2785-2790 - Ferucio Laurentiu Tiplea, Vlad-Florin Dragoi
Generalized Inverse Based Decoding. 2791-2796 - S. Ashwin Hebbar
TinyTurbo: Efficient Turbo Decoders on Edge. 2797-2802 - Qiuzhuo Chen, Fangtao Yu, Tao Yang, Jingge Zhu, Rongke Liu:
A Linear Physical-Layer Network Coding Based Multiple Access Approach. 2803-2808 - Zhuolin Bian, Wangmei Guo, Minhan Tian:
Endurance Network Coding for Multi-Hop Wireless Communications. 2809-2814 - Suayb S. Arslan
Base Station-Assisted Cooperative Network Coding for Cellular Systems with Link Constraints. 2815-2820 - Arun Padakandla:
An Achievable Rate Region for 3-User Classical-Quantum Broadcast Channels. 2821-2826 - Chengyuan Qian, Ruida Zhou, Chao Tian, Tie Liu
Improved Weakly Private Information Retrieval Codes. 2827-2832 - Anoosheh Heidarzadeh, Alex Sprintson:
The Linear Capacity of Single-Server Individually-Private Information Retrieval With Side Information. 2833-2838 - Perttu Saarela, Matteo Allaix, Ragnar Freij-Hollanti, Camilla Hollanti:
Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes. 2839-2844 - Hao Xu, Kai-Kit Wong, Giuseppe Caire, Shlomo Shamai Shitz:
Distributed Information Bottleneck for a Primitive Gaussian Diamond Channel with Rayleigh Fading. 2845-2850 - Ibrahim Issa, Aaron B. Wagner:
An Adaptive Composition Theorem for Maximal Leakage for Binary Inputs. 2851-2855 - Amir Masoud Jafarpisheh, Mahtab Mirmohseni, Mohammad Ali Maddah-Ali:
Distributed Attribute-based Private Access Control. 2856-2861 - Mahshad Shariatnasab, Farhad Shirani, Zahid Anwar:
Privacy Limits in Power-Law Bipartite Networks under Active Fingerprinting Attacks. 2862-2867 - Ryan Song, Kareem M. Attiah, Wei Yu:
Coded Categorization in Massive Random Access. 2868-2873 - Suhas S. Kowshik
Improved Bounds for the Many-User MAC. 2874-2879 - Mohammad Javad Ahmadi
Unsourced Random Access with a Massive MIMO Receiver Using Multiple Stages of Orthogonal Pilots. 2880-2885 - Javad Haghighat, Tolga M. Duman:
Energy Efficiency Analysis of a Feedback-Aided IRSA Scheme. 2886-2891 - Praveen Venkatesh
Partial Information Decomposition via Deficiency for Multivariate Gaussians. 2892-2897 - Dor Tsur, Ziv Aharoni, Ziv Goldfeld, Haim H. Permuter:
Optimizing Estimated Directed Information over Discrete Alphabets. 2898-2903 - Amedeo Roberto Esposito
On Sibson's α-Mutual Information. 2904-2909 - Jieao Zhu
On Finite-Time Mutual Information. 2910-2915 - Mingyang Zhu, Ming Jiang, Chunming Zhao:
Ternary Message Passing Decoding of RS-SPC Product Codes. 2916-2921 - Haruhiko Kaneko:
Look-Ahead Bit-Flipping Decoding of MDPC Code. 2922-2927 - Ali Farsiabi, Amir H. Banihashemi:
A Semi Linear State Space Model for Error Floor Estimation of LDPC codes over the AWGN Channel. 2928-2933 - Daniella Bar-Lev, Sagi Marcovich, Eitan Yaakobi, Yonatan Yehezkeally
Adversarial Torn-paper Codes. 2934-2939 - Roni Con, Amir Shpilka
Reed Solomon Codes Against Adversarial Insertions and Deletions. 2940-2945 - Jiachun Pan, Yonglong Li, Vincent Y. F. Tan:
Asymptotic Nash Equilibrium for the Sequential Adversarial Hypothesis Testing Game. 2946-2951 - Qihang Liang
Improved Adversarial Robustness by Hardened Prediction. 2952-2956 - Taro Shibayama
Equivalence of Quantum Single Insertion and Single Deletion Error-Correctabilities, and Construction of Codes and Decoders. 2957-2962 - Yingkai Ouyang, Marco Tomamichel:
Learning quantum graph states with product measurements. 2963-2968 - Vatsal Pramod Jha, Udaya Parampalli, Abhay Kumar Singh:
Stabilizer codes and Symbol-Pair Metric are Related. 2969-2973 - Touheed Anwar Atif, S. Sandeep Pradhan:
Multi-Party Quantum Purity Distillation with Bounded Classical Communication. 2974-2979 - Yoshiki Hara, Kenta Kasai:
Sparse Group Quantitative PCR Testing by Belief Propagation. 2980-2984 - Yiming Xing, Georgios Fellouris:
Asymptotically optimal multistage tests for iid data. 2985-2990 - Amichai Painsky:
A Data-driven Missing Mass Estimation Framework. 2991-2995 - Feng Zhu, Jingjing Zhang, Osvaldo Simeone, Xin Wang:
Adaptive Worker Grouping for Communication-Efficient and Straggler-Tolerant Distributed SGD. 2996-3000 - Masazumi Iida, Yoshinari Takeishi, Jun'ichi Takeuchi:
On Fisher Information Matrix for Simple Neural Networks with Softplus Activation. 3001-3006 - Kordag Mehmet Kilic, Jin Sima, Jehoshua Bruck:
On Algebraic Constructions of Neural Networks with Small Weights. 3007-3012 - Yaniv Fogel, Meir Feder:
On Multiple and Hierarchical Universality. 3013-3018 - Enrico Paolini, Lorenzo Valentini
Irregular Repetition Slotted ALOHA in an Information-Theoretic Setting. 3019-3024 - Mehrasa Ahmadipour, Michèle A. Wigger, Mari Kobayashi:
Coding for Sensing: An Improved Scheme for Integrated Sensing and Communication over MACs. 3025-3030 - Michael Dikshtein, Shirin Saeedi Bidokhti, Shlomo Shamai Shitz:
Bounds on the Capacity of the Multiple Access Diamond Channel with Cooperating Base-Stations. 3031-3036 - Tadashi Wadayama, Ayano Nakai-Kasai:
Continuous-Time Noisy Average Consensus System as Gaussian Multiple Access Channel. 3037-3042 - Chin Choy Chai, Xiao-Ping Zhang:
Iterative Water-Filling Power and Subcarrier Allocation for Multicarrier Non-Orthogonal Multiple Access Uplink. 3043-3048 - Sagnik Bhattacharya, Prakash Narayan:
Shared Information for a Markov Chain on a Tree. 3049-3054 - Aditya Pradeep, Ido Nachum, Michael Gastpar:
Finite Littlestone Dimension Implies Finite Information Complexity. 3055-3060 - Mücahit Furkan Yildiz
Augustin Information Measures on Fading Channels Under Certain Symmetry Hypothesis. 3061-3066 - Tong Zhang, Yufan Zhuang, Yinfei Xu:
The Generalized Degrees-of-Freedom of the Asymmetric Interference Channel with Delayed CSIT. 3067-3072 - Pin-Chieh Tseng
Improved semidefinite programming bounds for binary codes by split distance enumerations. 3073-3078 - Gretchen L. Matthews
Norm-trace-lifted codes over binary fields. 3079-3084 - Yihan Zhang
Lower bounds for Multiple Packing. 3085-3090 - Tuan Thanh Nguyen
Using One Redundant Bit to Construct Two-Dimensional Almost-Balanced Codes. 3091-3096 - Francisco Pernice, Ray Li, Mary Wootters:
Efficient Capacity-Achieving Codes for General Repeat Channels. 3097-3102 - Chih Wei Ling, Yanxiao Liu, Cheuk Ting Li:
Weighted Parity-Check Codes for Channels with State and Asymmetric Channels. 3103-3108 - Ehsan Seifi, Amir K. Khandani:
Converting a 1×K Static Rayleigh Channel to K Parallel AWGN Using Media-based Modulation. 3109-3113 - Gou Hosoya:
Reduction of Delay for Delayed Bit-Interleaved Coded Modulation. 3114-3119 - Guodong Li, Ningning Wang, Sihuang Hu
Constructing MSR codes with subpacketization 2n/3 for k + 1 helper nodes. 3120-3125 - Jing Qiu, Weijun Fang, Fang-Wei Fu:
Optimal and Almost Optimal Cyclic (r, δ)-LRCs With Large Code Lengths. 3126-3131 - Hanxu Hou, Yunghsiang S. Han, Bo Bai, Gong Zhang:
Towards Efficient Repair and Coding of Binary MDS Array Codes with Small Sub-packetization. 3132-3137 - Xiaoqi Liu, Ramji Venkataramanan:
Sketching sparse low-rank matrices with near-optimal sample- and time-complexity. 3138-3143 - Surin Ahn, Wei-Ning Chen, Ayfer Özgür:
Estimating Sparse Distributions Under Joint Communication and Privacy Constraints. 3144-3149 - Mark Beliaev, Payam Delgosha, Hamed Hassani, Ramtin Pedarsani:
Efficient and Robust Classification for Sparse Attacks. 3150-3155 - Geewon Suh, Changho Suh:
Graph-assisted Matrix Completion in a Multi-clustered Graph Model. 3156-3161 - Shota Saito
On Meta-Bound for Lower Bounds of Bayes Risk. 3162-3167 - Charvi Rastogi, Ivan Stelmakh, Nihar B. Shah, Sivaraman Balakrishnan:
No Rose for MLE: Inadmissibility of MLE for Evaluation Aggregation Under Levels of Expertise. 3168-3173 - Hanbyul Lee, Kevin Bello, Jean Honorio
On the Fundamental Limits of Exact Inference in Structured Prediction. 3174-3179 - Heguang Lin, Mengze Li, Daniel L. Pimentel-Alarcón, Matthew L. Malloy:
Geometry of the Minimum Volume Confidence Sets. 3180-3185 - Junyi He, Di Zhang, Shumeng Liu, Yuezhi Zhou, Yaoxue Zhang:
Decentralized Updates Scheduling for Data Freshness in Mobile Edge Computing. 3186-3191 - Chih-Chun Wang:
How Useful Is Delayed Feedback in AoI Minimization - A Study on Systems With Queues in Both Forward and Backward Directions. 3192-3197 - Rajai Nasser, Ibrahim Issa, Ibrahim C. Abou-Faycal:
Age Distribution in Arbitrary Preemptive Memoryless Networks. 3198-3203 - Nian Guo
Reliability function for streaming over a DMC with feedback. 3204-3209 - Giuseppe Cocco, Albert Guillén i Fàbregas, Josep Font-Segura
Typical Random Coding Exponent for Finite-State Channels. 3210-3214 - Yan Hao Ling, Jonathan Scarlett:
A Simple Coding Scheme Attaining Positive Information Velocity. 3215-3219 - Mine Gokce Dogan, Martina Cardone, Christina Fragouli:
Proactive Resilience in 1-2-1 Networks. 3220-3225 - Maiara F. Bollauf
On the Secrecy Gain of Formally Unimodular Construction A4 Lattices. 3226-3231 - Jiajie Xue, Brian M. Kurkoski:
Lower Bound on the Error Rate of Genie-Aided Lattice Decoding. 3232-3237 - Farhad Shirani, S. Sandeep Pradhan:
Lattices from Linear Codes: Source and Channel Networks. 3238-3243 - Lawrence Ong
Very Pliable Index Coding. 3244-3249 - Arman Sharififar, Parastoo Sadeghi, Neda Aboutorab:
On the Optimality of Linear Index Coding over the Fields with Characteristic Three. 3250-3255 - Yucheng Liu, Lawrence Ong
Information Leakage in Index Coding With Sensitive and Non-Sensitive Messages. 3256-3261 - Francisco Maturana, K. V. Rashmi:
Bandwidth Cost of Code Conversions in the Split Regime. 3262-3267 - Junming Ke, Ago-Erik Riet
Update and Repair Efficient Storage Codes with Availability via Finite Projective Planes. 3268-3273 - Rémi A. Chou
Quantifying the Cost of Privately Storing Data in Distributed Storage Systems. 3274-3279 - Sidhant Bansal
Universal 1-Bit Compressive Sensing for Bounded Dynamic Range Signals. 3280-3284 - Seyedehsara Nayer, Namrata Vaswani:
Fast Low Rank column-wise Compressive Sensing. 3285-3290 - Jialiang Xu, Xu Zhang:
Data-Time Tradeoffs for Optimal k-Thresholding Algorithms in Compressed Sensing. 3291-3296 - Ankit Pensia, Po-Ling Loh, Varun S. Jog:
Simple Binary Hypothesis Testing under Communication Constraints. 3297-3302 - Lin Zhou, Yun Wei, Alfred O. Hero III:
Asymptotics for Outlier Hypothesis Testing. 3303-3308 - Zhongchang Sun, Shaofeng Zou:
Robust Hypothesis Testing with Kernel Uncertainty Sets. 3309-3314 - Jie Wang
A Data-Driven Approach to Robust Hypothesis Testing Using Sinkhorn Uncertainty Sets. 3315-3320 - Han Wu
On Joint Communication and Channel Discrimination. 3321-3326 - Ken-ichi Iwata, Hirosuke Yamamoto:
Joint Coding for Discrete Sources and Finite-State Noiseless Channels. 3327-3332 - Xi Zhang, Jingqing Wang, H. Vincent Poor:
Statistical QoS-Driven Beamforming and Trajectory Optimizations in UAV/IRS-Based 6G Wireless Networks in the Non-Asymptotic Regime. 3333-3338 - M. Ashok Kumar, Albert Sunny, Ashish Thakre, Ashisha Kumar, G. Dinesh Manohar:
A Unified Framework for Problems on Guessing, Source Coding, and Tasks Partitioning. 3339-3344 - Asaf Cohen, Neri Merhav:
Universal Randomized Guessing Subject to Distortion. 3345-3350 - Suayb S. Arslan, Elif Haytaoglu:
Improved Bounds on the Moments of Guessing Cost. 3351-3356
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-26 01:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: