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