default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISIT 2021: Melbourne, Australia
- IEEE International Symposium on Information Theory, ISIT 2021, Melbourne, Australia, July 12-20, 2021. IEEE 2021, ISBN 978-1-5386-8209-8
- Siyao Li
, Daniela Tuninetti, Natasha Devroye:
A Control-Theoretic Linear Coding Scheme for the Fading Gaussian Broadcast Channel with Feedback. 1-6 - Oron Sabag, Victoria Kostina, Babak Hassibi:
Feedback Capacity of MIMO Gaussian Channels. 7-12 - Rajesh K. Mishra, Deepanshu Vasal, Hyeji Kim:
Linear Coding for AWGN Channels with Noisy Output Feedback via Dynamic Programming. 13-18 - Julian Renner, Sven Puchinger, Antonia Wachter-Zeh:
Decoding High-Order Interleaved Rank-Metric Codes. 19-24 - Sven Puchinger, Julian Renner, Antonia Wachter-Zeh, Jens Zumbrägel:
Efficient Decoding of Gabidulin Codes over Galois Rings. 25-30 - Wrya K. Kadir, Chunlei Li, Ferdinando Zullo:
On interpolation-based decoding of a class of maximum rank distance codes. 31-36 - Mohammad Mahdi Mahvari, Mari Kobayashi, Abdellatif Zaidi:
Scalable Vector Gaussian Information Bottleneck. 37-42 - Teng-Hui Huang, Aly El Gamal:
A Provably Convergent Information Bottleneck Solution via ADMM. 43-48 - Yuheng Bu, Tony Wang, Gregory W. Wornell:
SDP Methods for Sensitivity-Constrained Privacy Funnel and Information Bottleneck Problems. 49-54 - Slim Bettaieb, Loïc Bidoux, Olivier Blazy, Philippe Gaborit:
Zero-Knowledge Reparation of the Véron and AGS Code-based Identification Schemes. 55-60 - Khaled Taleb, Meryem Benammar:
On the information leakage of finite block-length wiretap polar codes. 61-65 - Xuan Guang, Yang Bai, Raymond W. Yeung:
Secure Network Function Computation. 66-71 - Sijie Li, Rawad Bitar, Sidharth Jaggi, Yihan Zhang:
Network Coding with Myopic Adversaries. 72-77 - Qifa Yan, Daniela Tuninetti:
Robust and Secure Cache-aided Private Linear Function Retrieval from Coded Servers. 78-83 - Emna Ben Yacoub:
List Message Passing Decoding of Non-binary Low-Density Parity-Check Codes. 84-89 - Mengnan Xu, Dan Zeng, Zhichao Sheng, Zhonghao Zhang, Chongbin Xu:
Some Results on Density Evolution of Nonbinary SC-LDPC Ensembles Over the BEC. 90-95 - Gada Rezgui, Iryna Andriyanova, Asma Maaloui, Charly Poulliat:
A Class of Non-Binary Doubly-Generalized LDPC codes for Moderate and High Code Rates. 96-100 - Taposh Banerjee, Ahmad F. Taha, Eugene John:
Robust Quickest Change Detection in Statistically Periodic Processes. 101-105 - Zhongchang Sun, Shaofeng Zou:
Quickest Dynamic Anomaly Detection in Anonymous Heterogeneous Sensor Networks. 106-111 - Qunzhi Xu, Yajun Mei:
Multi-Stream Quickest Detection with Unknown Post-Change Parameters Under Sampling Control. 112-117 - Andreas Bluhm, Ángela Capel, Zentrum Mathematik, Antonio Pérez-Hernández:
Weak Quasi-Factorization for the Belavkin-Staszewski Relative Entropy. 118-123 - Touheed Anwar Atif, S. Sandeep Pradhan:
Distributed Quantum Faithful Simulation and Function Computation Using Algebraic Structured Measurements. 124-129 - Anurag Anshu, Shima Bab Hadiashar, Rahul Jain, Ashwin Nayak, Dave Touchette:
One-Shot Quantum State Redistribution and Quantum Markov Chains. 130-135 - Ke Wu, Aaron B. Wagner:
A Practical Coding Scheme for the BSC with Feedback. 136-141 - Amaael Antonini, Rita Gimelshein, Richard D. Wesel:
Causal (Progressive) Encoding over Binary Symmetric Channels with Noiseless Feedback. 142-147 - Nian Guo, Victoria Kostina:
Instantaneous SED coding over a DMC. 148-153 - Sven Puchinger, Johan Rosenkilde:
Bounds on List Decoding of Linearized Reed-Solomon Codes. 154-159 - Hannes Bartz, Sven Puchinger:
Decoding of Interleaved Linearized Reed-Solomon Codes with Applications to Network Coding. 160-165 - Ba-Duc Pham, Pierre Loidreau:
On the decoding of the sum of Gabidulin codes. 166-171 - Jiachun Pan, Yonglong Li, Vincent Y. F. Tan:
Asymptotics of Sequential Composite Hypothesis Testing under Probabilistic Constraints. 172-177 - Sung-Wen Lan, I-Hsiang Wang:
Heterogeneous Sequential Hypothesis Testing with Active Source Selection under Budget Constraints. 178-183 - Parham Boroumand, Albert Guillén i Fàbregas:
Error Exponent Sensitivity of Sequential Probability Ratio Testing. 184-189 - Shi-Yuan Wang, Matthieu R. Bloch:
Explicit Design of Provably Covert Channel Codes. 190-195 - Meng-Che Chang, Matthieu R. Bloch:
Covert Authentication Against a Myopic Adversary. 196-201 - Hassan ZivariFard, Matthieu R. Bloch, Aria Nosratinia:
Covert Communication via Non-Causal Cribbing from a Cooperative Jammer. 202-207 - Arman Sharififar, Parastoo Sadeghi, Neda Aboutorab:
Broadcast Rate Requires Nonlinear Coding in a Unicast Index Coding Instance of Size 36. 208-213 - Prasad Krishnan, Rogers Mathew, Subrahmanyam Kalyanasundaram:
Pliable Index Coding via Conflict-Free Colorings of Hypergraphs. 214-219 - Kota Srinivas Reddy, Nujoom Sageer Karat, Nikhil Karamchandani:
On the Optimal Transmission Rate for Symmetric Index Coding Problems. 220-225 - Irina E. Bocharova, Boris D. Kudryashov, Vitaly Skachek:
Euclidean Distance Spectra of Irregular NB LDPC Coded QAM Signals with Optimized Mappings. 226-231 - Tadashi Wadayama, Satoshi Takabe:
Proximal Decoding for LDPC-coded Massive MIMO Channels. 232-237 - Ilya Dumer, Navid Gharavi:
Codes approaching the Shannon limit with polynomial complexity per information bit. 238-243 - Eli Chien, Olgica Milenkovic, Angelia Nedich:
Support Estimation with Sampling Artifacts and Errors. 244-249 - Fumito Tagashira, Tomoyuki Obuchi, Toshiyuki Tanaka:
Sharp Asymptotics of Matrix Sketching for a Rank-One Spiked Model. 250-255 - Stefano Della Fiore, Simone Costa, Marco Dalai:
New upper bounds for (b, k)-hashing. 256-261 - Rahul Jain:
Chain-Rules for Channel Capacity. 262-267 - Uzi Pereg:
Bosonic Dirty Paper Coding. 268-271 - Omar Fawzi, Ala Shayeghi, Hoang Ta:
A hierarchy of efficient bounds on quantum capacities exploiting symmetry. 272-277 - Wafa Labidi, Holger Boche, Christian Deppe, Moritz Wiese:
Identification over the Gaussian Channel in the Presence of Feedback. 278-283 - Alireza Vahid:
Distortion-Based Outer-Bounds for Channels with Rate-Limited Feedback. 284-289 - V Arvind Rameshwar, Navin Kashyap:
Bounds on the Feedback Capacity of the ($d, \infty$)-RLL Input-Constrained Binary Erasure Channel. 290-295 - Yang Xu, Haibin Kan, Guangyue Han:
Fourier-Reflexive Partitions Induced by Poset Metric. 296-301 - Dor Elimelech, Marcelo Firer, Moshe Schwartz:
The Generalized Covering Radii of Linear Codes. 302-307 - Takayuki Nozaki:
Distance Enumerators for Number-Theoretic Codes. 308-313 - Xiangxiang Xu, Shao-Lun Huang:
An Information Theoretic Framework for Distributed Learning Algorithms. 314-319 - Basak Güler, Aylin Yener:
Energy-Harvesting Distributed Machine Learning. 320-325 - Jayadev Acharya, Clément L. Canonne, Yuhan Liu, Ziteng Sun, Himanshu Tyagi:
Interactive Inference under Information Constraints. 326-331 - Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee:
Differentially-Private Sublinear-Time Clustering. 332-337 - Antonious M. Girgis, Deepesh Data, Suhas N. Diggavi:
Differentially Private Federated Learning with Shuffling and Client Self-Sampling. 338-343 - Shahab Asoodeh, Wei-Ning Chen, Flávio P. Calmon, Ayfer Özgür:
Differentially Private Federated Learning: An Information-Theoretic Perspective. 344-349 - Hui Zhao, Antonio Bazco Nogueras, Petros Elia:
Wireless Coded Caching With Shared Caches Can Overcome the Near-Far Bottleneck. 350-355 - Rina Su, Qifu Tyler Sun, Zhongshan Zhang:
On the Delay of Random Linear Network Coding in Full-Duplex Relay Networks. 356-361 - Juwendo Denis, Hulya Seferoglu:
Efficient network coding scheme for disjoint clusters of D2D networks and cellular communications. 362-367 - Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario:
Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes With Girth 6 and Shortest Length. 368-373 - Huaan Li, Baoming Bai, Hengzhou Xu, Chao Chen:
Construction of Algebraic-Based Variable-Rate QC-LDPC Codes. 374-379 - Roxana Smarandache, David G. M. Mitchell:
Necessary and Sufficient Girth Conditions for Tanner Graphs of Quasi-Cyclic LDPC Codes. 380-385 - Liyan Xie, Yao Xie:
Optimality of Graph Scanning Statistic for Online Community Detection. 386-390 - Changlong Wu, Narayana Santhanam:
Estimating Properties of Dynamic Graphical Models. 391-395 - Lan V. Truong:
Linear Models with Hidden Markov Sources via Replica Method. 396-401 - Masahito Hayashi, Ning Cai:
Universal classical-quantum multiple access channel coding. 402-407 - Haowei Shi, Min-Hsiu Hsieh, Saikat Guha, Zheshen Zhang, Quntao Zhuang:
Entanglement-assisted multiple-access channels: capacity regions and protocol designs. 408-413 - Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Computing Sum of Sources over a Classical-Quantum MAC. 414-419 - Wael Alghamdi, Flávio P. Calmon:
Polynomial Approximations of Conditional Expectations in Scalar Gaussian Channels. 420-425 - Antonino Favano, Marco Ferrari, Maurizio Magarini, Luca Barletta:
The Capacity of the Amplitude-Constrained Vector Gaussian Channel. 426-431 - Shuai Ma, Michèle A. Wigger:
First- and Second-Moment Constrained Gaussian Channels. 432-437 - Hiram H. López, Gretchen L. Matthews, Daniel Valvo:
Augmented Reed-Muller Codes of High Rate and Erasure Repair. 438-443 - Changjiang Ji, Yan Xu, Sihuang Hu:
Extended Cyclic Codes Sandwiched Between Reed-Muller Codes. 444-449 - Maiara F. Bollauf, Øyvind Ytrehus:
Tiling of Constellations. 450-454 - Yandong Shi, Yong Zhou, Yuanming Shi:
Over-the-Air Decentralized Federated Learning. 455-460 - Emre Ozfatura, Kerem Ozfatura, Deniz Gündüz:
Time-Correlated Sparsification for Communication-Efficient Federated Learning. 461-466 - Emre Ozfatura, Kerem Ozfatura, Deniz Gündüz:
FedADC: Accelerated Federated Learning with Drift Control. 467-472 - Rafael G. L. D'Oliveira, Muriel Médard, Parastoo Sadeghi:
Differential Privacy for Binary Functions via Randomized Graph Colorings. 473-478 - Jun Xu, Xiaodong Wang, Pengcheng Zhu, Xiaohu You:
Joint Differentially Private Channel Estimation in Cell-free Hybrid Massive MIMO. 479-484 - Sayak Ray Chowdhury, Xingyu Zhou, Ness B. Shroff:
Adaptive Control of Differentially Private Linear Quadratic Systems. 485-490 - Jiun-Ting Huang, Young-Han Kim:
Two-Way Token Passing Channels. 491-496 - Vinayak Suresh, Eric Ruzomberka, David J. Love:
Stochastic-Adversarial Channels: Online Adversaries With Feedback Snooping. 497-502 - Syomantak Chaudhuri, Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Compound Arbitrarily Varying Channels. 503-508 - Sven Puchinger, Johan Rosenkilde, Grigory Solomatov:
Improved Power Decoding of Algebraic Geometry Codes. 509-514 - Gretchen L. Matthews, Aidan W. Murphy, Welington Santos:
Fractional decoding of codes from Hermitian curves. 515-520 - Yunqi Wan, Li Chen, Fangguo Zhang:
Algebraic Soft Decoding of Elliptic Codes. 521-526 - Sanae Amani, Mahnoosh Alizadeh, Christos Thrampoulidis:
Regret Bounds for Safe Gaussian Process Bandit Optimization. 527-532 - Chengshuai Shi, Cong Shen:
An Attackability Perspective on No-Sensing Adversarial Multi-player Multi-armed Bandits. 533-538 - Cem Kalkanli, Ayfer Özgür:
Asymptotic Performance of Thompson Sampling in the Batched Multi-Armed Bandits. 539-544 - Shahab Asoodeh, Maryam Aliakbarpour, Flávio P. Calmon:
Local Differential Privacy Is Equivalent to Contraction of an $f$-Divergence. 545-550 - Ni Ding, Yucheng Liu, Farhad Farokhi:
A Linear Reduction Method for Local Differential Privacy and Log-lift. 551-556 - Milan Lopuhaä-Zwakenberg, Jasper Goseling:
Robust Local Differential Privacy. 557-562 - Lakshmi Prasad Natarajan, Smiju Kodamthuruthil Joy:
Permute & Add Network Codes via Group Algebras. 563-568 - Liwen Liu, Jinbei Zhang, Xinyu Xie:
Intension between Two Layers of Coded Caching Networks. 569-574 - Arman Sharififar, Neda Aboutorab, Parastoo Sadeghi:
Update-based Maximum Column Distance Coding Scheme for Index Coding Problem. 575-580 - Min Qiu, Xiaowei Wu, Jinhong Yuan, Alexandre Graell i Amat:
Generalized Spatially Coupled Parallel Concatenated Convolutional Codes With Partial Repetition. 581-586 - Siyi Yang, Ahmed H. Hareedy, Shyam Venkatasubramanian, A. Robert Calderbank, Lara Dolecek:
GRADE-AO: Towards Near-Optimal Spatially-Coupled Codes With High Memories. 587-592 - Toshiaki Koike-Akino, Ye Wang:
Protograph-Based Design for QC Polar Codes. 593-598 - Zhongchang Sun, Qunwei Li, Ruizhi Zhang, Shaofeng Zou:
A Computationally Efficient Algorithm for Quickest Change Detection in Anonymous Heterogeneous Sensor Networks. 599-604 - Anamitra Chaudhuri, Georgios Fellouris, Ali Tajer:
Sequential Change Detection of a Correlation Structure under a Sampling Constraint. 605-610 - Sundara Rajan Srinivasavaradhan, Pavlos Nikolopoulos, Christina Fragouli, Suhas N. Diggavi:
An entropy reduction approach to continual testing. 611-616 - Rémi A. Chou:
Private Classical Communication over Quantum Multiple-Access Channels. 617-622 - Sayantan Chakraborty, Aditya Nema, Pranab Sen:
A multi-sender decoupling theorem and simultaneous decoding for the quantum MAC. 623-627 - Sayantan Chakraborty, Aditya Nema, Pranab Sen:
Novel one-shot inner bounds for unassisted fully quantum channels via rate splitting. 628-633 - Neil Irwin Bernardo, Jingge Zhu, Jamie S. Evans:
Is Phase Shift Keying Optimal for Channels with Phase-Quantized Output? 634-639 - Andrea Cacioppo, Janis Nötzel, Matteo Rosati:
Compound Channel Capacities under Energy Constraints and Application. 640-645 - Thuan Nguyen, Thinh Nguyen:
Optimal Thresholding Quantizer Maximizing Mutual Information of Discrete Multiple-Input Continuous One-Bit Output Quantization. 646-651 - Jiasheng Yuan, Jiongyue Xing, Li Chen:
Plausibility Analysis of Shift-Sum Decoding for Cyclic Codes. 652-657 - Thomas Jerkovits, Vladimir Sidorenko, Antonia Wachter-Zeh:
Decoding of Space-Symmetric Rank Errors. 658-663 - Hedongliang Liu, Sabine Pircher, Alexander Zeh, Antonia Wachter-Zeh:
Decoding of (Interleaved) Generalized Goppa Codes. 664-669 - Ruida Zhou, Chao Tian, Tie Liu:
Individually Conditional Individual Mutual Information Bound on Generalization Error. 670-675 - Pradeep Kr. Banerjee, Guido Montúfar:
Information Complexity and Generalization Bounds. 676-681 - Gholamali Aminian, Laura Toni, Miguel R. D. Rodrigues:
Information-Theoretic Bounds on the Moments of the Generalization Error of Learning Algorithms. 682-687 - Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran:
Communication With Adversary Identification in Byzantine Multiple Access Channels. 688-693 - Hua Sun:
Compound Secure Groupcast: Key Assignment for Selected Broadcasting. 694-699 - Matthias Frey, Igor Bjelakovic, Slawomir Stanczak:
Towards Secure Over-The-Air Computation. 700-705 - K. K. Krishnan Namboodiri, B. Sundar Rajan:
Optimal Demand Private Coded Caching for Users with Small Buffers. 706-711 - Hamidreza Bakhshzad Mahmoodi, Mohammad Javad Salehi, Antti Tölli:
Non-Symmetric Coded Caching for Location-Dependent Content Delivery. 712-717 - Eleftherios Lampiris, Hamdi Joudeh, Giuseppe Caire, Petros Elia:
Coded Caching under Asynchronous Demands. 718-723 - Gustavo Kasper Facenda, Elad Domanovitz, Ashish Khisti, Wai-Tian Tan, John G. Apostolopoulos:
Streaming Erasure Codes over Multi-Access Relay Networks. 724-729 - Pin-Wen Su, Yu-Chih Huang, Shih-Chun Lin, I-Hsiang Wang, Chih-Chun Wang:
Random Linear Streaming Codes in the Finite Memory Length and Decoding Deadline Regime. 730-735 - Myna Vajha, Vinayak Ramkumar, M. Nikhil Krishnan, P. Vijay Kumar:
Explicit Rate-Optimal Streaming Codes with Smaller Field Size. 736-741 - Donald Q. Adams, Adarsh Barik, Jean Honorio:
Information-Theoretic Bounds for Integral Estimation. 742-747 - Amedeo Roberto Esposito, Michael Gastpar:
Lower-bounds on the Bayesian Risk in estimation procedures via Sibson's $\alpha$-Mutual Information. 748-753 - Xiaohan Kang, Bruce E. Hajek:
Lower Bounds on Information Requirements for Causal Network Inference. 754-759 - Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Achievable rate-region for 3 - User Classical-Quantum Interference Channel using Structured Codes. 760-765 - Evan J. D. Anderson, Saikat Guha, Boulat A. Bash:
Fundamental Limits of Bosonic Broadcast Channels. 766-771 - Uzi Pereg, Christian Deppe, Holger Boche:
Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters. 772-777 - Dadja Anade, Jean-Marie Gorce, Philippe Mary, Samir M. Perlaza:
Saddlepoint Approximations of Cumulative Distribution Functions of Sums of Random Vectors. 778-783 - Lin Zhou, Alfred O. Hero III:
Achievable Resolution Limits for the Noisy Adaptive 20 Questions Problem. 784-789 - Lin Zhou, Alfred O. Hero III:
Resolution Limits of Non-Adaptive 20 Questions Estimation for Multiple Targets. 790-795 - Cristina Fernández-Córdoba, Carlos Vela, Mercè Villanueva:
On the Linearity and Structure of Z2s-Linear Simplex and MacDonald Codes. 796-800 - Patrick Solé, Wei Cheng, Sylvain Guilley, Olivier Rioul:
Bent Sequences over Hadamard Codes for Physically Unclonable Functions. 801-806 - Mahdi Soleymani, Hessam Mahdavifar:
New Packings in Grassmannian Space. 807-812 - Jared Tanner, Giuseppe Ughi:
Mutual Information of Neural Network Initialisations: Mean Field Approximations. 813-818 - David Gamarnik, Eren C. Kizildag, Ilias Zadik:
Self-Regularity of Output Weights for Overparameterized Two-Layer Neural Networks. 819-824 - Daria Reshetova, Yikun Bai, Xiugang Wu, Ayfer Özgür:
Understanding Entropic Regularization in GANs. 825-830 - Morteza Soltani, Zouheir Rezki:
The Rate-Equivocation Region of the Degraded Discrete-Time Poisson Wiretap Channel. 831-836 - Jean de Dieu Mutangana, Ravi Tandon, Ziv Goldfeld, Shlomo Shamai Shitz:
Wiretap Channel with Latent Variable Secrecy. 837-842 - Yiqi Chen, Dan He, Chenhao Ying, Yuan Luo:
Strong Secrecy of Arbitrarily Varying Wiretap Channels with Constraints by Stochastic Code. 843-848 - Minquan Cheng, Dequan Liang, Kai Wan, Mingming Zhang, Giuseppe Caire:
A Novel Transformation Approach of Shared-link Coded Caching Schemes for Multiaccess Networks. 849-854 - Pooja Nayak Muralidhar, B. Sundar Rajan:
Multi-access Coded Caching from a New Class of Cross Resolvable Designs. 855-860 - Shanuja Sasi, B. Sundar Rajan:
Multi-access Coded Caching Scheme with Linear Sub-packetization using PDAs. 861-866 - Amit Berman, Sarit Buzaglo, Avner Dor, Yaron Shany, Itzhak Tamo:
Repairing Reed-Solomon Codes Evaluated on Subspaces. 867-871 - Magali Bardet, Rocco Mora, Jean-Pierre Tillich:
Decoding Reed-Solomon codes by solving a bilinear system with a Gröbner basis approach. 872-877 - Vinayak Ramkumar, Myna Vajha, P. Vijay Kumar:
Generalized Simple Streaming Codes from MDS Codes. 878-883 - Songtao Feng, Jing Yang:
Adaptive Surveillance Testing for Efficient Infection Rate Estimation. 884-889 - Belhal Karimi, Ping Li:
Two-Timescale Stochastic EM Algorithms. 890-895 - Kang Du, Yu Xiang:
Causal Inference Using Linear Time-Varying Filters with Additive Noise. 896-901 - Matteo Rosati:
Performance of Coherent Frequency-Shift Keying for Classical Communication on Quantum Channels. 902-905 - Dawei Ding, Sumeet Khatri, Yihui Quek, Peter W. Shor, Xin Wang, Mark M. Wilde:
Upper bound on the classical capacity of a quantum channel assisted by classical feedback. 906-911 - Holger Boche, Minglai Cai, H. Vincent Poor, Rafael F. Schaefer:
Detectability of Denial-of-Service Attacks on Arbitrarily Varying Classical-Quantum Channels. 912-917 - Neri Merhav:
On Error Exponents of Encoder-Assisted Communication Systems. 918-923 - Ran Tamir Averbuch, Neri Merhav:
Trade-Offs Between Error and Excess-Rate Exponents of Typical Slepian-Wolf Codes. 924-929 - Giuseppe Cocco, Albert Guillén i Fàbregas, Josep Font-Segura:
A Dual-Domain Achievability of the Typical Error Exponent. 930-933 - Nikita Polyanskii:
Two-Stage Coding over the Z-Channel. 934-939 - Mira Gonen, Michael Langberg, Alex Sprintson:
Minimizing the Alphabet Size in Codes with Restricted Error Sets. 940-945 - Xiaopeng Cheng, Ximing Fu, Yuanxin Guo, Kenneth W. Shum, Shenghao Yang:
Successively Solvable Shift-Add Systems - a Graphical Characterization. 946-951 - Fredrik Hellström, Giuseppe Durisi:
Fast-Rate Loss Bounds via Conditional Information Measures with Applications to Neural Networks. 952-957 - Weixin Liang, James Zou:
Neural Group Testing to Accelerate Deep Learning. 958-963 - Jeremy Johnston, Xiaodong Wang:
Model-Based Neural Networks for Massive and Sporadic Connectivity. 964-969 - Rumia Sultana, Rémi A. Chou:
Low-Complexity Secret Sharing Schemes Using Correlated Random Variables and Rate-Limited Public Communication. 970-975 - Donald Q. Adams, Hemanta K. Maji, Hai H. Nguyen, Minh L. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang:
Lower Bounds for Leakage-Resilient Secret-Sharing Schemes against Probing Attacks. 976-981 - Seunghoan Song, Masahito Hayashi:
Equivalence of Non-Perfect Secret Sharing and Symmetric Private Information Retrieval with General Access Structure. 982-987 - Venkatesan Guruswami, Andrii Riazanov:
Linear Shannon Capacity of Cayley Graphs. 988-992 - Lei Yu, Venkat Anantharam, Jun Chen:
Type Graphs and Small-Set Expansion. 993-998 - Himanshu Asnani, Jeff A. Bilmes, Rishabh K. Iyer:
Independence Properties of Generalized Submodular Information Measures. 999-1004 - Fan Zhou, Arini Fitri, Khoirul Anwar, Brian M. Kurkoski:
Encoding and Decoding Construction D' Lattices for Power-Constrained Communications. 1005-1010 - Obed Rhesa Ludwiniananda, Ning Liu, Khoirul Anwar, Brian M. Kurkoski:
Design of Polar Code Lattices of Finite Dimension. 1011-1016 - Shen Li, Ali Mirani, Magnus Karlsson, Erik Agrell:
Designing Voronoi Constellations to Minimize Bit Error Rate. 1017-1022 - Mario Díaz, Peter Kairouz, Jiachun Liao, Lalitha Sankar:
Neural Network-based Estimation of the MMSE. 1023-1028 - Kordag Mehmet Kilic, Jehoshua Bruck:
Neural Network Computations with DOMINATION Functions. 1029-1034 - Xu Wang, Ali Al-Bashabsheh, Chao Zhao, Chung Chan:
Adaptive Label Smoothing for Classifier-based Mutual Information Neural Estimation. 1035-1040 - Mehrdad Tahmasbi, Boulat A. Bash, Saikat Guha, Matthieu R. Bloch:
Signaling for Covert Quantum Sensing. 1041-1045 - Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha, Camilla Hollanti:
High-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes. 1046-1051 - Seunghoan Song, Masahito Hayashi:
Quantum Private Information Retrieval for Quantum Messages. 1052-1057 - Siyuan Wang, Qifa Yan, Jingjing Zhang, Jianping Wang, Linqi Song:
Coded Alternating Least Squares for Straggler Mitigation in Distributed Recommendations. 1058-1063 - Elahe Vedadi, Hulya Seferoglu:
Adaptive Coding for Matrix Multiplication at Edge Networks. 1064-1069 - Michael Rudow, K. V. Rashmi, Venkatesan Guruswami:
A locality-based lens for coded computation. 1070-1075 - Mikhail Kamenev:
Sequential Decoding of High-Rate Reed-Muller Codes. 1076-1081 - Dorsa Fathollahi, Nariman Farsad, Seyyed Ali Hashemi, Marco Mondelli:
Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes. 1082-1087 - Mohammad Vahid Jamali, Xiyang Liu, Ashok Vardhan Makkuva, Hessam Mahdavifar, Sewoong Oh, Pramod Viswanath:
Reed-Muller Subcodes: Machine Learning-Aided Design of Efficient Soft Recursive Decoding. 1088-1093 - Septimia Sarbu, Abdellatif Zaidi:
On Learning Parametric Distributions from Quantized Samples. 1094-1099 - Min-Oh Jeong, Alex Dytso, Martina Cardone:
Retrieving Data Permutations from Noisy Observations: High and Low Noise Asymptotics. 1100-1105 - Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann:
On maximum-likelihood estimation in the all-or-nothing regime. 1106-1111 - Zhusheng Wang, Karim Banawan, Sennur Ulukus:
An Information-Theoretic Scheme for Multi-Party Private Set Intersection. 1112-1117 - Swanand Kadhe, Nived Rajaraman, Kannan Ramchandran:
FastShare: Scalable Secret Sharing by Leveraging Locality. 1118-1123 - Yizhou Zhao, Hua Sun:
Information Theoretic Secure Aggregation with User Dropouts. 1124-1129 - Anelia Somekh-Baruch:
Robust Multicasting and an Upper Bound on the Mismatch Capacity of the DMC. 1130-1135 - Ehsan Asadi Kangarshahi, Albert Guillén i Fàbregas:
A Sphere-Packing Exponent for Mismatched Decoding. 1136-1141 - Marco Bondaschi, Albert Guillén i Fàbregas, Marco Dalai:
Zero-rate Reliability Function for Mismatched Decoding. 1142-1146 - Onur Günlü, Jörg Kliewer, Rafael F. Schaefer, Vladimir Sidorenko:
Doubly-Exponential Identification via Channels: Code Constructions and Bounds. 1147-1152 - Yunxiang Yao, Wai Ho Mow:
Optimal Index Assignment for Scalar Quantizers and M-PSK via a Discrete Convolution-Rearrangement Inequality. 1153-1158 - Gerhard Kramer:
Divergence Scaling for Distribution Matching. 1159-1163 - Qiuling Xu, Kevin Bello, Jean Honorio:
A Le Cam Type Bound for Adversarial Learning and Applications. 1164-1169 - Chuteng Zhou, Quntao Zhuang, Matthew Mattina, Paul N. Whatmough:
Strong data processing inequality in neural networks with noisy neurons and its implications. 1170-1175 - Arezou Rezazadeh, Sharu Theresa Jose, Giuseppe Durisi, Osvaldo Simeone:
Conditional Mutual Information-Based Generalization Bound for Meta Learning. 1176-1181 - Zihao Gong, Christos N. Gagatsos, Saikat Guha, Boulat A. Bash:
Fundamental Limits of Loss Sensing over Bosonic Channels. 1182-1187 - Hao-Chung Cheng, Andreas J. Winter, Nengkun Yu:
Discrimination of quantum states under locality constraints in the many-copy setting. 1188-1193 - Farzin Salek, Masahito Hayashi, Andreas J. Winter:
Asymptotic Separation Between Adaptive and Non-adaptive Strategies in Quantum Channel Discrimination. 1194-1199 - Chung-Yi Lin, Victoria Kostina, Babak Hassibi:
Differentially Quantized Gradient Descent. 1200-1205 - Mahdi Soleymani, Ramy E. Ali, Hessam Mahdavifar, Amir Salman Avestimehr:
List-Decodable Coded Computing: Breaking the Adversarial Toleration Barrier. 1206-1211 - Navjot Singh, Deepesh Data, Jemin George, Suhas N. Diggavi:
SQuARM-SGD: Communication-Efficient Momentum SGD for Decentralized Optimization. 1212-1217 - Hanwen Yao, Arman Fazeli, Alexander Vardy:
A Deterministic Algorithm for Computing the Weight Distribution of Polar Codes. 1218-1223 - Yuan Li, Huazi Zhang, Rong Li, Jun Wang, Guiying Yan, Zhiming Ma:
On the Weight Spectrum of Pre-Transformed Polar Codes. 1224-1229 - Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
On the Automorphism Group of Polar Codes. 1230-1235 - Batuhan Arasli, Sennur Ulukus:
Graph and Cluster Formation Based Group Testing. 1236-1241 - Surin Ahn, Wei-Ning Chen, Ayfer Özgür:
Adaptive Group Testing on Networks with Community Structure. 1242-1247 - Larkin Flodin, Arya Mazumdar:
Probabilistic Group Testing with a Linear Number of Tests. 1248-1253 - Alireza Poostindouz, Reihaneh Safavi-Naini:
Second-Order Asymptotics for One-way Secret Key Agreement. 1254-1259 - Carlos Aguilar Melchor, Nicolas Aragon, Victor Dyseryn, Philippe Gaborit:
Fast and Secure Key Generation for Low Rank Parity Check Codes Cryptosystems. 1260-1265 - Alexander Nilsson, Irina E. Bocharova, Boris D. Kudryashov, Thomas Johansson:
A Weighted Bit Flipping Decoder for QC-MDPC-based Cryptosystems. 1266-1271 - Amos Lapidoth, Gian Marti, Yiming Yan:
Other Helper Capacities. 1272-1277 - Cihan Tepedelenlioglu:
Channel Inclusion Beyond Discrete Memoryless Channels. 1278-1283 - Dror Drach, Or Ordentlich, Ofer Shayevitz:
Binary Maximal Correlation Bounds and Isoperimetric Inequalities via Anti-Concentration. 1284-1289 - Andreas Lenz, Rawad Bitar, Antonia Wachter-Zeh, Eitan Yaakobi:
Function-Correcting Codes. 1290-1295 - Yiheng Zhang, Ximing Fu, Xuanchen Wu, Shenghao Yang, Kenneth W. Shum:
Solving Monoshift Systems and Applications in Random Coding. 1296-1301 - Venkatesan Guruswami, Andrii Riazanov:
Linear Programming Bounds for Almost-Balanced Binary Codes. 1302-1307 - Olusola Tolulope Odeyomi, Gergely V. Záruba:
Differentially-Private Federated Learning with Long-Term Constraints Using Online Mirror Descent. 1308-1313 - Zitao Li, Jean Honorio:
Regularized Loss Minimizers with Local Data Perturbation: Consistency and Data Irrecoverability. 1314-1319 - Ye Wang, Shuchin Aeron, Adnan Siraj Rakin, Toshiaki Koike-Akino, Pierre Moulin:
Robust Machine Learning via Privacy/ Rate-Distortion Theory. 1320-1325 - Masahito Hayashi, Kun Fang, Kun Wang:
Finite Block Length Analysis on Quantum Coherence Distillation and Incoherent Randomness Extraction. 1326-1331 - Yichen Huang:
Entanglement Dynamics from Random Product States at Long Times. 1332-1337 - Yuwen Huang, Pascal O. Vontobel:
Sets of Marginals and Pearson-Correlation-based CHSH Inequalities for a Two-Qubit System. 1338-1343 - Abbas El Gamal, Amin Gohari, Chandra Nair:
Strengthened Cutset Upper Bound on the Capacity of the Relay Channel and Applications. 1344-1349 - Sarthak Jain, Martina Cardone, Soheil Mohajer:
When an Energy-Efficient Scheduling is Optimal for Half-Duplex Relay Networks? 1350-1355 - Yan Hao Ling, Jonathan Scarlett:
Optimal Rates of Teaching and Learning Under Binary Symmetric Noise. 1356-1360 - Shashwat Silas:
Real-time oblivious erasure correction with linear time decoding and constant feedback. 1361-1366 - Nadim Ghaddar, Shouvik Ganguly, Lele Wang, Young-Han Kim:
A Lego-Brick Approach to Coding for Asymmetric Channels and Channels with State. 1367-1372 - Ismail Senöz, Albert Podusenko, Semih Akbayrak, Christoph Mathys, Bert de Vries:
The Switching Hierarchical Gaussian Filter. 1373-1378 - Lei Liu, Shunqi Huang, Brian M. Kurkoski:
Memory Approximate Message Passing. 1379-1384 - Keigo Takeuchi:
Bayes-Optimal Convolutional AMP. 1385-1390 - Carolina Naim, Rafael G. L. D'Oliveira, Salim El Rouayheb:
Private Multi-Group Aggregation. 1391-1396 - Masahito Hayashi:
Secure Modulo Sum via Multiple Access Channel. 1397-1402 - Onur Günlü, Matthieu R. Bloch, Rafael F. Schaefer:
Secure Multi-Function Computation with Private Remote Sources. 1403-1408 - Hoover H. F. Yin, Ka Hei Ng, Allen Z. Zhong, Raymond W. Yeung, Shenghao Yang:
Intrablock Interleaving for Batched Network Coding with Blockwise Adaptive Recoding. 1409-1414 - Hoover H. F. Yin, Ka Hei Ng:
Impact of Packet Loss Rate Estimation on Blockwise Adaptive Recoding for Batched Network Coding. 1415-1420 - Michael Langberg, Michelle Effros:
Edge removal in undirected networks. 1421-1426 - Jie Wang, Zhiyuan Jia, Hoover H. F. Yin, Shenghao Yang:
Small-Sample Inferred Adaptive Recoding for Batched Network Coding. 1427-1432 - Jinjun Cheng, Li Chen:
BCH Based U-UV Codes and Its Decoding. 1433-1438 - Yihan Zhang, Sidharth Jaggi, Amitalok J. Budkuley:
Tight List-Sizes for Oblivious AVCs under Constraints. 1439-1444 - Shota Saito, Toshiyasu Matsushima:
Evaluation of Error Probability of Classification Based on the Analysis of the Bayes Code: Extension and Example. 1445-1450 - Taishi Watanabe, Takeo Ohseki, Kosuke Yamazaki:
Deep Learning-Based Bit Reliability Based Decoding for Non-binary LDPC Codes. 1451-1456 - P. N. Karthik, Rajesh Sundaresan:
Learning to Detect an Odd Restless Markov Arm. 1457-1462 - Hyejin Park, Seiyun Shin, Kwang-Sung Jun, Jungseul Ok:
Transfer Learning in Bandits with Latent Continuity. 1463-1468 - Mohsen Heidari, Arun Padakandla, Wojciech Szpankowski:
A Theoretical Framework for Learning from Quantum Data. 1469-1474 - Saptarshi Chakraborty, Debolina Paul, Swagatam Das:
$t$-Entropy: A New Measure of Uncertainty with Some Applications. 1475-1480 - Jingzhen Hu, Qingzhong Liang, Narayanan Rengaswamy, A. Robert Calderbank:
CSS Codes that are Oblivious to Coherent Noise. 1481-1486 - Ashutosh Goswami, Mehdi Mhalla, Valentin Savin:
Quantum Polarization of Qudit Channels. 1487-1492 - Taro Shibayama, Manabu Hagiwara:
Permutation-Invariant Quantum Codes for Deletion Errors. 1493-1498 - Yingkai Ouyang:
Permutation-invariant quantum coding for quantum deletion channels. 1499-1503 - Efe Aras, Thomas A. Courtade:
Sharp Maximum-Entropy Comparisons. 1504-1509 - Erixhen Sula, Michael Gastpar:
Lower bound on relaxed Wyner's Common Information. 1510-1515 - Laigang Guo, Chun-Ming Yuan, Xiao-Shan Gao:
Lower Bound for Derivatives of Costa's Differential Entropy. 1516-1521 - Ming Li, Yupeng Jiang, Dongdai Lin:
Construction of De Bruijn Sequences from l-sequences. 1522-1527 - Sagi Marcovich, Tuvi Etzion, Eitan Yaakobi:
Balanced de Bruijn Sequences. 1528-1533 - Sharu Theresa Jose, Osvaldo Simeone:
An Information-Theoretic Analysis of the Impact of Task Similarity on Meta-Learning. 1534-1539 - Xuetong Wu, Jonathan H. Manton, Uwe Aickelin, Jingge Zhu:
Online Transfer Learning: Negative Transfer and Effect of Prior Knowledge. 1540-1545 - Samrat Mukhopadhyay, Abhishek Sinha:
Online Caching with Optimal Switching Regret. 1546-1551 - Kao-Yueh Kuo, I-Chun Chern, Ching-Yi Lai:
Decoding of Quantum Data-Syndrome Codes via Belief Propagation. 1552-1557 - July X. Li, Joseph M. Renes, Pascal O. Vontobel:
Pseudocodeword-based Decoding of Quantum Color Codes. 1558-1563 - Nithin Raveendran, Bane Vasic:
Trapping Set Analysis of Finite-Length Quantum LDPC Codes. 1564-1569 - Anindya Bijoy Das, Aditya Ramamoorthy:
Coded sparse matrix computation schemes that leverage partial stragglers. 1570-1575 - Weiqi Li, Zhen Chen, Zhiying Wang, Syed Ali Jafar, Hamid Jafarkhani:
Flexible Constructions for Distributed Matrix Multiplication. 1576-1581 - Viveck R. Cadambe, Flávio P. Calmon, Ateet Devulapalli, Haewon Jeong:
E-Approximate Coded Matrix Multiplication is Nearly Twice as Efficient as Exact Multiplication. 1582-1587 - Lei Liu, Chulong Liang, Junjie Ma, Li Ping:
Capacity Optimality of AMP in Coded Systems. 1588-1593 - Arman Fazeli, Alexander Vardy, Hanwen Yao:
List Decoding of Polar Codes: How Large Should the List Be to Achieve ML Decoding? 1594-1599 - Yonatan Urman, David Burshtein:
Efficient Maximum Likelihood Decoding of Polar Codes Over the Binary Erasure Channel. 1600-1605 - Lekshmi Ramesh, Chandra R. Murthy, Himanshu Tyagi:
Phase Transitions for Support Recovery from Gaussian Linear Measurements. 1606-1611 - Ivan Lau, Jonathan Jedwab:
Construction of binary matrices for near-optimal compressed sensing. 1612-1617 - Zhongxing Sun, Wei Cui, Yulong Liu:
Phase Transitions in Recovery of Structured Signals from Corrupted Measurements. 1618-1623 - Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper. 1624-1629 - Moritz Wiese, Holger Boche:
Mosaics of combinatorial designs for privacy amplification. 1630-1635 - Charbel Saliba, Laura Luzzi, Cong Ling:
A reconciliation approach to key generation based on Module-LWE. 1636-1641 - Yirui Liu, John MacLaren Walsh:
Linear Complexity Entropy Regions. 1642-1647 - Jingbo Liu:
Soft Minoration: Solution to Cover's Problem In the Original Discrete Memoryless Setting. 1648-1652 - Cheuk Ting Li:
Infinite Divisibility of Information. 1653-1658 - Tingyao Xiong, Jonathan I. Hall:
Sieves for Binary Sequences with large SRS and SHG Contrast Ratios. 1659-1664 - P. Vijay Kumar, Dileep Dharmappa, Sugandh Mishra:
Interleaved $Z_{4}$-Linear Sequences with Improved Correlation for Satellite Navigation. 1665-1670 - Mahyar Shirvanimoghaddam:
On the Hamming Weight Distribution of Subsequences of Pseudorandom Sequences. 1671-1675 - Harshat Kumar, Dionysios S. Kalogerias, George J. Pappas, Alejandro Ribeiro:
Actor-only Deterministic Policy Gradient via Zeroth-order Gradient Oracles in Action Space. 1676-1681 - Chengzhuo Ni, Anru R. Zhang, Yaqi Duan, Mengdi Wang:
Learning Good State and Action Representations via Tensor Decomposition. 1682-1687 - Vrettos Moulos:
Bicausal Optimal Transport for Markov Chains via Dynamic Programming. 1688-1693 - Kui Cai, Han Mao Kiah, Mehul Motani, Tuan Thanh Nguyen:
Coding for Segmented Edits with Local Weight Constraints. 1694-1699 - Yonatan Yehezkeally, Nikita Polyanskii:
On Codes for the Noisy Substring Channel. 1700-1705 - Maria Abu Sini, Eitan Yaakobi:
On List Decoding of Insertions and Deletions under the Reconstruction Model. 1706-1711 - Aditya Ramamoorthy, Li Tang:
Numerically stable coded matrix computations via circulant and rotation matrix embeddings. 1712-1717 - Asit Kumar Pradhan, Anoosheh Heidarzadeh, Krishna R. Narayanan:
Asymptotic Analysis of Factored LT Codes for Distributed Matrix Multiplication. 1718-1723 - Anindya Bijoy Das, Aditya Ramamoorthy, Namrata Vaswani:
Efficient and Robust Distributed Matrix Computations via Convolutional Coding. 1724-1729 - Hanwen Yao, Hessam Mahdavifar, Arman Fazeli, Alexander Vardy:
Channel Combining for Nonstationary Polarization on Erasure Channels. 1730-1735 - Valerio Bioglio, Carlo Condo, Ingmar Land:
Sliding Window Polar Codes. 1736-1741 - Fariba Abbasi, Hessam Mahdavifar, Emanuele Viterbo:
Hybrid Non-Binary Repeated Polar Codes For Low-SNR Regime. 1742-1747 - Lekshmi Ramesh, Chandra R. Murthy, Himanshu Tyagi:
Multiple Support Recovery Using Very Few Measurements Per Sample. 1748-1753 - Mohammad Mehrabi, Aslan Tchamkerten:
Error-Correction for Sparse Support Recovery Algorithms. 1754-1759 - Hang Zhang, Ping Li:
Sparse Recovery with Shuffled Labels: Statistical Limits and Practical Estimators. 1760-1765 - Xiang Zhang, Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
A New Design of Cache-aided Multiuser Private Information Retrieval with Uncoded Prefetching. 1766-1771 - Sajani Vithana, Karim Banawan, Sennur Ulukus:
Semantic Private Information Retrieval From MDS-Coded Databases. 1772-1777 - Yi-Sheng Su:
Private Information Retrieval Using Circulant Permutation Matrices or the Zero Matrix. 1778-1783 - Ryo Nomura, Hideki Yagi:
Optimum Intrinsic Randomness Rate with Respect to f -Divergences Using the Smooth Min Entropy. 1784-1789 - Anshuka Rangi, Massimo Franceschetti:
Channel Coding Theorems in Non-stochastic Information Theory. 1790-1795 - Amedeo Roberto Esposito, Diyuan Wu, Michael Gastpar:
On conditional Sibson's $\alpha$ -Mutual Information. 1796-1801 - Zhi Gu, Zhengchun Zhou, Avik Ranjan Adhikary, Yanghe Feng, Pingzhi Fan:
Construction of Golay-ZCZ Sequences with New Lengths. 1802-1805 - Ana-Isabel Gómez, Domingo Gómez-Pérez, Andrew Z. Tirkel:
Generalised GMW Sequences. 1806-1811 - Minghui Yang, Shiyuan Qiang, Keqin Feng, Dongdai Lin:
On the 4-Adic Complexity of Quaternary Sequences of Period $2p$ with Ideal Autocorrelation. 1812-1816 - Abram Magner:
On Dimension in Graph Convolutional Networks for Distinguishing Random Graph Models. 1817-1822 - Nishant Mehrotra, Eric Graves, Ananthram Swami, Ashutosh Sabharwal:
Minimax Bounds for Blind Network Inference. 1823-1828 - Ning Zhang, Weina Wang, Lele Wang:
Attributed Graph Alignment. 1829-1834 - Yuanyuan Tang, Hao Lou, Farzad Farnoud:
Error-correcting codes for short tandem duplications and at most $p$ substitutions. 1835-1840 - Alexander R. Block, Jeremiah Blocki:
Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions. 1841-1846 - Daniella Bar-Lev, Yotam Gershon, Omer Sabary, Eitan Yaakobi:
Decoding for Optimal Expected Normalized Distance over the t-Deletion Channel. 1847-1852 - Burak Hasircioglu, Jesús Gómez-Vilardebó, Deniz Gündüz:
Speeding Up Private Distributed Matrix Multiplication via Bivariate Polynomial Codes. 1853-1858 - Jie Li, Camilla Hollanti:
Improved Private and Secure Distributed Matrix Multiplication. 1859-1864 - Mahdi Soleymani, Hessam Mahdavifar, Amir Salman Avestimehr:
Analog Privacy-Preserving Coded Computing. 1865-1870 - Shih-Chun Lin, Chih-Chun Wang, I-Hsiang Wang, Yu-Chih Huang, Yi-Chun Lai:
On finite-length analysis and channel dispersion for broadcast packet erasure channels with feedback. 1871-1876 - Yuxin Liu, Michelle Effros:
Nested LDPC Codes for Random Access Communication. 1877-1882 - Recep Can Yavas, Victoria Kostina, Michelle Effros:
Variable-length Feedback Codes with Several Decoding Times for the Gaussian Channel. 1883-1888 - Maël Le Treust, Tobias J. Oechtering:
Continuous Random Variable Estimation is not Optimal for the Witsenhausen Counterexample. 1889-1894 - Rahul Arya, Chih-Yuan Chiu, Gireeja Ranade:
Stabilizability of Vector Systems with Uniform Actuation Unpredictability. 1895-1900 - Photios A. Stavrou, Mikael Skoglund:
New Formulation of NRDF to Compute Partially Observed Gaussian Processes with MSE Distortion. 1901-1906 - Islam Samy, Mohamed Adel Attia, Ravi Tandon, Loukas Lazos:
On the Capacity of Latent Variable Private Information Retrieval. 1907-1912 - Bar Sadeh, Yujie Gu, Itzhak Tamo:
Bounds on the Capacity of PIR over Graphs. 1913-1918 - Ruida Zhou, Chao Tian, Hua Sun, James S. Plank:
Two-Level Private Information Retrieval. 1919-1924 - Rami Ezzine, Moritz Wiese, Christian Deppe, Holger Boche:
Common Randomness Generation over Slow Fading Channels. 1925-1930 - Yanjun Han, Kedar Tatwawadi, Gowtham R. Kurri, Zhengqing Zhou, Vinod M. Prabhakaran, Tsachy Weissman:
Optimal Communication Rates and Combinatorial Properties for Common Randomness Generation. 1931-1936 - Aditya Narayan Ravi, Alireza Vahid, Ilan Shomorony:
Capacity of the Torn Paper Channel with Lost Pieces. 1937-1942 - Han Mao Kiah, Alexander Vardy, Hanwen Yao:
Efficient Bee Identification. 1943-1948 - Konstantin Makarychev, Miklós Z. Rácz, Cyrus Rashtchian, Sergey Yekhanin:
Batch Optimization for DNA Synthesis. 1949-1954 - Gabriel Arpino, Nicolò Grometto, Afonso S. Bandeira:
Group Testing in the High Dilution Regime. 1955-1960 - Thach V. Bui, Mahdi Cheraghchi, Thuc Dinh Nguyen:
Improved algorithms for non-adaptive group testing with consecutive positives. 1961-1966 - Nelvin Tan, Jonathan Scarlett:
An Analysis of the DD Algorithm for Group Testing with Size-Constrained Tests. 1967-1972 - Mahdi Cheraghchi, Ryan Gabrys, Olgica Milenkovic:
Semiquantitative Group Testing in at Most Two Rounds. 1973-1978 - Daniella Bar-Lev, Tuvi Etzion, Eitan Yaakobi:
On Levenshtein Balls with Radius One. 1979-1984 - Serge Kas Hanna, Rawad Bitar:
Detecting Deletions and Insertions in Concatenated Strings with Optimal Redundancy. 1985-1990 - Rawad Bitar, Serge Kas Hanna, Nikita Polyanskii, Ilya Vorobyev:
Optimal Codes Correcting Localized Deletions. 1991-1996 - Robert Graczyk, Amos Lapidoth, Yiming Yan:
Guessing a Tuple. 1997-2001 - Gowtham R. Kurri, Oliver Kosut, Lalitha Sankar:
Evaluating Multiple Guesses by an Adversary via a Tunable Loss Function. 2002-2007 - Shigeaki Kuzuoka:
Asynchronous Guessing Subject to Distortion. 2008-2012 - Yulong You, Sian-Jheng Lin:
Efficient Codebook Constructions of AIVF Codes. 2013-2017 - Ken-ichi Iwata, Hirosuke Yamamoto:
AIVF Codes Based on Iterative Algorithm and Dynamic Programming. 2018-2023 - Hoover H. F. Yin, Xishi Wang, Ka Hei Ng, Russell W. F. Lai, Lucien K. L. Ng, Jack P. K. Ma:
On Multi-Channel Huffman Codes for Asymmetric-Alphabet Channels. 2024-2029 - J. Jon Ryu, Jiun-Ting Huang, Young-Han Kim:
On the Role of Eigendecomposition in Kernel Embedding. 2030-2035 - Chen-Hao Hsiao, I-Hsiang Wang:
Joint Clustering and Ranking from Heterogeneous Pairwise Comparisons. 2036-2041 - Neharika Jali, Nikhil Karamchandani, Sharayu Moharir:
Greedy $k$-Center from Noisy Distance Samples. 2042-2047 - D. Shivakrishna, Aaditya M. Nair, V. Lalitha:
A Field Size Bound and Constructions of Maximally Recoverable Codes with Hierarchical Locality. 2048-2053 - Lukas Holzbaur, Sven Puchinger, Eitan Yaakobi, Antonia Wachter-Zeh:
Correctable Erasure Patterns in Product Topologies. 2054-2059 - Tim Hellemans, Arti D. Yardi, Tejas Bodas:
Download time analysis for distributed storage systems with node failures. 2060-2065 - Farhad Mirkarimi, Nariman Farsad:
Neural Computation of Capacity Region of Memoryless Multiple Access Channels. 2066-2071 - Yihan Zhang:
Zero-Error Communication over Adversarial MACs. 2072-2077 - Kenneth Palacio-Baus, Natasha Devroye:
Achievable Error Exponents for Two-Way AWGN Channels. 2078-2083 - Grigorii Trofimiuk:
A Search Method for Large Polarization Kernels. 2084-2089 - Peter Trifonov:
Recursive Trellis Processing of Large Polarization Kernels. 2090-2095 - Min Ye:
On the extremal configurations of MAC polarization over erasure channels. 2096-2100 - Qian Yu, Yury Polyanskiy:
Broadcasting on Trees Near Criticality: Perturbation Theory. 2101-2106 - Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Reconstruction on 2D Regular Grids. 2107-2112 - Geewon Suh, Sangwoo Jeon, Changho Suh:
When to Use Graph Side Information in Matrix Completion. 2113-2118 - Zhusheng Wang, Sennur Ulukus:
Symmetric Private Information Retrieval with User-Side Common Randomness. 2119-2124 - Nahid Esmati, Anoosheh Heidarzadeh, Alex Sprintson:
Private Linear Transformation: The Joint Privacy Case. 2125-2130 - Nahid Esmati, Anoosheh Heidarzadeh, Alex Sprintson:
Private Linear Transformation: The Individual Privacy Case. 2131-2136 - Heecheol Yang, Sangwoo Hong, Jungwoo Lee:
Private and Secure Coded Computation in Straggler-Exploiting Distributed Matrix Multiplication. 2137-2142 - Saikiran Bulusu, Venkata Gandikota, Arya Mazumdar, Ankit Singh Rawat, Pramod K. Varshney:
Byzantine Resilient Distributed Clustering with Redundant Data Assignment. 2143-2148 - Kai Wan, Hua Sun, Mingyue Ji, Giuseppe Caire:
Secure Distributed Linearly Separable Computation. 2149-2154 - Yinfei Xu, Qizhou Guo, Jian Lu, Zhicheng Liu, Xuan Guang:
Two-Way Lossy Compression of Product Sources With a Helper. 2155-2160 - Naifu Zhang, Meixia Tao, Jia Wang:
Sum-Rate-Distortion Function for Indirect Multiterminal Source Coding in Federated Learning. 2161-2166 - Evagoras Stylianou, Charalambos D. Charalambous, Themistoklis Charalambous:
Joint Rate Distortion Function of a Tuple of Correlated Multivariate Gaussian Sources with Individual Fidelity Criteria. 2167-2172 - Matthew L. Malloy, Ardhendu Tripathy, Robert D. Nowak:
Optimal Confidence Sets for the Multinomial Parameter. 2173-2178 - Leighton Pate Barnes, Ayfer Özgür:
Fisher Information and Mutual Information Constraints. 2179-2184 - Atin Gayen, M. Ashok Kumar:
A Generalized notion of Sufficiency for Power-law Distributions. 2185-2190 - Hanxu Hou, Patrick P. C. Lee:
Generalized Rack-aware Regenerating Codes for Jointly Optimal Node and Rack Repairs. 2191-2196 - Adway Patra, Alexander Barg:
Regenerating codes on graphs. 2197-2202 - Zhifang Zhang, Liyang Zhou:
Rack-Aware Regenerating Codes with Fewer Helper Racks. 2203-2207 - Adriano Pastore, Sung Hoon Lim, Chen Feng, Bobak Nazer, Michael Gastpar:
A Discretization Approach to Compute-Forward. 2208-2213 - Oliver Kosut, Michelle Effros, Michael Langberg:
Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel. 2214-2219 - Fei Wei, Oliver Kosut:
A Wringing-Based Proof of a Second-Order Converse for the Multiple-Access Channel under Maximal Error Probability. 2220-2225 - Sisi Miao, Christian Senger:
Dual-containing Alternant Codes for Applications in the Calderbank-Shor-Steane Construction. 2226-2231 - Narayanan Rengaswamy, Henry D. Pfister:
On the Duality Between the BSC and Quantum PSC. 2232-2237 - Francisco Revson Fernandes Pereira, Stefano Mancini:
Polar Codes for Quantum Reading. 2238-2243 - Seyedehsara Nayer, Namrata Vaswani:
Sample-Efficient Low Rank Phase Retrieval. 2244-2249 - Yunzhen Yao, Liangzu Peng, Manolis C. Tsakiris:
Unsigned Matrix Completion. 2250-2255 - Yanting Ma, Min Kang, Jack W. Silverstein, Dror Baron:
Local Convergence of an AMP Variant to the LASSO Solution in Finite Dimensions. 2256-2261 - Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval. 2262-2267 - Karim Banawan, Ahmed Arafa, Sennur Ulukus:
Timely Private Information Retrieval. 2268-2273 - Sahasrajit Sarmasarkar, V. Lalitha, Nikhil Karamchandani:
On Gradient Coding with Partial Recovery. 2274-2279 - Margalit Glasgow, Mary Wootters:
Approximate Gradient Coding with Optimal Decoding. 2280-2285 - Birenjith Sasidharan, Anoop Thomas:
Coded Gradient Aggregation: A Tradeoff Between Communication Costs at Edge Nodes and at Helper Nodes. 2286-2291 - Anders Høst-Madsen:
Bounds for Learning Lossless Source Coding. 2292-2297 - Neri Merhav:
On More General Distributions of Random Binning for Slepian-Wolf Encoding. 2298-2303 - Shirin Saeedi Bidokhti, Aylin Yener:
On the Timeliness of Arithmetic Coding. 2304-2309 - Deepesh Data, Suhas N. Diggavi:
Byzantine-Resilient SGD in High Dimensions on Heterogeneous Data. 2310-2315 - Abdulrahman Alabdulkareem, Jean Honorio:
Information-theoretic lower bounds for zero-order stochastic gradient estimation. 2316-2321 - Krishna Reddy Kesari, Jean Honorio:
First Order Methods take Exponential Time to Converge to Global Minimizers of Non-Convex Functions. 2322-2327 - Zhengyi Jiang, Hanxu Hou, Yunghsiang S. Han, Zhongyi Huang, Bo Bai, Gong Zhang:
An Efficient Piggybacking Design with Lower Repair Bandwidth and Lower Sub-packetization. 2328-2333 - Francisco Maturana, K. V. Rashmi:
Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions. 2334-2339 - Rooji Jinan, Ajay Badita, Pradeep Kiran Sarvepalli, Parimal Parag:
Low latency replication coded storage over memory -constrained servers. 2340-2345 - Hei Victor Cheng, Wei Yu:
Multiplexing Gain of Modulating Phases Through Reconfigurable Intelligent Surface. 2346-2351 - Roy Karasik, Osvaldo Simeone, Marco Di Renzo, Shlomo Shamai:
Single-RF Multi-User Communication Through Reconfigurable Intelligent Surfaces: An Information-Theoretic Analysis. 2352-2357 - Chuan-Zheng Lee, Leighton Pate Barnes, Ayfer Özgür:
Lower Bounds for Over-the-Air Statistical Estimation. 2358-2363 - Jun Muramatsu:
Successive-Cancellation Decoding of Binary Polar Codes Based on Symmetric Parametrization. 2364-2368 - Seyyed Ali Hashemi, Marco Mondelli, Arman Fazeli, Alexander Vardy, John M. Cioffi, Andrea Goldsmith:
Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes. 2369-2374 - Suihua Cai, Haowei Chen, Baodian Wei, Xiao Ma:
Dual Coupled Polar Codes with Successive Cancellation List Decoding. 2375-2380 - P. Charantej Reddy, V. S. S. Prabhu Tej, Aditya Siripuram, Brad Osgood:
Computing the Discrete Fourier Transform of signals with spectral frequency support. 2381-2386 - Samuel Pinilla, Kumar Vijay Mishra, Brian M. Sadler:
WaveMax: FrFT-Based Convex Phase Retrieval for Radar Waveform Design. 2387-2392 - Setareh Sharifian, Reihaneh Safavi-Naini:
Information-theoretic Key Encapsulation and its Application to Secure Communication. 2393-2398 - Thom Wiggers, Simona Samardjiska:
Practically Solving LPN. 2399-2404 - Qian Guo, Erik Mårtensson, Paul Stankovski Wagner:
On the Sample Complexity of solving LWE using BKW-Style Algorithms. 2405-2410 - Gowtham R. Kurri, Viswanathan Ramachandran, Sibi Raj B. Pillai, Vinod M. Prabhakaran:
Multiple Access Channel Simulation. 2411-2416 - Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Synthesizing Correlated Randomness using Algebraic Structured Codes. 2417-2422 - Mohammadamin Baniasadi, Ertem Tuncel:
Robust Gaussian JSCC Under the Near-Infinity Bandwidth Regime with Side Information at the Receiver. 2423-2428 - Yashas Malur Saidutta, Afshin Abdi, Faramarz Fekri:
Analog Joint Source-Channel Coding for Distributed Functional Compression using Deep Neural Networks. 2429-2434 - Assaf Ben-Yishai, Or Ordentlich:
Constructing Multiclass Classifiers using Binary Classifiers Under Log-Loss. 2435-2440 - Yuval Cassuto, Yongjune Kim:
Boosting for Straggling and Flipping Classifiers. 2441-2446 - Bijan Mazaheri, Siddharth Jain, Jehoshua Bruck:
Synthesizing New Expertise via Collaboration. 2447-2452 - Sundara Rajan Srinivasavaradhan, Sivakanth Gopi, Henry D. Pfister, Sergey Yekhanin:
Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage. 2453-2458 - Mahdi Cheraghchi, Joseph Downs, João Ribeiro, Alexandra Veliche:
Mean-Based Trace Reconstruction over Practically any Replication-Insertion Channel. 2459-2464 - Reyna Hulett, Shubham Chandak, Mary Wootters:
On Coding for an Abstracted Nanopore Channel for DNA Storage. 2465-2470 - Kuan Hsieh, Cynthia Rush, Ramji Venkataramanan:
Near-Optimal Coding for Massive Multiple Access. 2471-2476 - Jyotish Robin, Elza Erkip:
Capacity Bounds and User Identification Costs in Rayleigh-Fading Many-Access Channel. 2477-2482 - Hao Xu, Tianyu Yang, Giuseppe Caire, Shlomo Shamai Shitz:
Information Bottleneck for an Oblivious Relay with Channel State Information: the Vector Case. 2483-2488 - Jian-Jia Weng, Fady Alajaji, Tamás Linder:
An Information Bottleneck Problem with Rényi's Entropy. 2489-2494 - Michael Dikshtein, Or Ordentlich, Shlomo Shamai Shitz:
The Double-Sided Information-Bottleneck Function. 2495-2500 - Kazuho Watanabe:
Statistical Learning of the Insensitive Parameter in Support Vector Models. 2501-2506 - Gil I. Shamir, Wojciech Szpankowski:
A Lower Bound for Regret in Logistic Regression. 2507-2512 - Anmol Dwivedi, Sihui Wang, Ali Tajer:
Linear Discriminant Analysis under $f$-divergence Measures. 2513-2518 - Jin Sima, Jehoshua Bruck:
Trace Reconstruction with Bounded Edit Distance. 2519-2524 - Sami Davies, Miklós Z. Rácz, Benjamin G. Schiffer, Cyrus Rashtchian:
Approximate Trace Reconstruction: Algorithms. 2525-2530 - Elena Grigorescu, Madhu Sudan, Minshen Zhu:
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance. 2531-2536 - Vijith Kumar K. P, Brijesh Kumar Rai, Tony Jacob:
Pareto Optimal Schemes in Coded Caching: Uncoded Prefetching. 2537-2541 - Xinyu Xie, Weiyi Tan, Jinbei Zhang, Zhiyong Luo:
Coded Caching for Two Users with Distinct File Sizes. 2542-2547 - Yirui Liu, John MacLaren Walsh:
Exponentially Simpler Network Rate Regions. 2548-2553 - Henry D. Pfister, Ido Tal:
Polar Codes for Channels with Insertions, Deletions, and Substitutions. 2554-2559 - Karthik Nagarjuna Tunuguntla, Paul H. Siegel:
Polar Shaping Codes for Costly Noiseless and Noisy Channels. 2560-2565 - Jincheng Dai, Kai Niu, Jinnan Piao:
Fast Construction of Bit-Interleaved Polar-Coded Modulation. 2566-2571 - Eray Can Elumar, Mansi Sood, Osman Yagan:
On the Connectivity and Giant Component Size of Random K-out Graphs Under Randomly Deleted Nodes. 2572-2577 - Jiajun Liang, Chuyang Ke, Jean Honorio:
Information Theoretic Limits of Exact Recovery in Sub-hypergraph Models for Community Detection. 2578-2583 - Ni Ding, Mohammad Amin Zarrabian, Parastoo Sadeghi:
$\alpha$-Information-theoretic Privacy Watchdog and Optimal Privatization Scheme. 2584-2589 - Yucheng Liu, Lawrence Ong, Sarah Johnson, Jörg Kliewer, Parastoo Sadeghi, Phee Lep Yeoh:
Information Leakage in Zero-Error Source Coding: A Graph-Theoretic Perspective. 2590-2595 - Olivier Rioul, Wei Cheng, Sylvain Guilley:
Cumulant Expansion of Mutual Information for Quantifying Leakage of a Protected Secret. 2596-2601 - Amit Solomon, Ken R. Duffy, Muriel Médard:
Managing Noise and Interference Separately - Multiple Access Channel Decoding using Soft GRAND. 2602-2607 - Ya-Chun Liang, Chung-Shou Liao, Xinping Yi:
Topological Interference Management with Adversarial Perturbation. 2608-2613 - Rajesh K. Mishra, Karl Chahine, Hyeji Kim, Syed Ali Jafar, Sriram Vishwanath:
Distributed Interference Alignment for K-user Interference Channels via Deep Learning. 2614-2619 - Sagnik Bhattacharya, Prakash Narayan:
Universal Single-Shot Sampling Rate Distortion. 2620-2624 - Shlomi Agmon, Etam Benger, Or Ordentlich, Naftali Tishby:
Critical Slowing Down Near Topological Transitions in Rate-Distortion Problems. 2625-2630 - Michail Gkagkos, Charalambos D. Charalambous:
Structural Properties of Test Channels of the RDF for Gaussian Multivariate Distributed Sources. 2631-2636 - Farzad Shahrivari, Nikola Zlatanov:
An Asymptotically Optimal Algorithm For Classification of Data Vectors with Independent Non-Identically Distributed Elements. 2637-2642 - Sajad Khodadadian, AmirEmad Ghassami, Negar Kiyavash:
Impact of Data Processing on Fairness in Supervised Learning. 2643-2648 - Alexandra M. Porter, Mary Wootters:
On Greedy Approaches to Hierarchical Aggregation. 2649-2654 - Wentu Song, Nikita Polyanskii, Kui Cai, Xuan He:
On Multiple-Deletion Multiple-Substitution Correcting Codes. 2655-2660 - Kento Nakada:
Perfect Binary Codes Capable of Correcting Equal Multiple Deletions. 2661-2665 - Johan Chrisnata, Han Mao Kiah:
Correcting Two Deletions with More Reads. 2666-2671 - Nastaran Abadi Khooshemehr, Mohammad Ali Maddah-Ali:
The Discrepancy Attack on Polyshard-ed Blockchains. 2672-2677 - Canran Wang, Netanel Raviv:
Low Latency Cross-Shard Transactions in Coded Blockchain. 2678-2683 - Birenjith Sasidharan, Emanuele Viterbo:
Private Data Access in Blockchain Systems Employing Coded Sharding. 2684-2689 - Serkan Saritas, Photios A. Stavrou, Ragnar Thobaben, Mikael Skoglund:
Quadratic Signaling Games with Channel Combining Ratio. 2690-2695 - Maël Le Treust, Tristan Tomala:
Strategic Communication with Decoder Side Information. 2696-2701 - Omer Amar, Kobi Cohen:
Online Learning for Shortest Path and Backpressure Routing in Wireless Networks. 2702-2707 - Mojtaba Abolfazli, Anders Høst-Madsen, June Zhang, Andras Bratincsak:
Graph Coding for Model Selection and Anomaly Detection in Gaussian Graphical Models. 2708-2713 - Yihong Wu, Jiaming Xu, Sophie H. Yu:
Settling the Sharp Reconstruction Thresholds of Random Graph Matching. 2714-2719 - Serhat Bakirtas, Elza Erkip:
Database Matching Under Column Deletions. 2720-2725 - Mahshad Shariatnasab, Farhad Shirani, Siddharth Garg, Elza Erkip:
On Graph Matching Using Generalized Seed Side-Information. 2726-2731 - Mohamed Seif, Wei-Ting Chang, Ravi Tandon:
Privacy Amplification for Federated Learning via User Sampling and Wireless Aggregation. 2732-2737 - Qinghua Ding, Chin Wa Ken Lau, Chandra Nair, Yan Nan Wang:
Concavity of output relative entropy for channels with binary inputs. 2738-2743 - Amin Gohari, Chandra Nair, David Ng:
An Information Inequality Motivated by the Gaussian Z-Interference Channel. 2744-2749 - Cheuk Ting Li:
An Automated Theorem Proving Framework for Information-Theoretic Results. 2750-2755 - Yonglong Li, Vincent Y. F. Tan:
On the Feed-Forward Rate-Distortion Function for Stationary and Ergodic Sources. 2756-2761 - Aviv Adler, Jennifer Tang, Yury Polyanskiy:
Quantization of Random Distributions under KL Divergence. 2762-2767 - Ahmed Elshafiy, Mahmoud Namazi, Ram Zamir, Kenneth Rose:
Stochastic Codebook Regeneration for Sequential Compression of Continuous Alphabet Sources. 2768-2773 - Mohsen Heidari, Jithin K. Sreedharan, Gil I. Shamir, Wojciech Szpankowski:
Information Sufficiency via Fourier Expansion. 2774-2779 - Yingzhen Yang, Ping Li:
FROS: Fast Regularized Optimization by Sketching. 2780-2785 - Antonio A. Ginart, Maxim Naumov, Dheevatsa Mudigere, Jiyan Yang, James Zou:
Mixed Dimension Embeddings with Application to Memory-Efficient Recommendation Systems. 2786-2791 - Payam Delgosha, Venkat Anantharam:
A Universal Lossless Compression Method applicable to Sparse Graphs and heavy-tailed Sparse Graphs. 2792-2797 - Yeow Meng Chee, Manabu Hagiwara, Van Khu Vu:
Two Dimensional Deletion Correcting Codes and their Applications. 2792-2797 - Lorenz Welter, Rawad Bitar, Antonia Wachter-Zeh, Eitan Yaakobi:
Multiple Criss-Cross Deletion-Correcting Codes. 2798-2803 - Shuche Wang, Jin Sima, Farzad Farnoud:
Non-binary Codes for Correcting a Burst of at Most 2 Deletions. 2804-2809 - Kai Wan, Hua Sun, Mingyue Ji, Daniela Tuninetti, Giuseppe Caire:
Cache-Aided Matrix Multiplication Retrieval. 2810-2815 - Yinbin Ma, Daniela Tuninetti:
A General Coded Caching Scheme for Scalar Linear Function Retrieval. 2816-2821 - Zhen-Qing He, Hang Liu, Xiaojun Yuan, Ying-Jun Angela Zhang, Ying-Chang Liang:
Semi-Blind Channel Estimation for RIS-Aided Massive MIMO: A Trilinear AMP Approach. 2822-2827 - Roya Gholami, Laura Cottatellucci, Dirk T. M. Slock:
Tackling Pilot Contamination in Cell-Free Massive MIMO by Joint Channel Estimation and Linear Multi-User Detection. 2828-2833 - Yahia Shabara, C. Emre Koksal, Eylem Ekici:
How Long to Estimate Sparse MIMO Channels. 2834-2839 - Puning Zhao, Lifeng Lai:
On the Convergence Rates of KNN Density Estimation. 2840-2845 - Maciej Skorski:
Mean-Squared Accuracy of Good-Turing Estimator. 2846-2851 - Hamidreza Amini Khorasgani, Hemanta K. Maji, Himanshi K. Mehta, Mingyuan Wang:
Efficient Distributed Coin-tossing Protocols. 2852-2857 - Hamidreza Amini Khorasgani, Hemanta K. Maji, Mingyuan Wang:
Optimally-secure Coin-tossing against a Byzantine Adversary. 2858-2863 - Fan Li, Jinyuan Chen:
Communication-Efficient Signature-Free Asynchronous Byzantine Agreement. 2864-2869 - Aditya Narayan Ravi, Sibi Raj B. Pillai, Vinod M. Prabhakaran, Michèle A. Wigger:
On the Capacity Region of Gaussian Broadcast Channels under Two-Sided Noisy Feedback. 2870-2875 - Sreejith Sreekumar, Ziv Goldfeld:
Soft-covering via Constant-composition Superposition codes. 2876-2881 - Stefan Schwarz:
Non-Coherent Broadcasting based on Grassmannian Superposition Transmission. 2882-2887 - Lin Bai, Zhuangfei Wu, Lin Zhou:
Achievable Second-Order Asymptotics for Successive Refinement Using Gaussian Codebooks. 2888-2893 - Jiakun Liu, Wenyi Zhang, H. Vincent Poor:
A Rate-Distortion Framework for Characterizing Semantic Information. 2894-2899 - Sahasrajit Sarmasarkar, Kota Srinivas Reddy, Nikhil Karamchandani:
Query Complexity of Heavy Hitter Estimation. 2900-2905 - Ioannis Papageorgiou, Ioannis Kontoyiannis, Lambros Mertzanis, Athina Panotopoulou, Maria Skoularidou:
Revisiting Context-Tree Weighting for Bayesian Inference. 2906-2911 - Mohammad Saeed Masiha, Amin Gohari, Mohammad Hossein Yassaee, Mohammad Reza Aref:
Learning under Distribution Mismatch and Model Misspecification. 2912-2917 - Guanghui Song, Kui Cai, Ce Sun, Xingwei Zhong, Jun Cheng:
Selector Failure Detection for Resistive Random Access Memories. 2918-2923 - Yeow Meng Chee, Alexander Vardy, Van Khu Vu, Eitan Yaakobi:
Coding for Transverse-Reads in Domain Wall Memories. 2924-2929 - Tuan Thanh Nguyen, Kui Cai, Kees A. Schouhamer Immink, Yeow Meng Chee:
Efficient Design of Capacity-Approaching Two-Dimensional Weight-Constrained Codes. 2930-2935 - Roope Vehkalahti, Tefjol Pllaha, Olav Tirkkonen:
Signature Code Design for Fast Fading Channels. 2936-2941 - Benjamin M. Zaidel, Shlomo Shamai Shitz:
Sparse and Dense: An Achievable Region for Code-Domain NOMA with Mixed Users. 2942-2947 - Michail Gkagkos, Asit Kumar Pradhan, Vamsi K. Amalladinne, Krishna Narayanan, Jean-François Chamberland, Costas N. Georghiades:
Approximate Support Recovery using Codes for Unsourced Multiple Access. 2948-2953 - Jingyuan Xia, Deniz Gündüz:
Meta-learning Based Beamforming Design for MISO Downlink. 2954-2959 - Sueda Taner, Christoph Studer:
Optimality of the Discrete Fourier Transform for Beamspace Massive MU-MIMO Communication. 2960-2965 - Abbas Khalili, Shahram Shahsavari, Mohammad Ali Amir Khojastepour, Elza Erkip:
On Single-User Interactive Beam Alignment in Millimeter Wave Systems: Impact of Feedback Delay. 2966-2971 - Guidan Yao, Ahmed M. Bedewy, Ness B. Shroff:
Age-Optimal Low-Power Status Update over Time-Correlated Fading Channel. 2972-2977 - Saad Kriouile, Mohamad Assaad:
Minimizing the Age of Incorrect Information for Real-time Tracking of Markov Remote Sources. 2978-2983 - Roy D. Yates:
The Age of Gossip in Networks. 2984-2989 - Jabari Hastings, Amy Kanne, Ray Li, Mary Wootters:
Wedge-Lifted Codes. 2990-2995 - Ximing Fu, Chenhao Wu, Yuanxin Guo, Shenghao Yang:
Two-tone Shift-XOR Storage Codes. 2996-3001 - Francisco Maturana, K. V. Rashmi:
Irregular Array Codes with Arbitrary Access Sets for Geo-Distributed Storage. 3002-3007 - Jie Ni, Jianping Zheng, Zijie Liang:
Massive MIMO Un-Sourced Random Access with Dynamic User Activity. 3008-3013 - Khac-Hoang Ngo, Alejandro Lancho, Giuseppe Durisi, Alexandre Graell i Amat:
Massive Uncoordinated Access With Random User Activity. 3014-3019 - Qipeng Wang, Liang Liu, Shuowen Zhang, Francis C. M. Lau:
On Massive IoT Connectivity with Temporally-Correlated User Activity. 3020-3025 - Ioannis Kontoyiannis, Yi Heng Lim, Katia Papakonstantinopoulou, Wojciech Szpankowski:
Symmetry and the Entropy of Small-World Structures and Graphs. 3026-3031 - Alankrita Bhatt, Ziao Wang, Chi Wang, Lele Wang:
Universal Graph Compression: Stochastic Block Models. 3038-3043 - Malcolm Egan:
Dependence Testing via Extremes for Regularly Varying Models. 3044-3049 - Yan Wang:
Sub-Gaussian Error Bounds for Hypothesis Testing. 3050-3055 - Zhongchang Sun, Shaofeng Zou:
A Data-Driven Approach to Robust Hypothesis Testing Using Kernel MMD Uncertainty Sets. 3056-3061 - Yingyin Pan, Jianghua Zhong, Dongdai Lin:
On Galois NFSRs with Terminal Bits. 3062-3067 - Akanshu Gupta, Abhinava Sikdar, Arpan Chattopadhyay:
Quickest detection of false data injection attack in remote state estimation. 3068-3073 - Anand Jerry George, Navin Kashyap:
An MCMC Method to Sample from Lattice Distributions. 3074-3079 - Vamsi K. Amalladinne, Allen Hao, Stefano Rini, Jean-François Chamberland:
Multi-Class Unsourced Random Access via Coded Demixing. 3080-3085 - Yuan-Hsun Lo, Wen-Wen Gu, Yijin Zhang:
New Results on Optimal Multichannel Conflict-Avoiding Codes. 3086-3091 - Chao Zhang, Aymen Askri, Ghaya Rekaya-Ben Othman:
Distributed DNN based Processing for Uplink Could-RAN. 3092-3096 - Neri Merhav:
Optimal Correlators for Detection and Estimation in Optical Receivers. 3097-3102 - Sarah Bahanshal, Anas Chaaban:
A Binary Decomposition and Transmission Schemes for the Peak-Constrained IM/DD Channel. 3103-3108 - Yu Han, Maria Urlea, Sergey Loyka:
On Optimal Power Allocation for Modulation-Constrained Gaussian Channels. 3109-3114 - Xi Zhang, Jingqing Wang, H. Vincent Poor:
AoI-Driven Statistical Delay and Error-Rate Bounded QoS Provisioning for URLLC Over Wireless Networks in the Finite Blocklength Regime. 3115-3120 - Parisa Rafiee, Mustafa Oktav, Omur Ozel:
Intermittent Status Updating with Random Update Arrivals. 3121-3126 - Xingran Chen, Renpu Liu, Shaochong Wang, Shirin Saeedi Bidokhti:
Timely Broadcasting in Erasure Networks: Age-Rate Tradeoffs. 3127-3132 - Yeow Meng Chee, Duc Tu Dao, Tuvi Etzion, Han Mao Kiah, Hui Zhang:
Regular Multiset Combinatorial Batch Codes over Vector Spaces. 3133-3138 - Lev Yohananov, Eitan Yaakobi:
Almost Optimal Construction of Functional Batch Codes Using Hadamard Codes. 3139-3144 - Fan Zhang, Aria Nosratinia:
Coherence Diversity DoF in MIMO Relays: Generalization, Transmission Schemes, and Multi-Relay Strategies. 3145-3150 - Giorgio Taricco:
Information Rate Optimization for Joint Relay and Link in Non-Regenerative MIMO Channels. 3151-3155 - Mine Gokce Dogan, Yahya H. Ezzeldin, Christina Fragouli:
On optimal relay placement in directional networks. 3156-3161 - Uri Erez, Jan Østergaard, Ram Zamir:
An Orthogonality Principle for Select-Maximum Estimation of Exponential Variables. 3162-3166 - Sorina Dumitrescu, Sara Zendehboodi:
Globally Optimal Design of a Distributed Scalar Quantizer for Linear Classification. 3167-3172 - Kengo Hashimoto, Ken-ichi Iwata:
On the Optimality of Binary AIFV Codes with Two Code Trees. 3173-3178 - Hao Wang, Hsiang Hsu, Mario Díaz, Flávio P. Calmon:
The Impact of Split Classifiers on Group Fairness. 3179-3184 - Kai Liang, Youlong Wu:
Improved Communication Efficiency for Distributed Mean Estimation with Side Information. 3185-3190 - Doyeon Kim, Hye Won Chung:
Crowdsourced Labeling for Worker-Task Specialization Model. 3191-3195 - Linghui Zhou, Tobias J. Oechtering, Mikael Skoglund:
Incremental Design of Secure Biometric Identification and Authentication. 3196-3201 - Zhou Li, Hua Sun:
On the Linear Capacity of Conditional Disclosure of Secrets. 3202-3207 - Manideep Mamindlapally, Anuj Kumar Yadav, Manoj Mishra, Amitalok J. Budkuley:
Commitment Capacity under Cost Constraints. 3208-3213 - Xujun Liu, Olgica Milenkovic:
The Postdoc Problem under the Mallows Model. 3214-3219 - Alexey V. Lebedev, Christian Deppe:
Non-Adaptive and Adaptive Two-Sided Search with Fast Objects. 3220-3224 - Igal Sason:
Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs. 3225-3230 - Cihan Tepedelenlioglu:
Portfolio Growth Rate and Ergodic Capacity of Fading Channels. 3231-3236 - Khac-Hoang Ngo, Sheng Yang:
A Generalized Gaussian Model for Wireless Communications. 3237-3242 - Pin-Hsun Lin, Shih-Chun Lin, Eduard A. Jorswieck:
Early Decoding for Gaussian Broadcast Channels with Heterogeneous Blocklength Constraints. 3243-3248 - Akanksha Jaiswal, Arpan Chattopadhyay:
Minimization of Age-of-Information in Remote Sensing with Energy Harvesting. 3249-3254 - Cho-Hsin Tsai, Chih-Chun Wang:
Jointly Minimizing AoI Penalty and Network Cost Among Coexisting Source-Destination Pairs. 3255-3260 - Weijun Fang, Bin Chen, Shu-Tao Xia, Fang-Wei Fu:
Singleton-Optimal LRCs and Perfect LRCs via Cyclic Codes. 3261-3266 - Jie Hao, Kenneth W. Shum, Shu-Tao Xia, Fang-Wei Fu, Yixian Yang:
On Optimal Quaternary Locally Repairable Codes. 3267-3272 - Ohad Elishco, Alexander Barg:
Capacity and Construction of Recoverable Systems. 3273-3278 - Prakash Chaki, Takumi Ishihara, Shinya Sugiura:
Eigenvalue Decomposition Precoded Faster-Than-Nyquist Transmission of Index Modulated Symbols. 3279-3284 - Zijie Liang, Jianping Zheng, Jie Ni:
Index Modulation Aided Massive MIMO Un-sourced Random Access. 3285-3290 - Bharath Shamasundar, Aria Nosratinia:
Spectral Efficiency of Multi-Antenna Index Modulation. 3291-3295 - Hao Lou, Farzad Farnoud Hassanzadeh:
Asymptotic Analysis of Data Deduplication with a Constant Number of Substitutions. 3296-3301 - Yotam Gershon, Yuval Cassuto:
Efficient Distributed Source Coding of Fragmented Genomic Sequencing Data. 3302-3307 - Ilan Shomorony, Govinda M. Kamath:
Sketching and Sequence Alignment: A Rate-Distortion Perspective. 3308-3313 - Alon Kipnis, David L. Donoho:
Two-sample Testing of Discrete Distributions under Rare/Weak Perturbations. 3314-3319 - Jie Wang, Rui Gao, Yao Xie:
Two-sample Test using Projected Wasserstein Distance. 3320-3325 - Arpan Mukherjee, Ali Tajer, Pin-Yu Chen, Payel Das:
Active Binary Classification of Random Fields. 3326-3331 - Ajaykrishnan Nageswaran, Prakash Narayan:
Distribution Privacy Under Function $\rho$ -Recoverability. 3332-3337 - Ceren Sevinç, Ertem Tuncel:
Information Theoretic Approach on Randomized Response Models in Surveys. 3338-3342 - Samiru Gayan, Rajitha Senanayake, Hazer Inaltekin, Jamie S. Evans:
Selection Combining for Multi-Antenna Communication with Low-Resolution ADCs. 3343-3348 - Shahin Khobahi, Nir Shlezinger, Mojtaba Soltanalian, Yonina C. Eldar:
Model-Inspired Deep Detection with Low-Resolution Receivers. 3349-3354 - Priyanka Kaswan, Melih Bastopcu, Sennur Ulukus:
Freshness Based Cache Updating in Parallel Relay Networks. 3355-3360 - James Scott Broadhead, Przemyslaw Pawelczak:
Data Freshness in Mixed-Memory Intermittently-Powered Systems. 3361-3366 - Meng Zhang, Ahmed Arafa, Ermin Wei, Randall A. Berry:
Optimal Mechanism Design for Fresh Data Acquisition. 3367-3372 - Ron M. Roth:
Asymptotic Bounds on the Rate of Locally Repairable Codes. 3373-3378 - Han Cai, Cuiling Fan, Ying Miao, Moshe Schwartz, Xiaohu Tang:
An Improved Bound for Optimal Locally Repairable Codes. 3379-3384
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 2026-01-20 23:04 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:
