Table of Contents

• Multichannel Optimal Tree-Decodable Codes are Not Always Optimal Prefix CodesHoover H. F. Yin, Harry W. H. Wong, Mehrdad Tahernia, Russell W. F. Lai. 1-6 [doi]
• Error-Erasure Decoding of Linearized Reed-Solomon Codes in the Sum-Rank MetricFelicitas Hörmann, Hannes Bartz, Sven Puchinger. 7-12 [doi]
• Fully Analog Noise-Resilient Dynamical Systems Storing Binary SequenceTadashi Wadayama. 13-18 [doi]
• Universal Decoding for the Typical Random Code and for the Expurgated CodeRan Tamir, Neri Merhav. 19-24 [doi]
• Broadcast Approach Meets Network Coding for Data StreamingAlejandro Cohen, Muriel Médard, Shlomo Shamai Shitz. 25-30 [doi]
• The Undecidability of Network Coding with some Fixed-Size Messages and EdgesCheuk Ting Li. 31-36 [doi]
• Enhancing the Decoding Rates of BATS Codes by Learning With Guided InformationJiaxin Qing, Hoover H. F. Yin, Raymond W. Yeung. 37-42 [doi]
• Covering Sequences for ℓ-TuplesSagi Marcovich, Tuvi Etzion, Eitan Yaakobi. 43-48 [doi]
• The Gapped k-Deck ProblemRebecca Golm, Mina Nahvi, Ryan Gabrys, Olgica Milenkovic. 49-54 [doi]
• Log-CCDM: Distribution Matching via Multiplication-free Arithmetic CodingYunus Can Gültekin, Frans M. J. Willems, Alex Alvarado. 55-60 [doi]
• Centralised multi link measurement compression with side informationSayantan Chakraborty 0002, Arun Padakandla, Pranab Sen. 61-66 [doi]
• Universal Compression of Large Alphabets with Constrained CompressorsHao Lou, Farzad Farnoud. 67-72 [doi]
• Ternary Convolutional LDGM Codes with Applications to Gaussian Source CompressionTingting Zhu, Jifan Liang, Xiao Ma. 73-78 [doi]
• The Communication Value of a Quantum ChannelEric Chitambar, Ian George, Brian Doolittle, Marius Junge. 79-84 [doi]
• Singleton bounds for entanglement-assisted classical and quantum error correcting codesManideep Mamindlapally, Andreas J. Winter 0002. 85-90 [doi]
• Analytical calculation formulas for capacities of classical and classical-quantum channelsMasahito Hayashi. 91-96 [doi]
• Secure Distributed/Federated Learning: Prediction-Privacy Trade-Off for Multi-Agent SystemMohamed Ridha Znaidi, Gaurav Gupta, Paul Bogdan. 97-102 [doi]
• SwiftAgg: Communication-Efficient and Dropout-Resistant Secure Aggregation for Federated Learning with Worst-Case Security GuaranteesTayyebeh Jahani-Nezhad, Mohammad Ali Maddah-Ali, Songze Li, Giuseppe Caire. 103-108 [doi]
• Fundamental Limits of Personalized Federated Linear Regression with Data HeterogeneityChun-Ying Hou, I-Hsiang Wang. 109-114 [doi]
• Social Learning under Randomized CollaborationsYunus Inan, Mert Kayaalp, Emre Telatar, Ali H. Sayed. 115-120 [doi]
• On how to avoid exacerbating spurious correlations when models are overparameterizedTina Behnia, Ke Wang, Christos Thrampoulidis. 121-126 [doi]
• Asymptotic Behavior of Adversarial Training in Binary Linear ClassificationHossein Taheri, Ramtin Pedarsani, Christos Thrampoulidis. 127-132 [doi]
• Understanding Deep Neural Networks Using Sliced Mutual InformationShelvia Wongso, Rohan Ghosh, Mehul Motani. 133-138 [doi]
• AoI in Source-Aware Preemptive M/G/1/1 Queueing Systems: Moment Generating FunctionMohammad Moltafet, Markus Leinonen, Marian Codreanu. 139-143 [doi]
• Query Age of Information: Optimizing AoI at the Right TimeMuhammed Emrullah Ildiz, Orhan Tahir Yavascan, Elif Uysal, O. Tugberk Kartal. 144-149 [doi]
• Analysis of an Age-Dependent Stochastic Hybrid SystemAli Maatouk, Mohamad Assaad, Anthony Ephremides. 150-155 [doi]
• Performance Modeling of Scheduling Algorithms in a Multi-Source Status Update SystemPeng Zou, Jin Zhang, Suresh Subramaniam. 156-161 [doi]
• Efficient Representation of Large-Alphabet Probability Distributions via Arcsinh-CompanderAviv Adler, Jennifer Tang, Yury Polyanskiy. 162-167 [doi]
• A Tighter Approximation Guarantee for Greedy Minimum Entropy CouplingSpencer Compton. 168-173 [doi]
• Probability Distribution on Rooted TreesYuta Nakahara, Shota Saito, Akira Kamatsuka, Toshiyasu Matsushima. 174-179 [doi]
• Algebraic Chase Decoding of Elliptic Codes Through Computing the Gröbner BasisWan, Li Chen, Fangguo Zhang. 180-185 [doi]
• Comparison of 2D topological codes and their decoding performancesKao-Yueh Kuo, Ching-Yi Lai. 186-191 [doi]
• Dual-domain recursive SISO decoding of linear block codesLiudmila Karakchieva, Peter Trifonov. 192-197 [doi]
• Capacity-Achieving Constrained Codes with GC-Content and Runlength Limits for DNA StorageYajuan Liu, Xuan He, Xiaohu Tang. 198-203 [doi]
• On Homopolymers and Secondary Structures Avoiding, Reversible, Reversible-Complement and GC-balanced DNA CodesKrishna Gopal Benerjee, Adrish Banerjee. 204-209 [doi]
• Capacity of the Shotgun Sequencing ChannelAditya Narayan Ravi, Alireza Vahid, Ilan Shomorony. 210-215 [doi]
• Finite-State Semi-Markov Channels for Nanopore SequencingBrendon McBain, Emanuele Viterbo, James Saunderson. 216-221 [doi]
• Source Coding with Unreliable Side Information in the Finite Blocklength RegimeSiming Sun, Michelle Effros. 222-227 [doi]
• Relationship Between Intrinsic Randomness with f-Divergence and Fixed-Length Source CodingRyo Nomura. 228-233 [doi]
• Excess-Distortion Exponents for Successive Refinement Using Gaussian CodebooksZhuangfei Wu, Lin Bai 0001, Lin Zhou 0002. 234-239 [doi]
• Universal Joint Source-Channel Coding Under an Input Energy ConstraintOmri Lev, Anatoly Khina. 240-245 [doi]
• Speeding Up AIFV-m Dynamic Programs by m-1 Orders of MagnitudeMordecai J. Golin, Albert John L. Patupat. 246-251 [doi]
• Minimizing Quantum Rényi Divergences via Mirror Descent with Polyak Step SizeJun-Kai You, Hao-Chung Cheng, Yen-Huan Li. 252-257 [doi]
• Identification Over Quantum Broadcast ChannelsUzi Pereg, Johannes Rosenberger, Christian Deppe. 258-263 [doi]
• Run Length Limited de Bruijn Sequences for Quantum CommunicationsYeow Meng Chee, Duc Tu Dao, Long Nguyen Tien, Hoang Ta Duy, Van Khu Vu. 264-269 [doi]
• Sequential Quantum Channel DiscriminationYonglong Li, Christoph Hirche, Marco Tomamichel. 270-275 [doi]
• α-GAN: Convergence and Estimation GuaranteesGowtham R. Kurri, Monica Welfert, Tyler Sypherd, Lalitha Sankar. 276-281 [doi]
• Statistical Minimax Lower Bounds for Transfer Learning in Linear Binary ClassificationSeyed Mohammadreza Mousavi Kalan, Mahdi Soltanolkotabi, Amir Salman Avestimehr. 282-287 [doi]
• Multi-Scale Zero-Order Optimization of Smooth Functions in an RKHSMadison Lee, Shubhanshu Shekhar, Tara Javidi. 288-293 [doi]
• From Generalisation Error to Transportation-cost Inequalities and BackAmedeo Roberto Esposito, Michael Gastpar. 294-299 [doi]
• Analytic Mutual Information in Bayesian Neural NetworksJae Oh Woo. 300-305 [doi]
• Covert Communication in the Presence of an Uninformed, Informed, and Coordinated JammerHassan ZivariFard, Matthieu R. Bloch, Aria Nosratinia. 306-311 [doi]
• Covert Communication with Mismatched DecodersQiaosheng Zhang, Vincent Y. F. Tan. 312-317 [doi]
• Towards a Characterization of the Covert Capacity of Bosonic Channels under Trace DistanceShi-Yuan Wang, Tuna Erdogan, Matthieu R. Bloch. 318-323 [doi]
• Covert Best Arm Identification of Stochastic BanditsMeng-Che Chang, Matthieu R. Bloch. 324-329 [doi]
• Density Estimation of Processes with Memory via Donsker VardhanZiv Aharoni, Dor Tsur, Haim H. Permuter. 330-335 [doi]
• Matroidal Entropy Functions: Constructions, Characterizations and RepresentationsQi Chen 0001, Minquan Cheng, Baoming Bai. 336-341 [doi]
• Generalized Longest Repeated Substring Min-Entropy EstimatorJiheon Woo, Chanhee Yoo, Young-Sik Kim, Yuval Cassuto, Yongjune Kim 0001. 342-347 [doi]
• Modeling Network Contagion Via Interacting Finite Memory Pólya UrnsSomya Singh, Fady Alajaji, Bahman Gharesifard. 348-353 [doi]
• A New Algebraic Approach for String Reconstruction from Substring CompositionsUtkarsh Gupta, Hessam Mahdavifar. 354-359 [doi]
• Coding for Trace Reconstruction over Multiple Channels with Vanishing Deletion ProbabilitiesSerge Kas Hanna. 360-365 [doi]
• Nonsingularity of Galois Nonlinear Feedback Shift RegistersYingyin Pan, Jianghua Zhong, Dongdai Lin. 366-371 [doi]
• 4-adic complexity of quaternary cyclotomic sequences and Ding-Helleseth sequences with period pqVladimir Edemskiy, Chenhuang Wu. 372-377 [doi]
• On Average Number of Cycles in Finite-Length Spatially Coupled LDPC CodesSima Naseri, Ali Dehghan 0001, Amir H. Banihashemi. 378-383 [doi]
• Efficient ADMM Decoder for Non-binary LDPC Codes based on Bit Embedding TechniqueXiaomeng Guo, Yongchao Wang. 384-389 [doi]
• Cycle-Free Windows of SC-LDPC CodesEmily McMillon, Christine A. Kelley. 390-395 [doi]
• Geometric versus Probabilistic Shaping for Circular-QAM with Nonbinary LDPC CodesAsma Maalaoui, Charly Poulliat, Iryna Andriyanova. 396-401 [doi]
• Communication Cost of Two-Database Symmetric Private Information Retrieval: A Conditional Disclosure of Multiple Secrets PerspectiveZhusheng Wang, Sennur Ulukus. 402-407 [doi]
• Two-Server Private Information Retrieval with Result VerificationPengzhen Ke, Liang Feng Zhang. 408-413 [doi]
• The Role of Reusable and Single-Use Side Information in Private Information RetrievalAnoosheh Heidarzadeh, Alex Sprintson. 414-419 [doi]
• Fundamental Limits of Cache-aided Multiuser PIR: The Two-message Two-user CaseXiang Zhang, Kai Wan, Hua Sun 0001, Mingyue Ji, Giuseppe Caire. 420-425 [doi]
• Regularization-wise double descent: Why it occurs and how to eliminate itFatih Furkan Yilmaz, Reinhard Heckel. 426-431 [doi]
• Uniqueness of local maximizers for some non-convex log-determinant optimization problems using information theoryChin Wa Ken Lau, Chandra Nair, Chaorui Yao. 432-437 [doi]
• Sequential vs. Fixed Design Regrets in Online LearningChanglong Wu, Mohsen Heidari, Ananth Grama, Wojciech Szpankowski. 438-443 [doi]
• Precise Minimax Regret for Logistic RegressionPhilippe Jacquet, Gil I. Shamir, Wojciech Szpankowski. 444-449 [doi]
• Monotonicity of the Trace-Inverse of Covariance Submatrices and Two-Sided PredictionAnatoly Khina, Arie Yeredor, Ram Zamir. 450-455 [doi]
• On the Number of Graphs with a Given HistogramShahar Stein Ioushua, Ofer Shayevitz. 456-461 [doi]
• Approximate Empirical Bayes Estimation of the Regularization Parameter in ℓ1 Trend FilteringAkiharu Omae, Kazuho Watanabe. 462-467 [doi]
• Alpha-NML Universal PredictorsMarco Bondaschi, Michael Gastpar. 468-473 [doi]
• Learning-Augmented Streaming Codes are Approximately Optimal for Variable-Size MessagesMichael Rudow, K. V. Rashmi. 474-479 [doi]
• MetaSSD: Meta-Learned Self-Supervised DetectionMoon Jeong Park, Jungseul Ok, Yo-Seb Jeon, Dongwoo Kim. 480-485 [doi]
• CuSum for sequential change diagnosisAustin Warner, Georgios Fellouris. 486-491 [doi]
• Capacity of the Trapdoor Channel with Delayed FeedbackBashar Huleihel, Oron Sabag, Haim H. Permuter. 492-497 [doi]
• Capacity of Finite State Channels with Feedback: Algorithmic and Optimization Theoretic PropertiesAndrea Grigorescu, Holger Boche, Rafael F. Schaefer, H. Vincent Poor. 498-503 [doi]
• On the Capacity of Additive AVCs with FeedbackPranav Joshi, Amritakshya Purkayastha, Yihan Zhang, Amitalok J. Budkuley, Sidharth Jaggi. 504-509 [doi]
• On the List Size in the Levenshtein's Sequence Reconstruction ProblemVille Junnila, Tero Laihonen, Tuomo Lehtilä. 510-515 [doi]
• Robust Locally Positioning Sequences and Codes: Capacity, Constructions and ApplicationsYeow Meng Chee, Nhat Hoang Le, Van Khu Vu. 516-521 [doi]
• New Family of Cross Z-Complementary Sequences With Large ZCZ WidthShibsankar Das, Adrish Banerjee, Zi Long Liu 0001. 522-527 [doi]
• The 4-Adic Complexity of Quaternary Sequences of Even Period With Ideal AutocorrelationMinghui Yang, Shiyuan Qiang, Xiaoyan Jing, Keqin Feng, Dongdai Lin. 528-531 [doi]
• An Upper Bound of the Set Size of Perfect Sequences with Optimal Cross-correlationZilong Wang 0001, Qian Chen, Guang Gong. 532-535 [doi]
• Systematic Doping of SC-LDPC CodesMin Zhu 0003, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.. 536-541 [doi]
• Trade-Based LDPC CodesFarzane Amirzade, Daniel Panario, Mohammad-Reza Sadeghi 0001. 542-547 [doi]
• Using Minors to Construct Generator Matrices for Quasi-Cyclic LDPC CodesRoxana Smarandache, Anthony Gómez-Fonseca, David G. M. Mitchell. 548-553 [doi]
• A Design of Layered Decoding for QC-LDPC Codes Based on Reciprocal Channel ApproximationMin Jang, Kyeongyeon Kim, Seho Myung, Hongsil Jeong, Kyung-Joong Kim, Sang-Hyo Kim. 554-559 [doi]
• Byzantine Attack Identification in Distributed Matrix Multiplication via locally testable codesSangwoo Hong, Heecheol Yang, Jungwoo Lee 0001. 560-565 [doi]
• DoF of a Cooperative X-Channel with an Application to Distributed ComputingYue Bi, Philippe Ciblat, Michèle A. Wigger, Yue Wu. 566-571 [doi]
• A New Coding Scheme for Matrix-Vector Multiplication via Universal Decodable MatricesHongru Cao, Wei Yan, Sian-Jheng Lin, Weiming Zhang. 572-577 [doi]
• Wyner-Ziv compression is (almost) optimal for distributed optimizationPrathamesh Mayekar, Shubham K. Jha, Himanshu Tyagi. 578-583 [doi]
• On One-Bit QuantizationSourbh Bhadane, Aaron B. Wagner. 584-589 [doi]
• A Rate Distortion Approach to Goal-Oriented CommunicationPhotios A. Stavrou, Marios Kountouris. 590-595 [doi]
• Lossy Compression with Universal DistortionAdeel Mahmood, Aaron B. Wagner. 596-601 [doi]
• Minimax Rate-DistortionAdeel Mahmood, Aaron B. Wagner. 602-607 [doi]
• Neural Estimation of the Rate-Distortion Function for Massive DatasetsEric Lei, Hamed Hassani, Shirin Saeedi Bidokhti. 608-613 [doi]
• Rainbow Differential PrivacyZiqi Zhou, Onur Günlü, Rafael G. L. D'Oliveira, Muriel Médard, Parastoo Sadeghi, Rafael F. Schaefer. 614-619 [doi]
• Bounds for Privacy-Utility Trade-off with Non-zero LeakageAmirreza Zamani, Tobias J. Oechtering, Mikael Skoglund. 620-625 [doi]
• Pointwise Maximal LeakageSara Saeidian, Giulia Cervia, Tobias J. Oechtering, Mikael Skoglund. 626-631 [doi]
• Gaussian Data Privacy Under Linear Function RecoverabilityAjaykrishnan Nageswaran. 632-636 [doi]
• Multi-user Privacy Cooperation Game by Leveraging Users' Service FlexibilityShu Hong, Lingjie Duan. 637-642 [doi]
• Constrained Obfuscation to Thwart Pattern Matching AttacksSaeede Enayati, Dennis L. Goeckel, Amir Houmansadr, Hossein Pishro-Nik. 643-648 [doi]
• Hybrid Multiplicative Non-perfect Secret SharingMaki Yoshida. 649-653 [doi]
• Attacking Masked Cryptographic Implementations: Information-Theoretic BoundsWei Cheng 0003, Yi Liu, Sylvain Guilley, Olivier Rioul. 654-659 [doi]
• Construction of the Visual Cryptography Scheme with the Maximum Relative Difference under a Strong General Access StructureHiroki Koga. 660-665 [doi]
• Coding with Cyclic PAM and Vector Quantization for the RLWE/MLWE ChannelIrina E. Bocharova, Henk D. L. Hollmann, Karan Khathuria, Boris D. Kudryashov, Vitaly Skachek. 666-671 [doi]
• Accelerated Proximal Alternating Gradient-Descent-Ascent for Nonconvex Minimax Machine LearningZiyi Chen 0002, Shaocong Ma, Yi Zhou. 672-677 [doi]
• The Directional Bias Helps Stochastic Gradient Descent to Generalize in Kernel Regression ModelsYiling Luo, Xiaoming Huo, Yajun Mei. 678-683 [doi]
• Empirical Risk Minimization with Relative Entropy Regularization: Optimality and Sensitivity AnalysisSamir M. Perlaza, Gaetan Bisson, Iñaki Esnaola, Alain Jean-Marie, Stefano Rini. 684-689 [doi]
• Stochastic Chaining and Strengthened Information-Theoretic Generalization BoundsRuida Zhou, Chao Tian 0002, Tie Liu 0002. 690-695 [doi]
• Implicit Regularization Properties of Variance Reduced Stochastic Mirror DescentYiling Luo, Xiaoming Huo, Yajun Mei. 696-701 [doi]
• The Posterior Distribution of Bayesian Context-Tree Models: Theory and ApplicationsIoannis Papageorgiou, Ioannis Kontoyiannis. 702-707 [doi]
• The Entropic Central Limit Theorem for Discrete Random VariablesLampros Gavalakis, Ioannis Kontoyiannis. 708-713 [doi]
• A Simpler Proof of the Four Functions Theorem and Some New VariantsDimitris Achlioptas, Kostas Zampetakis. 714-717 [doi]
• Entropic CLT for Order StatisticsMartina Cardone, Alex Dytso, Cynthia Rush. 718-723 [doi]
• Smoothed InfoNCE: Breaking the log N Curse without OvershootingXu Wang, Ali Al-Bashabsheh, Chao Zhao, Chung Chan. 724-729 [doi]
• Continuity of Link Scheduling Rate Region for Wireless Networks with Propagation DelaysYijun Fan, Yanxiao Liu 0003, Shenghao Yang. 730-735 [doi]
• QoE-Centric Multi-User mmWave Scheduling: A Beam Alignment and Buffer Predictive ApproachBabak Badnava, Sravan Reddy Chintareddy, Morteza Hashemi. 736-741 [doi]
• Average Downlink Rate Analysis for Clustered Cell-Free Networks with Access Point SelectionOuyang Zhou, Junyuan Wang, Fuqiang Liu. 742-747 [doi]
• Average Coverage Probability for Base-Station-to-UAV Communications Over 6G Multiple Access Wireless NetworksXi Zhang 0005, Qixuan Zhu, H. Vincent Poor. 748-753 [doi]
• Information and Energy Transmission with Wavelet-Reconstructed Harvesting FunctionsDaewon Seo, Yongjune Kim 0001. 754-759 [doi]
• Symmetries in Linear Programming for Information InequalitiesEmirhan Gürpinar. 760-765 [doi]
• Strong Data Processing Inequalities via Sums of SquaresOisin Faust, Hamza Fawzi. 766-771 [doi]
• Proving Information Inequalities and Identities with Symbolic ComputationLaigang Guo, Raymond W. Yeung, Xiao-Shan Gao. 772-777 [doi]
• The Random Number Partitioning Problem: Overlap Gap Property and Algorithmic BarriersDavid Gamarnik, Eren C. Kizildag. 778-783 [doi]
• Weak Superimposed Codes of Improved Asymptotic Rate and Their Randomized ConstructionYu Tsunoda, Yuichiro Fujiwara. 784-789 [doi]
• Rate-Energy Optimal Probabilistic Shaping Using Linear CodesMaxim Goukhshtein, Stark C. Draper, Jeebak Mitra. 790-795 [doi]
• One-Shot Point-to-Point Channel SimulationMichael X. Cao, Navneeth Ramakrishnan, Mario Berta, Marco Tomamichel. 796-801 [doi]
• Insertion and Deletion Correction in Polymer-based Data StorageAnisha Banerjee, Antonia Wachter-Zeh, Eitan Yaakobi. 802-807 [doi]
• t-Deletion-1-Insertion-Burst Correcting CodesZiyang Lu, YiWei Zhang. 808-813 [doi]
• Equivalence of Insertion/Deletion Correcting Codes for d-dimensional ArraysEvagoras Stylianou, Lorenz Welter, Rawad Bitar, Antonia Wachter-Zeh, Eitan Yaakobi. 814-819 [doi]
• Identifying Reliable Machines for Distributed Matrix-Vector MultiplicationSarthak Jain, Martina Cardone, Soheil Mohajer. 820-825 [doi]
• Orthonormal Sketches for Secure Coded RegressionNeophytos Charalambides, Hessam Mahdavifar, Mert Pilanci, Alfred O. Hero III. 826-831 [doi]
• Generalized Lagrange Coded Computing: A Flexible Computation-Communication TradeoffJinbao Zhu, Songze Li. 832-837 [doi]
• Successive Approximation for Coded Matrix MultiplicationShahrzad Kiani, Stark C. Draper. 838-843 [doi]
• Secure Joint Communication and SensingOnur Günlü, Matthieu R. Bloch, Rafael F. Schaefer, Aylin Yener. 844-849 [doi]
• On the Capacity Achieving Input of Amplitude Constrained Vector Gaussian Wiretap ChannelAntonino Favano, Luca Barletta, Alex Dytso. 850-855 [doi]
• Mosaics of Combinatorial Designs for Semantic Security on Quantum Wiretap ChannelsHolger Boche, Minglai Cai, Moritz Wiese. 856-861 [doi]
• A Framework for Shannon Ciphers under Side-Channel Attacks: a Strong Converse and MoreYasutada Oohama, Bagus Santoso. 862-867 [doi]
• Group Testing with Geometric RangesBenjamin Aram Berendsohn, László Kozma 0002. 868-873 [doi]
• Group Testing on General Set-SystemsMira Gonen, Michael Langberg, Alex Sprintson. 874-879 [doi]
• Group Testing with Correlation via Edge-Faulty GraphsHesam Nikpey, Jungyeol Kim, Xingran Chen, Saswati Sarkar, Shirin Saeedi Bidokhti. 880-885 [doi]
• Scheduling Group Tests over TimeAkhil Bhimaraju, Lav R. Varshney. 886-891 [doi]
• Nonparametric Matrix Estimation with One-Sided CovariatesChristina Lee Yu. 892-897 [doi]
• Maximum Likelihood Estimation of Optimal Receiver Operating Characteristic Curves From Likelihood Ratio ObservationsBruce Hajek, Xiaohan Kang. 898-903 [doi]
• Interaction Improves Two-party Nonparametric Pointwise Density EstimationJingbo Liu. 904-909 [doi]
• Missing Mass Estimation from Sticky ChannelsPrafulla Chandra, Andrew Thangaraj, Nived Rajaraman. 910-915 [doi]
• State Amplification and Masking While Timely UpdatingOmur Ozel, Aylin Yener, Sennur Ulukus. 916-921 [doi]
• Asymptotically Optimal On-Demand AoI Minimization in Energy Harvesting IoT NetworksMohammad Hatami, Markus Leinonen, Zheng Chen 0002, Nikolaos Pappas 0001, Marian Codreanu. 922-927 [doi]
• Timely Gossiping with File Slicing and Network CodingPriyanka Kaswan, Sennur Ulukus. 928-933 [doi]
• The Dissemination of Time-Varying Information over Networked Agents with GossipingMelih Bastopcu, S. Rasoul Etesami 0001, Tamer Basar. 934-939 [doi]
• Reversing Jensen's Inequality for Information-Theoretic AnalysesNeri Merhav. 940-945 [doi]
• A New Proof of the Extremal InequalityYinfei Xu, Guojun Chen, Shi Jin. 946-950 [doi]
• A mutual information inequality and some applicationsKen Lau, Chandra Nair, David Ng. 951-956 [doi]
• An MMSE Lower Bound via Poincaré InequalityIan Zieder, Alex Dytso, Martina Cardone. 957-962 [doi]
• PCR, Tropical Arithmetic, and Group TestingHsin-Po Wang 0001, Ryan Gabrys, Alexander Vardy. 963-968 [doi]
• Bee Identification Problem for DNA StrandsJohan Chrisnata, Han Mao Kiah, Alexander Vardy, Eitan Yaakobi. 969-974 [doi]
• Lower bounds on the redundancy of linear codes with disjoint repair groupsSankeerth Rao Karingula, Alexander Vardy, Mary Wootters. 975-979 [doi]
• Polar Coded Modulation via Hybrid Bit LabelingHanwen Yao, Jinfeng Du, Alexander Vardy. 980-985 [doi]
• *Luca G. Tallini, Nawaf Alqwaifly, Bella Bose. 986-991 [doi]
• Sequence Reconstruction Problem for Deletion Channels: A Complete Asymptotic SolutionVan Long Phuoc Pham, Keshav Goyal, Han Mao Kiah. 992-997 [doi]
• Genomic Compression with Decoder Alignment under Single Deletion and Multiple SubstitutionsYotam Gershon, Yuval Cassuto. 998-1003 [doi]
• List-decodable Codes for Single-deletion Single-substitution with List-size TwoWentu Song, Kui Cai, Tuan Thanh Nguyen. 1004-1009 [doi]
• An Integrated Method to Deal with Partial Stragglers and Sparse Matrices in Distributed ComputationsAnindya Bijoy Das, Aditya Ramamoorthy. 1010-1015 [doi]
• Coded Wireless Distributed Computing via Interference AlignmentKai Yuan, Youlong Wu. 1016-1021 [doi]
• An Improved Capacity Bound for Secure Network Function ComputationXuan Guang, Yang Bai, Raymond W. Yeung. 1022-1027 [doi]
• Distributed Matrix-Vector Multiplication with Sparsity and Privacy GuaranteesMarvin Xhemrishi, Rawad Bitar, Antonia Wachter-Zeh. 1028-1033 [doi]
• Arithmetic Network Coding for Secret Sum ComputationSijie Li, Cheuk Ting Li. 1034-1039 [doi]
• The Secrecy Capacity of The Gaussian Wiretap Channel with Rate-Limited Help at the DecoderSergey Loyka, Neri Merhav. 1040-1045 [doi]
• Encoding Individual Sequences for the Wiretap ChannelNeri Merhav. 1046-1051 [doi]
• Matched Information Rate Codes for Binary-Input Intersymbol Interference Wiretap ChannelsAria Nouri, Reza Asvadi. 1052-1057 [doi]
• Commitment capacity of classical-quantum channelsMasahito Hayashi, Naqueeb Ahmad Warsi. 1058-1063 [doi]
• Entanglement-Assisted Quantum Error-Correcting Codes over Local Frobenius RingsTania Sidana, Navin Kashyap. 1064-1069 [doi]
• Quantum codes construction from skew polycyclic codesShikha Patel, Om Prakash 0004. 1070-1075 [doi]
• The Quantum MAC with Cribbing EncodersUzi Pereg, Christian Deppe, Holger Boche. 1076-1081 [doi]
• Group Testing with Blocks of PositivesThach V. Bui, Yeow Meng Chee, Jonathan Scarlett, Van Khu Vu. 1082-1087 [doi]
• Exact Recovery Threshold in Dynamic Binary Censored Block ModelJavad Zahedi Moghaddam, Mohammad Esmaeili, Aria Nosratinia. 1088-1093 [doi]
• Error-Correcting Locating Arrays for Interaction Fault Location in Combinatorial TestingXiao-Nan Lu, Masakazu Jimbo. 1094-1099 [doi]
• Robust Estimation for Non-parametric Families via Generative Adversarial NetworksBanghua Zhu, Jiantao Jiao, Michael I. Jordan. 1100-1105 [doi]
• Lower-bounds on the Bayesian Risk in Estimation Procedures via f-DivergencesAdrien Vandenbroucque, Amedeo Roberto Esposito, Michael Gastpar. 1106-1111 [doi]
• The Pisarenko spectral estimation method: Extension to AR vector processesJesús Gutiérrez-Gutiérrez, Adam Podhorski, Xabier Insausti, Marta Zárraga-Rodríguez. 1112-1114 [doi]
• Robust Mean Estimation in High Dimensions: An Outlier Fraction Agnostic and Efficient AlgorithmAditya Deshmukh, Jing Liu, Venugopal V. Veeravalli. 1115-1120 [doi]
• An improved coded caching scheme for partially cooperative D2D networksAniruddha Phatak, Mahesh K. Varanasi. 1121-1126 [doi]
• An improved lower bound for device-to-device coded cachingAniruddha Phatak, Mahesh K. Varanasi. 1127-1132 [doi]
• On Coded Caching Systems with Offline UsersYinbin Ma, Daniela Tuninetti. 1133-1138 [doi]
• Coded Caching Does Not Generally Benefit From Selfish CachingFederico Brunero, Petros Elia. 1139-1144 [doi]
• Blahut-Arimoto Algorithms for Computing Capacity Bounds of Broadcast ChannelsYanqing Liu, Yanlin Geng. 1145-1150 [doi]
• Capacity of 3-user Linear Computation Broadcast over Fq with 1D Demand and Side-InformationYuhang Yao, Syed Ali Jafar. 1151-1156 [doi]
• Byzantine Consensus Over Broadcast ChannelsNeha Sangwan, Varun Narayanan, Vinod M. Prabhakaran. 1157-1162 [doi]
• On the Feasible Region of Efficient Algorithms for Attributed Graph AlignmentZiao Wang, Ning Zhang, Weina Wang, Lele Wang 0001. 1163-1168 [doi]
• Analysis of Non-Binary High-Rate Repetition-Parity-Parity Codes Over the BECIryna Andriyanova, Charly Poulliat. 1169-1174 [doi]
• 3-Locally Testable Codes from Lossless ExpandersTing-Chun Lin, Min-Hsiu Hsieh. 1175-1180 [doi]
• Some Results on Maximally Recoverable Codes with Locality and Hierarchical LocalityD. Shivakrishna, V. Lalitha 0001. 1181-1186 [doi]
• Warm-Starting in Message Passing algorithmsNikolajs Skuratovs, Mike E. Davies. 1187-1192 [doi]
• Analysis of Symbol Message Passing LDPC Decoder for the Poisson PPM ChannelEmna Ben Yacoub, Balázs Matuz. 1193-1198 [doi]
• Adaptive Importance Sampling Message PassingSemih Akbayrak, Ismail Senöz, Bert de Vries. 1199-1204 [doi]
• Error-and-erasure Decoding of Product and Staircase Codes with Simplified Extrinsic Message PassingSisi Miao, Lukas Rapp, Laurent Schmalen. 1205-1210 [doi]
• Analog Secure Distributed Matrix Multiplication over Complex NumbersOkko Makkonen, Camilla Hollanti. 1211-1216 [doi]
• Adaptive Gap Entangled Polynomial Coding for Multi-Party Computation at the EdgeElahe Vedadi, Yasaman Keshtkarjahromi, Hulya Seferoglu. 1217-1222 [doi]
• Function Computation Without Secure Links: Information and Leakage RatesRémi A. Chou, Jörg Kliewer. 1223-1228 [doi]
• Co-design of CSS Codes and Diagonal GatesJingzhen Hu, Qingzhong Liang, A. Robert Calderbank. 1229-1234 [doi]
• Subspace Decomposition of Extreme-Rate Secrecy CodesDavid Hunn, Willie K. Harrison. 1235-1240 [doi]
• Secure Coding via Gaussian Random FieldsAli Bereyhi, Bruno Loureiro, Florent Krzakala, Ralf R. Müller, Hermann Schulz-Baldes. 1241-1246 [doi]
• Controller Manipulation Attack on Reconfigurable Intelligent Surface Aided Wireless CommunicationSiddharth Sankar Acharjee, Arpan Chattopadhyay. 1247-1252 [doi]
• Determining the equivocation in coded transmission over a noisy channelJoakim Algrøy, Angela I. Barbero, Øyvind Ytrehus. 1253-1258 [doi]
• Over-the-Air Federated Learning with Joint Adaptive Computation and Power ControlHaibo Yang, Peiwen Qiu, Jia Liu 0002, Aylin Yener. 1259-1264 [doi]
• Over-the-Air Ensemble Inference with Model PrivacySelim F. Yilmaz, Burak Hasircioglu, Deniz Gündüz. 1265-1270 [doi]
• Bandwidth Expansion for Over-the-Air Computation with One-Sided CSINitish Mital, Deniz Gündüz. 1271-1276 [doi]
• Optimizing Federated Averaging over Fading ChannelsYujia Mu, Cong Shen, Yonina C. Eldar. 1277-1281 [doi]
• Generalized Probability Density Function Estimation via Convex OptimizationArian Eamaz, Farhang Yeganegi, Mojtaba Soltanalian, Natasha Devroye. 1282-1287 [doi]
• Mismatched Estimation of Non-Symmetric Rank-One Matrices Under Gaussian NoiseFarzad Pourkamali, Nicolas Macris. 1288-1293 [doi]
• Data-Driven Parameter EstimationGeorge V. Moustakides. 1294-1299 [doi]
• A Novel Framework for Coded Caching via Cartesian Product with Reduced SubpacketizationJinyu Wang, Minquan Cheng, Kai Wan, Giuseppe Caire. 1300-1305 [doi]
• Design of Coded Caching Schemes through Proper Orthogonal ArraysXianzhang Wu, Minquan Cheng, Congduan Li, Li Chen. 1306-1311 [doi]
• Coded Caching in Satellite NetworksXinyu Xie, Kai Huang, Jinbei Zhang, Shushi Gu, Qinyu Zhang 0001. 1312-1317 [doi]
• Error Exponent and Strong Converse for Quantum Soft CoveringHao-Chung Cheng, Li Gao. 1318-1323 [doi]
• Lower Bounds on List Decoding Capacity using Error ExponentsYihan Zhang, Shashank Vatedka. 1324-1329 [doi]
• Upper Bounds on the Feedback Error Exponent of Channels With States and With MemoryMohsen Heidari, Achilleas Anastasopoulos, S. Sandeep Pradhan. 1330-1335 [doi]
• Achievable Error Exponents for Almost Fixed-Length Binary ClassificationLin Bai 0001, Jun Diao, Lin Zhou 0002. 1336-1341 [doi]
• Coding schemes for locally balanced constraintsChen Wang, Ziyang Lu, Zhaojun Lan, Gennian Ge, YiWei Zhang. 1342-1347 [doi]
• Evaluating the Gilbert-Varshamov Bound for Constrained SystemsKeshav Goyal, Han Mao Kiah. 1348-1353 [doi]
• Rate-Constrained Shaping Codes for Finite-State Channels With CostYi Liu 0052, Yonglong Li, Pengfei Huang 0001, Paul H. Siegel. 1354-1359 [doi]
• An Asymptotically Optimal Two-Part Coding Scheme for Networked Control under Fixed-Rate ConstraintsJonathan Keeler, Tamás Linder, Serdar Yüksel. 1360-1365 [doi]
• On the Convergence of Orthogonal/Vector AMP: Long-Memory Message-Passing StrategyKeigo Takeuchi. 1366-1371 [doi]
• Sparse superposition codes under VAMP decoding with generic rotational invariant coding matricesTianqi Hou, Yuhao Liu, Teng Fu, Jean Barbier. 1372-1377 [doi]
• Sufficient Statistic Memory Approximate Message PassingLei Liu 0005, Shunqi Huang, Brian M. Kurkoski. 1378-1383 [doi]
• Capacity Optimality of OAMP in Coded Large Unitarily Invariant SystemsLei Liu, Shansuo Liang, Li Ping 0001. 1384-1389 [doi]
• Multiaccess Coded Caching with Private DemandsKai Wan, Minquan Cheng, Dequan Liang, Giuseppe Caire. 1390-1395 [doi]
• Coded Caching With Private Demands and CachesAli Gholami, Kai Wan, Hua Sun 0001, Mingyue Ji, Giuseppe Caire. 1396-1401 [doi]
• A Secretive Coded Caching for Shared Cache Systems using Placement Delivery ArraysElizabath Peter, K. K. Krishnan Namboodiri, B. Sundar Rajan. 1402-1407 [doi]
• Secure Communication Over 2-User Gaussian Interference Channel with CachingParthajit Mohapatra. 1408-1413 [doi]
• Shannon Bounds on Lossy Gray-Wyner NetworksErixhen Sula, Michael Gastpar. 1414-1419 [doi]
• Two-terminal source coding with common sum reconstructionTharindu Adikari, Stark C. Draper. 1420-1424 [doi]
• Multi-User Random Coding Techniques for Mismatched Rate-Distortion TheoryMillen Kanabar, Jonathan Scarlett. 1425-1429 [doi]
• Locally Decodable Slepian-Wolf CompressionShashank Vatedka, Venkat Chandar, Aslan Tchamkerten. 1430-1435 [doi]
• sSimeng Yuan, Wei Yu 0008, Kunpeng Wang, Xiuxiu Li. 1436-1440 [doi]
• A Novel Attack to the Permuted Kernel ProblemPaolo Santini, Marco Baldi, Franco Chiaraluce. 1441-1446 [doi]
• On the Security Properties of Combinatorial All-or-nothing TransformsYujie Gu, Sonata Akao, Navid Nasr Esfahani, Ying Miao, Kouichi Sakurai. 1447-1452 [doi]
• Breaking Fair Binary Classification with Optimal Flipping AttacksChanghun Jo, Jy-yong Sohn, Kangwook Lee 0001. 1453-1458 [doi]
• Quasi-Cyclic Stern Proof of KnowledgeLoïc Bidoux, Philippe Gaborit, Mukul Kulkarni, Nicolas Sendrier. 1459-1464 [doi]
• Improved Information Theoretic Generalization Bounds for Distributed and Federated LearningL. P. Barnes, Alex Dytso, H. Vincent Poor. 1465-1470 [doi]
• Semi-Decentralized Federated Learning with Collaborative RelayingMichal Yemini, Rajarshi Saha, Emre Ozfatura, Deniz Gündüz, Andrea J. Goldsmith. 1471-1476 [doi]
• Communication-Efficient Distributed Multiple Testing for Large-Scale InferenceMehrdad Pournaderi, Yu Xiang. 1477-1482 [doi]
• A Generalized Worker-Task Specialization Model for Crowdsourcing: Optimal Limits and AlgorithmDoyeon Kim, Jeonghwan Lee, Hye Won Chung. 1483-1488 [doi]
• A Mathematical Framework to Characterize the Dependency Structures in Multimodal Learning with Minimax PrincipleTianren Peng, Weida Wang, Shao-Lun Huang. 1489-1494 [doi]
• Observational Learning with Negative ExternalitiesPawan Poojary, Randall Berry. 1495-1496 [doi]
• Another Look at Universal Individual LearningYaniv Fogel, Meir Feder. 1501-1505 [doi]
• Generalizing Nesterov's Acceleration Framework by Embedding Momentum Into Estimating Sequences: New Algorithm and BoundsEndrit Dosti, Sergiy A. Vorobyov, Themistoklis Charalambous. 1506-1511 [doi]
• Space Time Codes in Multi-Antenna Coded Caching SystemsAnjana Ambika Mahesh, B. Sundar Rajan. 1512-1517 [doi]
• Extended Placement Delivery Arrays for Multi-Antenna Coded Caching SchemeK. K. Krishnan Namboodiri, Elizabath Peter, B. Sundar Rajan. 1518-1523 [doi]
• Multiple-antenna Placement Delivery Array for Cache-aided MISO SystemsTing Yang, Kai Wan, Minquan Cheng, Giuseppe Caire. 1524-1529 [doi]
• 1Holger Boche, Christian Deppe. 1530-1535 [doi]
• First-Order Theory of Probabilistic Independence and Single-Letter Characterizations of Capacity RegionsCheuk Ting Li. 1536-1541 [doi]
• Sequential Channel SynthesisLei Yu 0003, Venkat Anantharam. 1542-1547 [doi]
• Common Randomness Generation from Gaussian SourcesWafa Labidi, Rami Ezzine, Christian Deppe, Holger Boche. 1548-1553 [doi]
• Graph-based codes for hierarchical recoveryAllison Beemer, Rutuja Kshirsagar, Gretchen L. Matthews. 1554-1559 [doi]
• Interior-point regenerating codes on graphsAdway Patra, Alexander Barg. 1560-1565 [doi]
• On an extremal problem of regular graphs related to fractional repetition codesHongna Yang, YiWei Zhang. 1566-1571 [doi]
• Deterministic Encoding into Generalized Huff curvesLuying Li, Wei Yu, Minzhong Luo. 1572-1577 [doi]
• On Information-Debt-Optimal Streaming Codes With Small MemoryVinayak Ramkumar, M. Nikhil Krishnan, Myna Vajha, P. Vijay Kumar. 1578-1583 [doi]
• Packet Size Optimization for Batched Network CodingHoover H. F. Yin, Harry W. H. Wong, Mehrdad Tahernia, Jiaxin Qing. 1584-1589 [doi]
• Coding Size of Traffic Partition in Switch MemoriesYaniv Sadeh, Ori Rottenstreich, Haim Kaplan. 1590-1595 [doi]
• Improved batch code lower boundsRay Li, Mary Wootters. 1596-1599 [doi]
• Computing Upper and Lower Bounds for the Bandwidth of Bandlimited SignalsHolger Boche, Ullrich J. Mönich, Yannik N. Böck. 1600-1605 [doi]
• Unlimited Sampling via Generalized ThresholdingDorian Florescu, Ayush Bhandari. 1606-1611 [doi]
• Time-Data Tradeoffs in Structured Signals Recovery via the Proximal-Gradient Homotopy MethodXiao Lv, Wei Cui 0001, Yulong Liu. 1612-1616 [doi]
• A Perturbation Bound on the Subspace Estimator from Canonical ProjectionsKaran Srivastava, Daniel L. Pimentel-Alarcón. 1617-1622 [doi]
• Heterogeneous Differential Privacy via GraphsSahel Torkamani, Javad B. Ebrahimi, Parastoo Sadeghi, Rafael G. L. D'Oliveira, Muriel Médard. 1623-1628 [doi]
• Robust Optimization for Local Differential PrivacyJasper Goseling, Milan Lopuhaä-Zwakenberg. 1629-1634 [doi]
• Calibration with Privacy in Peer ReviewWenxin Ding, Gautam Kamath 0001, Weina Wang, Nihar B. Shah. 1635-1640 [doi]
• Information Theoretic Private Inference in Quantized ModelsNetanel Raviv, Rawad Bitar, Eitan Yaakobi. 1641-1646 [doi]
• Upper Confidence Interval Strategies for Multi-Armed Bandits with Entropy RewardsNir Weinberger, Michal Yemini. 1647-1652 [doi]
• Efficient Distributed Machine Learning via Combinatorial Multi-Armed BanditsMaximilian Egger, Rawad Bitar, Antonia Wachter-Zeh, Deniz Gündüz. 1653-1658 [doi]
• Multi-Environment Meta-Learning in Stochastic Linear BanditsAhmadreza Moradipari, Mohammad Ghavamzadeh, Taha Rajabzadeh, Christos Thrampoulidis, Mahnoosh Alizadeh. 1659-1664 [doi]
• Remote Contextual BanditsFrancesco Pase, Deniz Gündüz, Michele Zorzi. 1665-1670 [doi]
• Local Limit Theorems for Approximate Maximum Likelihood Estimation of Network Information Spreading ModelsAbram Magner, Amith Kumar Singh. 1671-1676 [doi]
• Hide and Seek On A BudgetChristopher Rose. 1677-1682 [doi]
• Challenging the Deployment of Fiducial Points in Minimum Error EntropySajjad Bahrami, Ertem Tuncel. 1683-1688 [doi]
• AutoVAE: Mismatched Variational Autoencoder with Irregular Posterior-Prior PairingToshiaki Koike-Akino, Ye Wang 0001. 1689-1694 [doi]
• On Information-Theoretic Determination of Misspecified Rates of ConvergenceNir Weinberger, Meir Feder. 1695-1700 [doi]
• The Exact Load-Memory Tradeoff of Multi-Access Coded Caching With Combinatorial TopologyFederico Brunero, Petros Elia. 1701-1706 [doi]
• Coded Caching for Two-Dimensional Multi-Access NetworksMingming Zhang 0003, Kai Wan, Minquan Cheng, Giuseppe Caire. 1707-1712 [doi]
• An Improved Lower Bound for Multi-Access Coded CachingK. K. Krishnan Namboodiri, B. Sundar Rajan. 1713-1718 [doi]
• Multi-Access Coded Caching Schemes from Maximal Cross Resolvable DesignsNiladri Das, B. Sundar Rajan. 1719-1724 [doi]
• A Novel Construction of Optimal Cross Z-Complementary Sets Based on Generalized Boolean FunctionsZhen-Ming Huang, Cheng-Yu Pai, Chao-Yu Chen. 1725-1730 [doi]
• Binary Classification Under ℓ0 Attacks for General Noise DistributionPayam Delgosha, Hamed Hassani, Ramtin Pedarsani. 1731-1736 [doi]
• On the Stability of Super-Resolution and a Beurling-Selberg Type Extremal ProblemMaxime Ferreira Da Costa, Urbashi Mitra. 1737-1742 [doi]
• Three New Constructions of 5-valued Spectrum Functions with Totally Disjoint Spectra DualsJiaxin Wang, Fang-Wei Fu 0001. 1743-1748 [doi]
• On the Generalized Covering Radii of Reed-Muller CodesDor Elimelech, Hengjia Wei, Moshe Schwartz 0001. 1749-1754 [doi]
• On the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS ChannelsV. Arvind Rameshwar, Navin Kashyap. 1755-1760 [doi]
• Berman Codes: A Generalization of Reed-Muller Codes that Achieve BEC CapacityLakshmi Prasad Natarajan, Prasad Krishnan. 1761-1766 [doi]
• Constrained Error Pattern Generation for GRANDMohammad Rowshan, Jinhong Yuan. 1767-1772 [doi]
• Transversal GRAND for Network Coded DataIoannis Chatzigeorgiou. 1773-1778 [doi]
• Partial Encryption after Encoding for Security and Reliability in Data SystemsAlejandro Cohen, Rafael G. L. D'Oliveira, Ken R. Duffy, Muriel Médard. 1779-1784 [doi]
• The Secure Storage Capacity of a DNA Wiretap Channel ModelPraneeth Kumar Vippathalla, Navin Kashyap. 1785-1790 [doi]
• Optimal Single Chromosome-Inversion Correcting Codes for Data Storage in Live DNATuan Thanh Nguyen, Kui Cai, Wentu Song, Kees A. Schouhamer Immink. 1791-1796 [doi]
• Correcting multiple short duplication and substitution errorsYuanyuan Tang, Shuche Wang, Ryan Gabrys, Farzad Farnoud. 1797-1802 [doi]
• The DNA Storage Channel: Capacity and Error Probability BoundsNir Weinberger, Neri Merhav. 1803-1808 [doi]
• Perfect Codes Correcting a Single Burst of Limited-Magnitude ErrorsHengjia Wei, Moshe Schwartz 0001. 1809-1814 [doi]
• On (1 + ϵ)-Approximate Block Sparse RecoveryBaris Can Esmer, Vasileios Nakos. 1815-1820 [doi]
• Group-Theoretic Wideband Radar Waveform DesignKumar Vijay Mishra, Samuel Pinilla, Ali Pezeshki, A. Robert Calderbank. 1821-1825 [doi]
• Blind Super-Resolution via Projected Gradient DescentSihan Mao, Jinchi Chen. 1826-1831 [doi]
• 3D Orientation Estimation With Configurable Backscatter ArraysMohamad Rida Rammal, Suhas N. Diggavi, Ashutosh Sabharwal. 1832-1837 [doi]
• Cactus Mechanisms: Optimal Differential Privacy Mechanisms in the Large-Composition RegimeWael Alghamdi, Shahab Asoodeh, Flávio P. Calmon, Oliver Kosut, Lalitha Sankar, Fei Wei. 1838-1843 [doi]
• Learning under Storage and Privacy ConstraintsBerivan Isik, Tsachy Weissman. 1844-1849 [doi]
• Perfect Subset Privacy for Data Sharing and LearningNetanel Raviv, Ziv Goldfeld. 1850-1855 [doi]
• Differentially Private ℓ1-norm Linear Regression with Heavy-tailed DataDi Wang, Jinhui Xu. 1856-1861 [doi]
• Exponents in smoothing the max-relative entropy and of randomness extraction against quantum side informationKe Li, Yongsheng Yao, Masahito Hayashi. 1862-1867 [doi]
• Unified approach for computing sum of sources over CQ-MACMohammad Aamir Sohail, Touheed Anwar Atif, S. Sandeep Pradhan. 1868-1873 [doi]
• High-Dimensional Quantum Conference Key AgreementOmar Amer, Walter O. Krawec. 1874-1879 [doi]
• Strong Converse for Privacy Amplification against Quantum Side InformationYu-Chen Shen, Li Gao, Hao-Chung Cheng. 1880-1885 [doi]
• Fast Beam Alignment via Pure Exploration in Multi-armed BanditsYi Wei, Zixin Zhong, Vincent Y. F. Tan, Chan Wang. 1886-1891 [doi]
• Cascading Bandits with Two-Level FeedbackDuo Cheng, Ruiquan Huang, Cong Shen, Jing Yang 0002. 1892-1896 [doi]
• SPRT-based Best Arm Identification in Stochastic BanditsArpan Mukherjee, Ali Tajer. 1897-1902 [doi]
• Quickest Detection of the Change of Community via Stochastic Block ModelsFei Sha, Ruizhi Zhang 0001. 1903-1908 [doi]
• Minimax Robust Quickest Change Detection using Wasserstein Ambiguity SetsLiyan Xie. 1909-1914 [doi]
• Active Quickest Detection When Monitoring Multi-streams with Two Affected StreamsQunzhi Xu, Yajun Mei. 1915-1920 [doi]
• Quickest Change Detection with Controlled SensingGeorgios Fellouris, Venugopal V. Veeravalli. 1921-1926 [doi]
• Optimal Shaping Gains for Continuous Spectrum Nonlinear Frequency Signalling over Long FibersYu Chen 0044, Mohammadamin Baniasadi, Majid Safari. 1927-1932 [doi]
• On the Capacity of b-Modulated Nonlinear Frequency Division MultiplexingMohammadamin Baniasadi, Yu Chen 0044, Majid Safari. 1933-1938 [doi]
• Diversity-Multiplexing Tradeoff Analysis on Block Fading Optical Wireless ChannelsSufang Yang, Longguang Li, Jintao Wang. 1939-1944 [doi]
• On the Benefit of Cooperation in Relay NetworksOliver Kosut, Michelle Effros, Michael Langberg. 1945-1950 [doi]
• On State-Dependent Streaming Erasure Codes over the Three-Node Relay NetworkGustavo Kasper Facenda, Elad Domanovitz, M. Nikhil Krishnan, Ashish Khisti, Silas L. Fong, Wai-tian Tan, John G. Apostolopoulos. 1951-1956 [doi]
• Rate-Optimal Streaming Codes Over the Three-Node Decode-And-Forward Relay NetworkShubhransh Singhvi, Gayathri R., P. Vijay Kumar. 1957-1962 [doi]
• New Bounds on the Size of Binary Codes with Large Minimum DistanceJames Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan. 1963-1968 [doi]
• Minimal Length of Nontrivial Solutions of the Isometry Equation and MacWilliams Extension Property with Respect to Weighted Poset MetricYang Xu 0040, Haibin Kan, Guangyue Han. 1969-1974 [doi]
• Fourier-Reflexive Partitions and Group of Linear Isometries with Respect to Weighted Poset MetricYang Xu 0040, Haibin Kan, Guangyue Han. 1975-1980 [doi]
• Non-standard linear recurring sequence subgroups and automorphisms of irreducible cyclic codesHenk D. L. Hollmann. 1981-1986 [doi]
• Capacity of Noisy Permutation ChannelsJennifer Tang, Yury Polyanskiy. 1987-1992 [doi]
• On the Ranking Recovery from Noisy Observations up to a DistortionMin-Oh Jeong, Martina Cardone, Alex Dytso. 1993-1998 [doi]
• A Generalization of the Stratonovich's Value of Information and Application to Privacy-Utility Trade-offAkira Kamatsuka, Takahiro Yoshida, Toshiyasu Matsushima. 1999-2004 [doi]
• An Information-Theoretic Characterization of Pufferfish PrivacyTheshani Nuradha, Ziv Goldfeld. 2005-2010 [doi]
• Private Information Delivery with Coded StorageKanishak Vaidya, B. Sundar Rajan. 2011-2015 [doi]
• Differentially Private Distributed Matrix Multiplication: Fundamental Accuracy-Privacy Trade-Off LimitsAteet Devulapalli, Viveck R. Cadambe, Flávio P. Calmon, Haewon Jeong. 2016-2021 [doi]
• Proportional Fair Clustered Federated LearningMohamed S. Nafea, Eugine Shin, Aylin Yener. 2022-2027 [doi]
• Stochastic Coded Federated Learning with Convergence and Privacy GuaranteesYuchang Sun 0001, Jiawei Shao, Songze Li, Yuyi Mao, Jun Zhang 0004. 2028-2033 [doi]
• Computational Code-Based Privacy in Coded Federated LearningMarvin Xhemrishi, Alexandre Graell i Amat, Eirik Rosnes, Antonia Wachter-Zeh. 2034-2039 [doi]
• Joint Privacy Enhancement and Quantization in Federated LearningNatalie Lang, Nir Shlezinger. 2040-2045 [doi]
• Uncertainty-Based Non-Parametric Active Peak DetectionPraneeth Narayanamurthy, Urbashi Mitra. 2046-2051 [doi]
• Rare and Weak Detection Models under Moderate Deviations Analysis and Log-Chisquared P-valuesAlon Kipnis. 2052-2057 [doi]
• Aspis: Robust Detection for Distributed LearningKonstantinos Konstantinidis, Aditya Ramamoorthy. 2058-2063 [doi]
• Detecting Correlated Gaussian DatabasesZeynep K, Bobak Nazer. 2064-2069 [doi]
• Game Theoretic Analysis of an Adversarial Status Updating SystemSubhankar Banerjee, Sennur Ulukus. 2070-2075 [doi]
• Privacy Leakage in Discrete-Time Updating SystemsNitya Sathyavageeswaran, Roy D. Yates, Anand D. Sarwate, Narayan B. Mandayam. 2076-2081 [doi]
• Age-Optimal Causal Labeling of Memoryless ProcessesYunus Inan, Emre Telatar. 2082-2087 [doi]
• Age of Information in Reservation Multi-Access Networks with Stochastic ArrivalsQian Wang, He Henry Chen. 2088-2093 [doi]
• Efficiently Computable Converses for Finite-Blocklength CommunicationFelipe Areces, Dan Song, Richard D. Wesel, Aaron B. Wagner. 2094-2099 [doi]
• Dirty Paper Coding for Consecutive Messages with Heterogeneous Decoding Deadlines in the Finite Blocklength RegimeHoma Nikbakht, Malcolm Egan, Jean-Marie Gorce. 2100-2105 [doi]
• Achievable Information-Energy Region in the Finite Block-Length Regime with Finite ConstellationsSadaf ul Zuhra, Samir M. Perlaza, H. Vincent Poor, Eitan Altman. 2106-2111 [doi]
• Statistical Delay and Error-Rate Bounded QoS Control for URLLC in the Non-Asymptotic RegimeXi Zhang 0005, Jingqing Wang, H. Vincent Poor. 2112-2117 [doi]
• Minimum distance and other properties of quasi-dyadic parity check codesMeraiah Martinez, Christine A. Kelley. 2118-2123 [doi]
• Sub-Block Rearranged Staircase Codes for Optical Transport NetworksMin Qiu 0001, Jinhong Yuan. 2124-2129 [doi]
• Preserving the Minimum Distance of Polar-Like Codes while Increasing the Information LengthSamet Gelincik, Philippe Mary, Anne Savard, Jean-Yves Baudais. 2130-2135 [doi]
• A Generalization of the ASR Search Algorithm to 2-Generator Quasi-Twisted CodesSaurav R. Pandey, Nuh Aydin, Matthew J. Harrington, Dev Akre. 2136-2141 [doi]
• Adjacent-Bits-Swapped Polar codes: A new code construction to speed up polarizationGuodong Li, Min Ye, Sihuang Hu. 2142-2147 [doi]
• Binary Polar Codes Based on Bit Error ProbabilityJun Muramatsu. 2148-2153 [doi]
• Polar Coded Computing: The Role of the Scaling ExponentDorsa Fathollahi, Marco Mondelli. 2154-2159 [doi]
• Design of Multilevel Polar Codes with ShapingPeter Trifonov. 2160-2165 [doi]
• Higher-Order MDS CodesRon M. Roth. 2166-2171 [doi]
• PMDS Array Codes With Small Sub-packetization Level and Small Repair BandwidthJie Li 0019, Xiaohu Tang, Hanxu Hou, Yunghsiang S. Han, Bo Bai 0001, Gong Zhang. 2172-2177 [doi]
• Maximum-Length Low-Density MDS Codes and Near Resolvable DesignsOdae Al Aboud, Daniel Panario, Brett Stevens. 2178-2183 [doi]
• New constructions of binary MDS array codes and locally repairable array codesJingjie Lv, Weijun Fang, Bin Chen 0011, Shu-Tao Xia, Xiangyu Chen. 2184-2189 [doi]
• Distances Release with Differential Privacy in Tree and Grid GraphChenglin Fan, Ping Li 0001. 2190-2195 [doi]
• Distributed User-Level Private Mean EstimationAntonious M. Girgis, Deepesh Data, Suhas N. Diggavi. 2196-2201 [doi]
• Maximum Mutual Information under Local Differential Privacy ConstraintJiangnan Cheng, Ao Tang. 2202-2206 [doi]
• Private Balance-Checking on Blockchain Accounts Using Private Integer AdditionBirenjith Sasidharan, Emanuele Viterbo. 2207-2212 [doi]
• Learning quantum circuits of T -depth oneChing-Yi Lai, Hao-Chung Cheng. 2213-2218 [doi]
• Bounding quantum capacities via partial orders and complementarityChristoph Hirche, Felix Leditzky. 2219-2224 [doi]
• Quantum message-passing algorithm for optimal and efficient decodingChristophe Piveteau, Joseph M. Renes. 2225-2230 [doi]
• Communication with Unreliable Entanglement AssistanceUzi Pereg, Christian Deppe, Holger Boche. 2231-2236 [doi]
• Approximate Set Identification: PAC Analysis for Group TestingSameera Bharadwaja H., Monika Bansal, Chandra R. Murthy. 2237-2242 [doi]
• Improving Group Testing via Gradient DescentSundara Rajan Srinivasavaradhan, Pavlos Nikolopoulos, Christina Fragouli, Suhas N. Diggavi. 2243-2248 [doi]
• Group Testing with a Dynamic Infection SpreadBatuhan Arasli, Sennur Ulukus. 2249-2254 [doi]
• Dynamic group testing to control and monitor disease progression in a populationSundara Rajan Srinivasavaradhan, Pavlos Nikolopoulos, Christina Fragouli, Suhas N. Diggavi. 2255-2260 [doi]
• On Distributed Sampling for Detection of Poisson SourcesVanlalruata Ralte, Praveen Sharma, Amitalok J. Budkuley, Stefano Rini. 2261-2266 [doi]
• Sensitivity of Under-Determined Linear SystemYunfeng Cai, Guanhua Fang, Ping Li 0001. 2267-2272 [doi]
• Asymptotic Mean Squared Error of Noisy Periodical Successive Over-RelaxationTadashi Wadayama, Satoshi Takabe. 2273-2278 [doi]
• Mitigating Noise in Ensemble Classification with Real-Valued Base FunctionsYuval Ben-Hur, Asaf Goren, Da El Klang, Yongjune Kim 0001, Yuval Cassuto. 2279-2284 [doi]
• Designing Two-Dimensional Complete Complementary Codes for Omnidirectional Transmission in Massive MIMO SystemsCheng-Yu Pai, Zi Long Liu 0001, You-Qi Zhao, Zhen-Ming Huang, Chao-Yu Chen. 2285-2290 [doi]
• Capacity Optimal Coded Generalized MU-MIMOYuhao Chi, Lei Liu 0005, Guanghui Song, Ying Li 0002, Yong Liang Guan 0001, Chau Yuen. 2291-2296 [doi]
• Optimal Order of Encoding for Gaussian MIMO Multi-Receiver Wiretap ChannelYue Qi, Mojtaba Vaezi. 2297-2302 [doi]
• Quantized MIMO: Channel Capacity and Spectrospatial Power DistributionAbbas Khalili, Elza Erkip, Sundeep Rangan. 2303-2308 [doi]
• Third-order Analysis of Channel Coding in the Moderate Deviations RegimeRecep Can Yavas, Victoria Kostina, Michelle Effros. 2309-2314 [doi]
• Second-Order Converse for Rate-Limited Common Randomness GenerationHenri Hentilä, Yanina Shkel, Visa Koivunen. 2315-2320 [doi]
• Sequentially Mixing Randomly Arriving Packets Improves Channel Dispersion Over Block-Based DesignsPin-Wen Su, Yu-Chih Huang, Shih-Chun Lin, I-Hsiang Wang, Chih-Chun Wang. 2321-2326 [doi]
• Variable-Length Stop-Feedback Codes With Finite Optimal Decoding Times for BI-AWGN ChannelsHengjie Yang, Recep Can Yavas, Victoria Kostina, Richard D. Wesel. 2327-2332 [doi]
• List Decoding of Quaternary Codes in the Lee MetricMarcus Greferath, Jens Zumbrägel. 2333-2337 [doi]
• List Decoding of 2-Interleaved Binary Alternant CodesChih-Chiang Huang, Hedongliang Liu, Lukas Holzbaur, Sven Puchinger, Antonia Wachter-Zeh. 2338-2343 [doi]
• Improving the List Decoding Version of the Cyclically Equivariant Neural DecoderXiangyu Chen, Min Ye. 2344-2349 [doi]
• Secure codes with list decodingYujie Gu, Ilya Vorobyev, Ying Miao. 2350-2355 [doi]
• Joint Source-Channel Polar-Coded ModulationBolin Wu, Jincheng Dai, Kai Niu 0001. 2356-2361 [doi]
• Distributed Joint Source-Channel Polar CodingYanfei Dong, Kai Niu 0001, Jincheng Dai. 2362-2367 [doi]
• The Complete SC-Invariant Affine Automorphisms of Polar CodesZicheng Ye, Yuan Li, Huazi Zhang, Rong Li 0001, Jun Wang 0062, Guiying Yan, Zhiming Ma. 2368-2373 [doi]
• Polar Codes Do Not Have Many Affine AutomorphismsKirill Ivanov, Rüdiger L. Urbanke. 2374-2378 [doi]
• Optimal-Repair-Cost MDS Array Codes for a Class of Heterogeneous Distributed Storage SystemsZhengrui Li, Wai Ho Mow, Lei Deng, Ting-Yi Wu. 2379-2384 [doi]
• Balanced and Swap-Robust Trades for Dynamical Distributed StorageChao Pan, Ryan Gabrys, Xujun Liu, Charles J. Colbourn, Olgica Milenkovic. 2385-2390 [doi]
• Private Read Update Write (PRUW) with Storage Constrained DatabasesSajani Vithana, Sennur Ulukus. 2391-2396 [doi]
• Data Integrity Check in Distributed Storage SystemsZhiquan Tan, Sian-Jheng Lin, Yunghsiang S. Han, Zhongyi Huang, Bo Bai 0001, Gong Zhang. 2397-2402 [doi]
• Fundamental Limits of Multi-Sample Flow Graph DecompositionKayvon Mazooji, Sreeram Kannan, William Stafford Noble, Ilan Shomorony. 2403-2408 [doi]
• The Optimal Sample Complexity of Matrix Completion with Hierarchical Similarity GraphsAdel M. Elmahdy, Junhyung Ahn, Soheil Mohajer, Changho Suh. 2409-2414 [doi]
• Partial Extraction from Invertible Bloom FiltersIvo Kubjas, Vitaly Skachek. 2415-2420 [doi]
• Composite Anomaly Detection via Hierarchical Dynamic SearchBenjamin Wolff, Tomer Gafni, Guy Revach, Nir Shlezinger, Kobi Cohen. 2421-2426 [doi]
• Chain rules for quantum channelsMario Berta, Marco Tomamichel. 2427-2432 [doi]
• The platypus of the quantum channel zooFelix Leditzky, Debbie W. Leung, Vikesh Siddhu, Graeme Smith, John A. Smolin. 2433-2438 [doi]
• A smallest computable entanglement monotoneJens Eisert, Mark M. Wilde. 2439-2444 [doi]
• Communicating over a Classical-Quantum MAC with State Information Distributed at SendersArun Padakandla. 2445-2450 [doi]
• AirNet: Neural Network Transmission over the AirMikolaj Jankowski, Deniz Gündüz, Krystian Mikolajczyk. 2451-2456 [doi]
• Interpreting Deep-Learned Error-Correcting CodesN. Devroye, N. Mohammadi, A. Mulgund, H. Naik, R. Shekhar, György Turán, Y. Wei, M. Zefran. 2457-2462 [doi]
• Learning neural codes for perceptual uncertaintyMehrdad Salmasi, Maneesh Sahani. 2463-2468 [doi]
• Learning Maximum Margin Channel Decoders for Non-linear Gaussian ChannelsAmit Tsvieli, Nir Weinberger. 2469-2474 [doi]
• The Compound Information Bottleneck ProgramMichael Dikshtein, Nir Weinberger, Shlomo Shamai Shitz. 2475-2480 [doi]
• Tighter Expected Generalization Error Bounds via Convexity of Information MeasuresGholamali Aminian, Yuheng Bu, Gregory W. Wornell, Miguel R. D. Rodrigues. 2481-2486 [doi]
• Understanding Generalization via Leave-One-Out Conditional Mutual InformationMahdi Haghifam, Shay Moran, Daniel M. Roy 0001, Gintare Karolina Dziugiate. 2487-2492 [doi]
• A Variational Formula for Infinity-Rényi Divergence with Applications to Information LeakageGowtham R. Kurri, Oliver Kosut, Lalitha Sankar. 2493-2498 [doi]
• Canonical Training is Bad for Reconfigurable Intelligent SurfacesBharath Shamasundar, Aria Nosratinia. 2499-2504 [doi]
• Channel State Acquisition in FDD Massive MIMO: Rate-Distortion Bound and Effectiveness of "Analog" FeedbackMahdi Barzegar Khalilsarai, Yi Song 0011, Tianyu Yang, Giuseppe Caire. 2505-2510 [doi]
• MIMO Systems with One-bit ADCs: Capacity Gains using Nonlinear Analog OperationsFarhad Shirani 0001, Hamidreza Aghasi. 2511-2516 [doi]
• A Partition-based Scheme for IRS-aided MIMO Fading Channels: Outage and DMT AnalysisAndreas Nicolaides, Constantinos Psomas, Ghassan M. Kraidy, Ioannis Krikidis. 2517-2522 [doi]
• The Capacity of Causal Adversarial ChannelsYihan Zhang, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate. 2523-2528 [doi]
• Channel Capacity for Adversaries with Computationally Bounded ObservationsEric Ruzomberka, Chih-Chun Wang, David J. Love. 2529-2534 [doi]
• New Results on AVCs with Omniscient and Myopic AdversariesAnuj Kumar Yadav, Mohammadreza Alimohammadi, Yihan Zhang, Amitalok J. Budkuley, Sidharth Jaggi. 2535-2540 [doi]
• Noisy Sorting CapacityZiao Wang, Nadim Ghaddar, Lele Wang 0001. 2541-2546 [doi]
• Feedback Capacity of Gaussian Channels with MemoryOron Sabag, Victoria Kostina, Babak Hassibi. 2547-2552 [doi]
• List-Decodable Zero-Rate Codes for the Z-ChannelNikita Polyanskii, Yihan Zhang. 2553-2558 [doi]
• List-Decodability of Poisson Point ProcessesYihan Zhang, Shashank Vatedka. 2559-2564 [doi]
• Singleton-type bounds for list-decoding and list-recovery, and related resultsEitan Goldberg, Chong Shangguan, Itzhak Tamo. 2565-2570 [doi]
• Improving Belief Propagation List Decoding of Polar Codes by Post-ProcessingYonatan Urman, Guy Mogilevsky, David Burshtein. 2571-2576 [doi]
• Approximate Weight Distribution of Polarization-Adjusted Convolutional (PAC) CodesSadra Seyedmasoumian, Tolga M. Duman. 2577-2582 [doi]
• Polar Coded Merkle Tree: Improved Detection of Data Availability Attacks in Blockchain SystemsDebarnab Mitra, Lev Tauz, Lara Dolecek. 2583-2588 [doi]
• On the Bit-Channels for Channel PolarizationWen-Yao Chen, Chung-Chin Lu. 2589-2594 [doi]
• Multilevel Binary Polar-Coded Modulation Achieving the Capacity of Asymmetric ChannelsConstantin Runge, Thomas Wiegart, Diego Lentner, Tobias Prinz. 2595-2600 [doi]
• New Piggybacking Codes with Lower Repair Bandwidth for Any Single-Node FailureHao Shi, Hanxu Hou, Yunghsiang S. Han, Patrick P. C. Lee, Zhengyi Jiang, Zhongyi Huang, Bo Bai 0001. 2601-2606 [doi]
• Practical Considerations in Repairing Reed-Solomon CodesDinh Thi Xinh, Luu Y. Nhi Nguyen, Lakshmi J. Mohan, Serdar Boztas, Tran Thi Luong, Son Hoang Dau. 2607-2612 [doi]
• Dual-Code Bounds on Multiple Concurrent (Local) Data RecoveryGianira N. Alfarano, Alberto Ravagnani, Emina Soljanin. 2613-2618 [doi]
• A New Approach to Compute Information Theoretic Outer Bounds and Its Application to Regenerating CodesWenjing Chen, Chao Tian 0002. 2619-2624 [doi]
• A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain ItHan Cai, Moshe Schwartz 0001. 2625-2630 [doi]
• Uniqueness and Robustness of Tem-Based FRI SamplingHila Naaman, Satish Mulleti, Yonina C. Eldar. 2631-2636 [doi]
• Recoverable systems on lines and gridsAlexander Barg, Ohad Elishco, Ryan Gabrys, Eitan Yaakobi. 2637-2642 [doi]
• A Computational Design of Aperiodic Mismatched Filtering SequencesZhi Gu, Avik Ranjan Adhikary, Zhengchun Zhou, Pingzhi Fan. 2643-2647 [doi]
• Signaling for MISO Channels Under First- and Second-Moment ConstraintsShuai Ma, Stefan M. Moser, Ligong Wang 0002, Michèle A. Wigger. 2648-2653 [doi]
• Distillation of Secret Key and GHZ States from Multipartite Mixed StatesFarzin Salek, Andreas J. Winter 0002. 2654-2659 [doi]
• Protecting Semantic Information Using An Efficient Secret KeyTao Guo, Jie Han 0002, Huihui Wu, Yizhu Wang, Bo Bai 0001, Wei Han. 2660-2665 [doi]
• Secret Key-based Authentication With Passive Eavesdropper for Scalar Gaussian SourcesVamoua Yachongka, Hideki Yagi, Yasutada Oohama. 2666-2671 [doi]
• Secret Keys from Parity Bits in the Satellite SettingJari Lietzén, Olav Tirkkonen, Roope Vehkalahti. 2672-2677 [doi]
• Improved Bound on the Local Leakage-resilience of Shamir's Secret SharingHemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Mingyuan Wang. 2678-2683 [doi]
• Simultaneous Sensing and Channel Access based on Partial Observations via Deep Reinforcement LearningYoel Bokobza, Ron Dabora, Kobi Cohen. 2684-2689 [doi]
• DeepNP: Deep Learning-Based Noise Prediction for Ultra-Reliable Low-Latency CommunicationsAlejandro Cohen, Amit Solomon, Nir Shlezinger. 2690-2695 [doi]
• Learning to Broadcast with Layered Division MultiplexingRoy Karasik, Osvaldo Simeone, Shlomo Shamai Shitz. 2696-2701 [doi]
• Information Structures for State-Dependent Decentralized DetectionJoni Shaska, Urbashi Mitra. 2702-2707 [doi]
• On Sub-optimality of Random Binning for Distributed Hypothesis TestingShun Watanabe. 2708-2713 [doi]
• Benefits of Rate-Sharing for Distributed Hypothesis TestingMustapha Hamad, Mireille Sarkiss, Michèle A. Wigger. 2714-2719 [doi]
• Can we break the dependency in distributed detection?Osama A. Hanna, Xinlin Li, Christina Fragouli, Suhas N. Diggavi. 2720-2725 [doi]
• Consistent Bayesian community recovery in multilayer networksKalle Alaluusua, Lasse Leskelä. 2726-2731 [doi]
• A Rigorous Proof of the Capacity of MIMO Gauss-Markov Rayleigh Fading ChannelsRami Ezzine, Moritz Wiese, Christian Deppe, Holger Boche. 2732-2737 [doi]
• On Broadcast Approach to MIMO Fading ChannelsKangning Ma, Yinfei Xu, Shuo Shao. 2738-2743 [doi]
• MIMO Gaussain Cognitive Interference Channels With Confidential MessagesYinfei Xu, Tong Zhang, Yong Dong, Jian Lu, Yili Xia. 2744-2749 [doi]
• Beating the Sum-Rate Capacity of the Binary Adder Channel with Non-Signaling CorrelationsOmar Fawzi, Paul Fermé. 2750-2755 [doi]
• On the separation of correlation-assisted sum capacities of multiple access channelsAkshay Seshadri, Felix Leditzky, Vikesh Siddhu, Graeme Smith. 2756-2761 [doi]
• On Zero-Error Capacity of "One-Edge" Binary Channels with Two MemoriesQi Cao, Qi Chen. 2762-2767 [doi]
• A New Framework for Proving Coding Theorems for Linear CodesXiao Ma, Yixin Wang, Tingting Zhu. 2768-2773 [doi]
• Capacity-Achieving Input Distributions: Algorithmic Computability and ApproximabilityHolger Boche, Rafael F. Schaefer, H. Vincent Poor. 2774-2779 [doi]
• On Multibasis Information Set DecodingSebastian Bitzer, Martin Bossert. 2780-2784 [doi]
• Decoding of Generalized Concatenated Codes Over the One-Lee Error Channel for the McEliece CryptosystemJohann-Philipp Thiers, Jürgen Freudenberger. 2785-2790 [doi]
• Generalized Inverse Based DecodingFerucio Laurentiu Tiplea, Vlad-Florin Dragoi. 2791-2796 [doi]
• TinyTurbo: Efficient Turbo Decoders on EdgeS. Ashwin Hebbar, Rajesh K. Mishra, Sravan Kumar Ankireddy, Ashok Vardhan Makkuva, Hyeji Kim, Pramod Viswanath. 2797-2802 [doi]
• A Linear Physical-Layer Network Coding Based Multiple Access ApproachQiuzhuo Chen, Fangtao Yu, Tao Yang 0004, Jingge Zhu, Rongke Liu. 2803-2808 [doi]
• Endurance Network Coding for Multi-Hop Wireless CommunicationsZhuolin Bian, Wangmei Guo, Minhan Tian. 2809-2814 [doi]
• Base Station-Assisted Cooperative Network Coding for Cellular Systems with Link ConstraintsSuayb S. Arslan, Massoud Pourmandi, Elif Haytaoglu. 2815-2820 [doi]
• An Achievable Rate Region for 3-User Classical-Quantum Broadcast ChannelsArun Padakandla. 2821-2826 [doi]
• Improved Weakly Private Information Retrieval CodesChengyuan Qian, Ruida Zhou, Chao Tian 0002, Tie Liu 0002. 2827-2832 [doi]
• The Linear Capacity of Single-Server Individually-Private Information Retrieval With Side InformationAnoosheh Heidarzadeh, Alex Sprintson. 2833-2838 [doi]
• Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller CodesPerttu Saarela, Matteo Allaix, Ragnar Freij-Hollanti, Camilla Hollanti. 2839-2844 [doi]
• Distributed Information Bottleneck for a Primitive Gaussian Diamond Channel with Rayleigh FadingHao Xu 0003, Kai-Kit Wong, Giuseppe Caire, Shlomo Shamai Shitz. 2845-2850 [doi]
• An Adaptive Composition Theorem for Maximal Leakage for Binary InputsIbrahim Issa, Aaron B. Wagner. 2851-2855 [doi]
• Distributed Attribute-based Private Access ControlAmir Masoud Jafarpisheh, Mahtab Mirmohseni, Mohammad Ali Maddah-Ali. 2856-2861 [doi]
• Privacy Limits in Power-Law Bipartite Networks under Active Fingerprinting AttacksMahshad Shariatnasab, Farhad Shirani 0001, Zahid Anwar. 2862-2867 [doi]
• Coded Categorization in Massive Random AccessRyan Song, Kareem M. Attiah, Wei Yu 0001. 2868-2873 [doi]
• Improved Bounds for the Many-User MACSuhas S. Kowshik. 2874-2879 [doi]
• Unsourced Random Access with a Massive MIMO Receiver Using Multiple Stages of Orthogonal PilotsMohammad Javad Ahmadi, Tolga M. Duman. 2880-2885 [doi]
• Energy Efficiency Analysis of a Feedback-Aided IRSA SchemeJavad Haghighat, Tolga M. Duman. 2886-2891 [doi]
• Partial Information Decomposition via Deficiency for Multivariate GaussiansPraveen Venkatesh, Gabriel Schamberg. 2892-2897 [doi]
• Optimizing Estimated Directed Information over Discrete AlphabetsDor Tsur, Ziv Aharoni, Ziv Goldfeld, Haim H. Permuter. 2898-2903 [doi]
• On Sibson's α-Mutual InformationAmedeo Roberto Esposito, Adrien Vandenbroucque, Michael Gastpar. 2904-2909 [doi]
• On Finite-Time Mutual InformationJieao Zhu, Zijian Zhang, Zhongzhichao Wan, Linglong Dai. 2910-2915 [doi]
• Ternary Message Passing Decoding of RS-SPC Product CodesMingyang Zhu, Ming Jiang 0012, Chunming Zhao. 2916-2921 [doi]
• Look-Ahead Bit-Flipping Decoding of MDPC CodeHaruhiko Kaneko. 2922-2927 [doi]
• A Semi Linear State Space Model for Error Floor Estimation of LDPC codes over the AWGN ChannelAli Farsiabi, Amir H. Banihashemi. 2928-2933 [doi]
• Adversarial Torn-paper CodesDaniella Bar-Lev, Sagi Marcovich, Eitan Yaakobi, Yonatan Yehezkeally. 2934-2939 [doi]
• Reed Solomon Codes Against Adversarial Insertions and DeletionsRoni Con, Amir Shpilka, Itzhak Tamo. 2940-2945 [doi]
• Asymptotic Nash Equilibrium for the Sequential Adversarial Hypothesis Testing GameJiachun Pan, Yonglong Li, Vincent Y. F. Tan. 2946-2951 [doi]
• Improved Adversarial Robustness by Hardened PredictionQihang Liang, Chung Chan. 2952-2956 [doi]
• Equivalence of Quantum Single Insertion and Single Deletion Error-Correctabilities, and Construction of Codes and DecodersTaro Shibayama, Manabu Hagiwara. 2957-2962 [doi]
• Learning quantum graph states with product measurementsYingkai Ouyang, Marco Tomamichel. 2963-2968 [doi]
• Stabilizer codes and Symbol-Pair Metric are RelatedVatsal Pramod Jha, Udaya Parampalli, Abhay Kumar Singh. 2969-2973 [doi]
• Multi-Party Quantum Purity Distillation with Bounded Classical CommunicationTouheed Anwar Atif, S. Sandeep Pradhan. 2974-2979 [doi]
• Sparse Group Quantitative PCR Testing by Belief PropagationYoshiki Hara, Kenta Kasai. 2980-2984 [doi]
• Asymptotically optimal multistage tests for iid dataYiming Xing, Georgios Fellouris. 2985-2990 [doi]
• A Data-driven Missing Mass Estimation FrameworkAmichai Painsky. 2991-2995 [doi]
• Adaptive Worker Grouping for Communication-Efficient and Straggler-Tolerant Distributed SGDFeng Zhu, Jingjing Zhang, Osvaldo Simeone, Xin Wang. 2996-3000 [doi]
• On Fisher Information Matrix for Simple Neural Networks with Softplus ActivationMasazumi Iida, Yoshinari Takeishi, Jun'ichi Takeuchi. 3001-3006 [doi]
• On Algebraic Constructions of Neural Networks with Small WeightsKordag Mehmet Kilic, Jin Sima, Jehoshua Bruck. 3007-3012 [doi]
• On Multiple and Hierarchical UniversalityYaniv Fogel, Meir Feder. 3013-3018 [doi]
• Irregular Repetition Slotted ALOHA in an Information-Theoretic SettingEnrico Paolini, Lorenzo Valentini, Velio Tralli, Marco Chiani. 3019-3024 [doi]
• Coding for Sensing: An Improved Scheme for Integrated Sensing and Communication over MACsMehrasa Ahmadipour, Michèle A. Wigger, Mari Kobayashi. 3025-3030 [doi]
• Bounds on the Capacity of the Multiple Access Diamond Channel with Cooperating Base-StationsMichael Dikshtein, Shirin Saeedi Bidokhti, Shlomo Shamai Shitz. 3031-3036 [doi]
• Continuous-Time Noisy Average Consensus System as Gaussian Multiple Access ChannelTadashi Wadayama, Ayano Nakai-Kasai. 3037-3042 [doi]
• Iterative Water-Filling Power and Subcarrier Allocation for Multicarrier Non-Orthogonal Multiple Access UplinkChin Choy Chai, Xiao-Ping Zhang. 3043-3048 [doi]
• Shared Information for a Markov Chain on a TreeSagnik Bhattacharya, Prakash Narayan. 3049-3054 [doi]
• Finite Littlestone Dimension Implies Finite Information ComplexityAditya Pradeep, Ido Nachum, Michael Gastpar. 3055-3060 [doi]
• Augustin Information Measures on Fading Channels Under Certain Symmetry HypothesisMücahit Furkan Yildiz, Baris Nakiboglu. 3061-3066 [doi]
• The Generalized Degrees-of-Freedom of the Asymmetric Interference Channel with Delayed CSITTong Zhang, Yufan Zhuang, Yinfei Xu. 3067-3072 [doi]
• Improved semidefinite programming bounds for binary codes by split distance enumerationsPin-Chieh Tseng, Ching-Yi Lai, Wei-Hsuan Yu. 3073-3078 [doi]
• Norm-trace-lifted codes over binary fieldsGretchen L. Matthews, Aidan W. Murphy. 3079-3084 [doi]
• Lower bounds for Multiple PackingYihan Zhang, Shashank Vatedka. 3085-3090 [doi]
• Using One Redundant Bit to Construct Two-Dimensional Almost-Balanced CodesTuan Thanh Nguyen, Kui Cai, Han Mao Kiah, Kees A. Schouhamer Immink, Yeow Meng Chee. 3091-3096 [doi]
• Efficient Capacity-Achieving Codes for General Repeat ChannelsFrancisco Pernice, Ray Li, Mary Wootters. 3097-3102 [doi]
• Weighted Parity-Check Codes for Channels with State and Asymmetric ChannelsChih Wei Ling, Yanxiao Liu 0003, Cheuk Ting Li. 3103-3108 [doi]
• Converting a 1×K Static Rayleigh Channel to K Parallel AWGN Using Media-based ModulationEhsan Seifi, Amir K. Khandani. 3109-3113 [doi]
• Reduction of Delay for Delayed Bit-Interleaved Coded ModulationGou Hosoya. 3114-3119 [doi]
• n/3 for k + 1 helper nodesGuodong Li, Ningning Wang, Sihuang Hu, Min Ye. 3120-3125 [doi]
• Optimal and Almost Optimal Cyclic (r, δ)-LRCs With Large Code LengthsJing Qiu, Weijun Fan, Fang-Wei Fu 0001. 3126-3131 [doi]
• Towards Efficient Repair and Coding of Binary MDS Array Codes with Small Sub-packetizationHanxu Hou, Yunghsiang S. Han, Bo Bai 0001, Gong Zhang. 3132-3137 [doi]
• Sketching sparse low-rank matrices with near-optimal sample- and time-complexityXiaoqi Liu, Ramji Venkataramanan. 3138-3143 [doi]
• Estimating Sparse Distributions Under Joint Communication and Privacy ConstraintsSurin Ahn, Wei-Ning Chen, Ayfer Özgür. 3144-3149 [doi]
• Efficient and Robust Classification for Sparse AttacksMark Beliaev, Payam Delgosha, Hamed Hassani, Ramtin Pedarsani. 3150-3155 [doi]
• Graph-assisted Matrix Completion in a Multi-clustered Graph ModelGeewon Suh, Changho Suh. 3156-3161 [doi]
• On Meta-Bound for Lower Bounds of Bayes RiskShota Saito. 3162-3167 [doi]
• No Rose for MLE: Inadmissibility of MLE for Evaluation Aggregation Under Levels of ExpertiseCharvi Rastogi, Ivan Stelmakh, Nihar B. Shah, Sivaraman Balakrishnan. 3168-3173 [doi]
• On the Fundamental Limits of Exact Inference in Structured PredictionHanbyul Lee, Kevin Bello, Jean Honorio. 3174-3179 [doi]
• Geometry of the Minimum Volume Confidence SetsHeguang Lin, Mengze Li, Daniel L. Pimentel-Alarcón, Matthew L. Malloy. 3180-3185 [doi]
• Decentralized Updates Scheduling for Data Freshness in Mobile Edge ComputingJunyi He, Di Zhang 0010, Shumeng Liu, Yuezhi Zhou, Yaoxue Zhang. 3186-3191 [doi]
• How Useful Is Delayed Feedback in AoI Minimization - A Study on Systems With Queues in Both Forward and Backward DirectionsChih-Chun Wang. 3192-3197 [doi]
• Age Distribution in Arbitrary Preemptive Memoryless NetworksRajai Nasser, Ibrahim Issa, Ibrahim C. Abou-Faycal. 3198-3203 [doi]
• Reliability function for streaming over a DMC with feedbackNian Guo, Victoria Kostina. 3204-3209 [doi]
• Typical Random Coding Exponent for Finite-State ChannelsGiuseppe Cocco, Albert Guillén i Fàbregas, Josep Font-Segura. 3210-3214 [doi]
• A Simple Coding Scheme Attaining Positive Information VelocityYan Hao Ling, Jonathan Scarlett. 3215-3219 [doi]
• Proactive Resilience in 1-2-1 NetworksMine Gokce Dogan, Martina Cardone, Christina Fragouli. 3220-3225 [doi]
• On the Secrecy Gain of Formally Unimodular Construction A4 LatticesMaiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus. 3226-3231 [doi]
• Lower Bound on the Error Rate of Genie-Aided Lattice DecodingJiajie Xue, Brian M. Kurkoski. 3232-3237 [doi]
• Lattices from Linear Codes: Source and Channel NetworksFarhad Shirani 0001, S. Sandeep Pradhan. 3238-3243 [doi]
• Very Pliable Index CodingLawrence Ong, Badri N. Vellambi. 3244-3249 [doi]
• On the Optimality of Linear Index Coding over the Fields with Characteristic ThreeArman Sharififar, Parastoo Sadeghi, Neda Aboutorab. 3250-3255 [doi]
• Information Leakage in Index Coding With Sensitive and Non-Sensitive MessagesYucheng Liu, Lawrence Ong, Phee Lep Yeoh, Parastoo Sadeghi, Jörg Kliewer, Sarah Johnson 0001. 3256-3261 [doi]
• Bandwidth Cost of Code Conversions in the Split RegimeFrancisco Maturana, K. V. Rashmi. 3262-3267 [doi]
• Update and Repair Efficient Storage Codes with Availability via Finite Projective PlanesJunming Ke, Ago-Erik Riet. 3268-3273 [doi]
• Quantifying the Cost of Privately Storing Data in Distributed Storage SystemsRémi A. Chou. 3274-3279 [doi]
• Universal 1-Bit Compressive Sensing for Bounded Dynamic Range SignalsSidhant Bansal, Arnab Bhattacharyya 0001, Anamay Chaturvedi, Jonathan Scarlett. 3280-3284 [doi]
• Fast Low Rank column-wise Compressive SensingSeyedehsara Nayer, Namrata Vaswani. 3285-3290 [doi]
• Data-Time Tradeoffs for Optimal k-Thresholding Algorithms in Compressed SensingJialiang Xu, Xu Zhang. 3291-3296 [doi]
• Simple Binary Hypothesis Testing under Communication ConstraintsAnkit Pensia, Po-Ling Loh, Varun S. Jog. 3297-3302 [doi]
• Asymptotics for Outlier Hypothesis TestingLin Zhou 0002, Yun Wei, Alfred O. Hero III. 3303-3308 [doi]
• Robust Hypothesis Testing with Kernel Uncertainty SetsZhongchang Sun, Shaofeng Zou. 3309-3314 [doi]
• A Data-Driven Approach to Robust Hypothesis Testing Using Sinkhorn Uncertainty SetsJie Wang, Yao Xie. 3315-3320 [doi]
• On Joint Communication and Channel DiscriminationHan Wu, Hamdi Joudeh. 3321-3326 [doi]
• Joint Coding for Discrete Sources and Finite-State Noiseless ChannelsKen-ichi Iwata, Hirosuke Yamamoto. 3327-3332 [doi]
• Statistical QoS-Driven Beamforming and Trajectory Optimizations in UAV/IRS-Based 6G Wireless Networks in the Non-Asymptotic RegimeXi Zhang, Jingqing Wang, H. Vincent Poor. 3333-3338 [doi]
• A Unified Framework for Problems on Guessing, Source Coding, and Tasks PartitioningM. Ashok Kumar, Albert Sunny, Ashish Thakre, Ashisha Kumar, G. Dinesh Manohar. 3339-3344 [doi]
• Universal Randomized Guessing Subject to DistortionAsaf Cohen 0001, Neri Merhav. 3345-3350 [doi]
• Improved Bounds on the Moments of Guessing CostSuayb S. Arslan, Elif Haytaoglu. 3351-3356 [doi]