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