Table of Contents

• Covert Communication When Action-Dependent States is Available Non-Causally at the TransmitterHassan ZivariFard, Xiaodong Wang. 1-6 [doi]
• Feedback Increases the Capacity of Queues with Finite Support Service TimesK. R. Sahasranand, Aslan Tchamkerten. 7-12 [doi]
• The Identification Capacity of the Modulo-Additive Noise Channel with HelpAmos Lapidoth, Baohua Ni. 13-14 [doi]
• Optimal List Decoding from Noisy Entropy InequalityJan Hazla. 15-18 [doi]
• The Re-encoding Transform in Algebraic List Decoding of Algebraic Geometric CodesYunqi Wan, Jiongyue Xing, Yuliang Huang, Ting-Yi Wu, Bo Bai 0001, Gong Zhang. 19-24 [doi]
• Improved Singleton-type bounds for list-decoding and average-radius list-decodingHaojie Gu, Hong Lu, Jun Zhang. 25-29 [doi]
• A Version of Delsarte's Linear Program for Constrained SystemsV Arvind Rameshwar 0001, Navin Kashyap. 30-35 [doi]
• Comparing Poisson and Gaussian channelsAnzo Teh, Yury Polyanskiy. 36-41 [doi]
• Discrete Generalised Entropy Power Inequalities for Log-Concave Random VariablesLampros Gavalakis. 42-47 [doi]
• More Communication Does Not Result in Smaller Generalization Error in Federated LearningRomain Chor, Milad Sefidgaran, Abdellatif Zaidi. 48-53 [doi]
• Private Aggregation in Wireless Federated Learning with Heterogeneous ClustersMaximilian Egger, Christoph Hofmeister, Antonia Wachter-Zeh, Rawad Bitar. 54-59 [doi]
• Quadratic Functional Encryption for Secure Training in Vertical Federated LearningShuangyi Chen, Anuja Modi, Shweta Agrawal, Ashish Khisti. 60-65 [doi]
• Information Spectrum Converse for Minimum Entropy Couplings and Functional RepresentationsYanina Y. Shkel, Anuj Kumar Yadav. 66-71 [doi]
• On Properties of Doeblin CoefficientsAnuran Makur, Japneet Singh. 72-77 [doi]
• Entropy Functions on Two-Dimensional Faces of Polymatroidal Region of Degree FourShaocheng Liu, Qi Chen. 78-83 [doi]
• Fault-Tolerant Coding for Entanglement-Assisted CommunicationPaula Belzig, Matthias Christandl, Alexander Müller-Hermes. 84-89 [doi]
• A Simple and Tighter Derivation of Achievability for Classical-Quantum Channel CodingHao-Chung Cheng. 90-95 [doi]
• One-Shot Bounds on State Generation using Correlated Resources and Local EncodersIan George, Min-Hsiu Hsieh, Eric Chitambar. 96-101 [doi]
• Quickest Inference of Susceptible-Infected Cascades in Sparse NetworksAnirudh Sridhar, Tirza Routtenberg, H. Vincent Poor. 102-107 [doi]
• Communication-Efficient and Error-Free Gradecast with Optimal ResilienceJianjun Zhu, Fan Li 0012, Jinyuan Chen. 108-113 [doi]
• Streaming Erasure Codes over Multicast Relayed NetworksGustavo Kasper Facenda, Ashish Khisti, Wai-tian Tan, John G. Apostolopoulos. 114-119 [doi]
• Rateless Coding for Multi-Hop Broadcast Transmission in Wireless IoT NetworksJianlin Guo, Toshiaki Koike-Akino, Pu Wang 0004, Kieran Parsons, Philip V. Orlik, Jothi Prasanna Shanmuga Sundaram, Takenori Sumi, Yukimasa Nagai. 120-125 [doi]
• Multi-antenna Coded Caching with Combinatorial Multi-access NetworksElizabath Peter, B. Sundar Rajan. 126-131 [doi]
• Cache-Aided Communications in MISO Networks with Dynamic User Behavior: A Universal SolutionMilad Abolpour, Mohammad Javad Salehi, Antti Tölli. 132-137 [doi]
• Coded Caching Scheme for Two-Dimensional Caching-Aided Ultra-Dense NetworksMinquan Cheng, Jinwei Xu, Mingming Zhang 0003, Youlong Wu. 138-143 [doi]
• Coded Caching Schemes for Multi-Access Topologies via Combinatorial Design TheoryMinquan Cheng, Kai Wan, Petros Elia, Giuseppe Caire. 144-149 [doi]
• A Logarithmic Decomposition for InformationKeenan J. A. Down, Pedro A. M. Mediano. 150-155 [doi]
• Random linear estimation with rotationally-invariant designs: Asymptotics at high temperatureYufan Li, Zhou Fan, Subhabrata Sen, Yihong Wu 0001. 156-161 [doi]
• General Continuity Bounds for Quantum Relative EntropiesAndreas Bluhm, Ángela Capel, Paul Gondolf, Antonio Pérez-Hernández. 162-167 [doi]
• Personalized PCA for Federated Heterogeneous DataKaan Ozkara, Bruce Huang, Suhas N. Diggavi. 168-173 [doi]
• Collaborative Mean Estimation over Intermittently Connected Networks with Peer-To-Peer PrivacyRajarshi Saha, Mohamed Seif, Michal Yemini, Andrea J. Goldsmith, H. Vincent Poor. 174-179 [doi]
• Exploiting Feature Heterogeneity for Improved Generalization in Federated Multi-task LearningRenpu Liu, Jing Yang 0002, Cong Shen 0001. 180-185 [doi]
• Secure Aggregation for Clustered Federated LearningHasin Us Sami, Basak Güler. 186-191 [doi]
• Tight Analysis of Convex Splitting with Applications in Quantum Information TheoryHao-Chung Cheng, Li Gao. 192-197 [doi]
• Entanglement-Assisted Covert Communication via Qubit Depolarizing ChannelsElyakim Zlotnick, Boulat A. Bash, Uzi Pereg. 198-203 [doi]
• Chain Rules for Rényi Information CombiningChristoph Hirche, Xinyue Guan, Marco Tomamichel. 204-209 [doi]
• Characterizing Acceptance in Post-Selection One-Shot Quantum Hypothesis TestingSaurabh Kumar Gupta, Abhishek K. Gupta. 210-215 [doi]
• RECIPE: Rateless Erasure Codes Induced by Protocol-Based EncodingJingfan Meng, Ziheng Liu, Yiwei Wang, Jun (Jim) Xu. 216-221 [doi]
• The Optimal Rate of Second-Order Generalized-Covering CodesDor Elimelech, Moshe Schwartz 0001. 222-227 [doi]
• Computationally Efficient Codes for Adversarial Binary-Erasure ChannelsSijie Li, Prasad Krishnan, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate. 228-233 [doi]
• Preferential Pliable Index CodingDaniel Byrne, Lawrence Ong, Parastoo Sadeghi, Badri N. Vellambi. 234-239 [doi]
• A Lower and Upper Bound on the Epsilon-Uniform Common Randomness CapacityRami Ezzine, Moritz Wiese, Christian Deppe, Holger Boche. 240-245 [doi]
• Generic Decoding of Restricted ErrorsSebastian Bitzer, Alessio Pavoni, Violetta Weger, Paolo Santini, Marco Baldi, Antonia Wachter-Zeh. 246-251 [doi]
• Randomness Requirements for Three-Secret SharingHari Krishnan P. Anilkumar, Aayush Rajesh, Varun Narayanan, Manoj M. Prabhakaran, Vinod M. Prabhakaran. 252-257 [doi]
• On the Communication Complexity of Private Function Sharing and ComputationMaki Yoshida. 258-263 [doi]
• Fast Blind Recovery of Linear Block Codes over Noisy ChannelsPeng Wang, Yong Liang Guan 0001, Lipo Wang, Peng Cheng. 264-269 [doi]
• Bound on the ML Decoding Error Probability for Coded QAM Signals with ShapingIrina E. Bocharova, Boris D. Kudryashov, Sander Mikelsaar, Vitaly Skachek. 270-275 [doi]
• On ℤ2ℤ4ℤ8-Additive Hadamard CodesDipak Kumar Bhunia, Cristina Fernández-Córdoba, Mercè Villanueva. 276-281 [doi]
• A New Construction of Asymptotically Optimal Almost Affinely Disjoint SpacesTalha Arikan, Baran Düzgün, Kamil Otal, Ferruh Özbudak. 282-285 [doi]
• Minimal Derivative Descendants of Cyclic CodesQin Huang, Bin Zhang. 286-291 [doi]
• User-Centric Clustering Under Fairness Scheduling in Cell-Free Massive MIMOFabian Göttsch, Noboru Osawa, Takeo Ohseki, Yoshiaki Amano, Issei Kanno, Kosuke Yamazaki, Giuseppe Caire. 292-297 [doi]
• Spatial Modulation vs. Single-Antenna Transmission: When is Indexing Helpful?Bharath Shamasundar, Aria Nosratinia. 298-303 [doi]
• Achieving Massive MIMO Gains in FDD Downlink Systems Without CSI FeedbackDeokhwan Han, JeongHun Park, Namyoon Lee. 304-309 [doi]
• MIMO Radar Transmit Signal Optimization for Target Localization Exploiting Prior InformationChan Xu, Shuowen Zhang. 310-315 [doi]
• Achieving Maximum-likelihood Detection Performance with Square-order Complexity in Large Quasi-Symmetric MIMO SystemsJiuyu Liu, Yi Ma 0002, Rahim Tafazolli. 316-321 [doi]
• The Learning and Communication Complexity of Subsequence ContainmentMason DiCicco, Daniel Reichman 0001. 322-327 [doi]
• On the Validation of Gibbs Algorithms: Training Datasets, Test Datasets and their AggregationSamir M. Perlaza, Iñaki Esnaola, Gaetan Bisson, H. Vincent Poor. 328-333 [doi]
• Lower Bounds for Multiclass Classification with Overparameterized Linear ModelsDavid X. Wu, Anant Sahai. 334-339 [doi]
• Analysis of the Relative Entropy Asymmetry in the Regularization of Empirical Risk MinimizationFrancisco Daunas, Iñaki Esnaola, Samir M. Perlaza, H. Vincent Poor. 340-345 [doi]
• The Asymptotic Distribution of the Stochastic Mirror Descent Iterates in Linear ModelsK. Nithin Varma, Sahin Lale, Babak Hassibi. 346-351 [doi]
• Deletion Correcting Codes for Efficient DNA SynthesisJohan Chrisnata, Han Mao Kiah, Van Long Phuoc Pham. 352-357 [doi]
• Union Bound for Generalized Duplication Channels with DTW DecodingAdrian Vidal, Viduranga Bandara Wijekoon, Emanuele Viterbo. 358-363 [doi]
• Error-Correcting Codes for Nanopore SequencingAnisha Banerjee, Yonatan Yehezkeally, Antonia Wachter-Zeh, Eitan Yaakobi. 364-369 [doi]
• Cover Your Bases: How to Minimize the Sequencing Coverage in DNA Storage SystemsDaniella Bar-Lev, Omer Sabary, Ryan Gabrys, Eitan Yaakobi. 370-375 [doi]
• Homophonic Coding for the Noisy Nanopore Channel with Constrained Markov SourcesBrendon McBain, Emanuele Viterbo, James Saunderson. 376-381 [doi]
• Universal Compression of High Dimensional Gaussian Vectors with James-Stein shrinkageNarayana Prasad Santhanam, Mayank Bakshi. 382-387 [doi]
• Pointwise Maximal Leakage on General AlphabetsSara Saeidian, Giulia Cervia, Tobias J. Oechtering, Mikael Skoglund. 388-393 [doi]
• Universal Reverse Information Projections and Optimal E-statisticsPeter Harremoës, Tyron Lardy, Peter Grünwald. 394-399 [doi]
• Concentration without Independence via Information MeasuresAmedeo Roberto Esposito, Marco Mondelli. 400-405 [doi]
• Common Information DimensionOsama A. Hanna, Xinlin Li, Suhas N. Diggavi, Christina Fragouli. 406-411 [doi]
• Generalizations and Extensions to Lifting Constructions for Coded CachingAravind V. R, Pradeep Kiran Sarvepalli, Andrew Thangaraj. 412-417 [doi]
• Multi-access Coded Caching with Linear SubpacketizationKota Srinivas Reddy, Nikhil Karamchandani. 418-423 [doi]
• Demand Privacy in Hotplug Caching SystemsYinbin Ma, Daniela Tuninetti. 424-429 [doi]
• Coded Caching Design for Dynamic Networks with Reduced SubpacketizationsXianzhang Wu, Minquan Cheng, Li Chen 0013, Congduan Li. 430-435 [doi]
• Cache-Aided Distributed Storage SystemsZhengrui Li, Wai Ho Mow, Yunghsiang S. Han, Ting-Yi Wu. 436-441 [doi]
• Joint Identification and Sensing for Discrete Memoryless ChannelsWafa Labidi, Christian Deppe, Holger Boche. 442-447 [doi]
• Deterministic Identification for MC Binomial ChannelMohammad Javad Salariseddigh, Vahid Jamali, Holger Boche, Christian Deppe, Robert Schober. 448-453 [doi]
• Adaptive Greedy Rejection SamplingGergely Flamich, Lucas Theis. 454-459 [doi]
• Optimum Self-Random Number Generation Rate and Its Application to RDP FunctionRyo Nomura. 460-465 [doi]
• Soft Guessing Under Logarithmic LossHan Wu, Hamdi Joudeh. 466-471 [doi]
• Information-theoretically secure equality-testing protocol with dispute resolutionGo Kato, Mikio Fujiwara, Toyohiro Tsurumaru. 472-476 [doi]
• Differential cryptanalysis of Mod-2/Mod-3 constructions of binary weak PRFsThomas Johansson 0001, Willi Meier, Vu Nguyen. 477-482 [doi]
• On the (Im)possibility of Commitment over Gaussian Unfair Noisy ChannelsAmitalok J. Budkuley, Pranav Joshi, Manideep Mamindlapally, Anuj Kumar Yadav. 483-488 [doi]
• Improved Estimation of Key Enumeration with Applications to Solving LWEAlessandro Budroni, Erik Mårtensson. 495-500 [doi]
• Causal Inference - closed form expressions for worst case typical phase transitionsAgostino Capponi, Mihailo Stojnic. 501-506 [doi]
• Phase Transitions: Explicit relations for sparse vector and low rank recoveryAgostino Capponi, Mihailo Stojnic. 507-512 [doi]
• Efficiently Computing Sparse Fourier Transforms of q-ary FunctionsYigit Efe Erginbas, Justin Singh Kang, Amirali Aghazadeh, Kannan Ramchandran. 513-518 [doi]
• Generalized Linear Systems with OAMP/VAMP Receiver: Achievable Rate and Coding PrincipleLei Liu, Yuhao Chi, Ying Li, Zhaoyang Zhang. 519-524 [doi]
• Federated Neural Compression Under Heterogeneous DataEric Lei, Hamed Hassani, Shirin Saeedi Bidokhti. 525-530 [doi]
• Computation of Rate-Distortion-Perception Function under f-Divergence Perception ConstraintsGiuseppe Serra 0003, Photios A. Stavrou, Marios Kountouris. 531-536 [doi]
• Hyperparameter Learning of Bayesian Context Tree ModelsYuta Nakahara, Shota Saito, Koshi Shimada, Toshiyasu Matsushima. 537-542 [doi]
• Strategic QuantizationEmrah Akyol, Anju Anand. 543-548 [doi]
• On the Inevitability of the Rashomon EffectLucas Monteiro Paes, Rodrigo Cruz, Flávio P. Calmon, Mario Díaz. 549-554 [doi]
• Information Gain and Uniform Generalization Bounds for Neural Kernel ModelsSattar Vakili, Michael Bromberg, Jezabel R. Garcia, Da-shan Shiu, Alberto Bernacchia. 555-560 [doi]
• Representation Transfer Learning via Multiple Pre-trained models for Linear RegressionNavjot Singh, Suhas N. Diggavi. 561-566 [doi]
• On the Capacity of DNA LabelingDganit Hanania, Daniella Bar-Lev, Yevgeni Nogin, Yoav Shechtman, Eitan Yaakobi. 567-572 [doi]
• On the Design of Codes for DNA Computing: Secondary Structure Avoidance CodesTuan Thanh Nguyen, Kui Cai 0001, Han Mao Kiah, Duc Tu Dao, Kees A. Schouhamer Immink. 573-578 [doi]
• DNA-Correcting Codes: End-to-end Correction in DNA Storage SystemsAvital Boruchovsky, Daniella Bar-Lev, Eitan Yaakobi. 579-584 [doi]
• DNA Synthesis Using ShortmersMaria Abu Sini, Andreas Lenz 0001, Eitan Yaakobi. 585-590 [doi]
• A Novel Construction Technique for Some Classes of Quasi-Cyclic CodesAkram Saleh, M. Reza Soleymani. 591-595 [doi]
• Generalization Bounds for Neural Belief Propagation DecodersSudarshan Adiga, Xin Xiao, Ravi Tandon, Bane Vasic, Tamal Bose. 596-601 [doi]
• A Search-to-Decision Reduction for the Permutation Code Equivalence ProblemJean-François Biasse, Giacomo Micheli. 602-607 [doi]
• On Reliably Decodable Information Bits of Linear CodesYixin Wang, Xiao Ma 0001. 608-612 [doi]
• Belief-Propagation with Quantum Messages for Polar Codes on Classical-Quantum ChannelsAvijit Mandal, Sarah Brandsen, Henry D. Pfister. 613-618 [doi]
• CSS codes and QSCs from Whiteman's Generalized Cyclotomy of order fourVarsha Tiwari, Pramod Kumar Kewat. 619-624 [doi]
• A Worst-Case Analysis of a Renormalisation Decoder for Kitaev's Toric CodeWouter Rozendaal, Gilles Zémor. 625-629 [doi]
• On the Duality of Teleportation and Dense CodingEric Chitambar, Felix Leditzky. 630-635 [doi]
• Codes Over Absorption ChannelsZuo Ye, Ohad Elishco. 636-641 [doi]
• On Novel ISI-Reducing Channel Codes for Molecular Communication via DiffusionTamoghno Nath, Adrish Banerjee. 642-647 [doi]
• Unconditionally Secure Access Control EncryptionCheuk Ting Li, Sherman S. M. Chow. 648-653 [doi]
• Maximal Leakage of Masked Implementations Using Mrs. Gerber's Lemma for Min-EntropyJulien Béguinot, Yi Liu, Olivier Rioul, Wei Cheng 0003, Sylvain Guilley. 654-659 [doi]
• Majorizing Measures, Codes, and InformationYifeng Chu, Maxim Raginsky. 660-665 [doi]
• From Soft-Minoration to Information-Constrained Optimal Transport and Spiked Tensor ModelsJingbo Liu. 666-671 [doi]
• Sparse Complementary Pairs with Additional Aperiodic ZCZ PropertyCheng-Yu Pai, Zi Long Liu 0001, Chunlei Li 0001, Chao-Yu Chen. 672-677 [doi]
• The Asymptotics of Difference Systems of Sets for Synchronization and Phase DetectionYu Tsunoda, Yuichiro Fujiwara. 678-683 [doi]
• Maximal Length Constrained de Bruijn SequencesYeow Meng Chee, Tien Long Nguyen, Vinh Duc Tran, Van Khu Vu. 684-689 [doi]
• A New Family of Perfect Polyphase Sequences with Low Cross-CorrelationDan Zhang, Staal Amund Vinterbo. 690-694 [doi]
• Rate Distortion via Constrained Estimated Mutual Information MinimizationDor Tsur, Bashar Huleihel, Haim H. Permuter. 695-700 [doi]
• Learned Wyner-Ziv Compressors Recover BinningEzgi Özyilkan, Johannes Ballé, Elza Erkip. 701-706 [doi]
• Efficient Alternating Minimization Solvers for Wyner Multi-View Unsupervised LearningTeng-Hui Huang, Hesham El Gamal. 707-712 [doi]
• Compression with Unlabeled Graph Side InformationHesam Nikpey, Saswati Sarkar, Shirin Saeedi Bidokhti. 713-718 [doi]
• Optimal Compression of Unit Norm Vectors in the High Distortion RegimeHeng Zhu, Avishek Ghosh, Arya Mazumdar. 719-724 [doi]
• Private Set Union Based Approach to Enable Private Federated Submodel LearningZhusheng Wang, Sennur Ulukus. 725-730 [doi]
• Semantic Communication of Learnable ConceptsFrancesco Pase, Szymon Kobus, Deniz Gündüz, Michele Zorzi. 731-736 [doi]
• Differentially-Private Collaborative Online Personalized Mean EstimationYauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer. 737-742 [doi]
• A New Formulation of Lossy Quantum-Classical and Classical Source Coding based on a Posterior ChannelMohammad Aamir Sohail, Touheed Anwar Atif, S. Sandeep Pradhan. 743-748 [doi]
• Rate-Distortion Theory for Mixed StatesZahra Baghali Khanian, Kohdai Kuroiwa, Debbie Leung. 749-754 [doi]
• Entropic and Operational Characterizations of Dynamic Quantum ResourcesKaiyuan Ji, Eric Chitambar. 755-760 [doi]
• A novel chain rule for one-shot entropic quantities via operational methodsSayantan Chakraborty, Upendra Kapshikar. 761-766 [doi]
• Role of Bootstrap Averaging in Generalized Approximate Message PassingTakashi Takahashi. 767-772 [doi]
• Bayes-Optimal Estimation in Generalized Linear Models via Spatial CouplingPablo Pascual Cobo, Kuan Hsieh, Ramji Venkataramanan. 773-778 [doi]
• On The Stability of Approximate Message Passing with Independent Measurement EnsemblesDang Qua Nguyen, Taejoon Kim. 779-784 [doi]
• Capacity-Achieving Sparse Regression Codes via Vector Approximate Message PassingYizhou Xu, Yuhao Liu 0005, Shansuo Liang, Ting-Yi Wu, Bo Bai 0001, Jean Barbier, Tianqi Hou. 785-790 [doi]
• Fundamental Limits of Multiple Sequence Reconstruction from SubstringsKel Levick, Ilan Shomorony. 791-796 [doi]
• Data-Driven Bee Identification for DNA StrandsShubhransh Singhvi, Avital Boruchovsky, Han Mao Kiah, Eitan Yaakobi. 797-802 [doi]
• Substring Density Estimation from TracesKayvon Mazooji, Ilan Shomorony. 803-808 [doi]
• Bounds on Size of Homopolymer Free CodesKrishna Gopal Benerjee, Adrish Banerjee. 809-814 [doi]
• An Early-Termination Method for the Welch-Berlekamp AlgorithmChao Chen 0013, Yunghsiang S. Han, Nianqi Tang, Sian-Jheng Lin, Baoming Bai, Xiao Ma 0001. 815-819 [doi]
• Randomized Decoding of Linearized Reed-Solomon Codes Beyond the Unique Decoding RadiusThomas Jerkovits, Hannes Bartz, Antonia Wachter-Zeh. 820-825 [doi]
• An Efficient Reed-Solomon Erasure Code over Cantor-constructed Binary Extension Finite FieldsZhongwei Li, Yunghsiang Sam Han, Sian-Jheng Lin, Chao Chen 0013. 826-831 [doi]
• The Optimal Rate of MDS Variable GenerationYizhou Zhao, Hua Sun 0001. 832-837 [doi]
• A Novel Soft-In Soft-Out Decoding Algorithm for VT Codes on Multiple Received DNA StrandsZihui Yan, Guanjin Qu, Huaming Wu. 838-843 [doi]
• A Generalized Covering Algorithm for Chained CodesBen Langton, Netanel Raviv. 844-849 [doi]
• The size of Levenshtein ball with radius 2: Expectation and concentration boundLang He, Min Ye 0005. 850-855 [doi]
• Vector Quantization with Error Uniformly Distributed over an Arbitrary SetChih Wei Ling, Cheuk Ting Li. 856-861 [doi]
• Utility-Privacy Trade-Offs with Limited Leakage for EncoderNaruki Shinohara, Hideki Yagi. 862-867 [doi]
• Goal-oriented Compression with a Constrained DecoderSzymon Kobus, Tze-Yang Tung, Deniz Gündüz. 868-873 [doi]
• Zero-Error Distributed Function CompressionRuze Zhang, Xuan Guang. 874-879 [doi]
• Two-Dimensional Z-Complementary Array Quads with Low Column Sequence PMEPRsShibsankar Das, Adrish Banerjee, Udaya Parampalli. 880-885 [doi]
• On Constant-Weight Binary B2-SequencesJin Sima, Yun-Han Li, Ilan Shomorony, Olgica Milenkovic. 886-891 [doi]
• Zero-Correlation-Zone Sonar SequencesXiaoxiang Jin, Sangwon Chae, Hyunwoo Cho, Hyojeong Choi, Gangsan Kim, Hong-Yeop Song. 892-896 [doi]
• Optimal Uncorrelated Polyphase ZCZ Sequences over an Alphabet of Minimum sizeGangsan Kim, Hyojeong Choi, Dae-Kyeong Kim, Won Jun Kim, Xiaoxiang Jin, Hong-Yeop Song. 897-902 [doi]
• Exactly Tight Information-Theoretic Generalization Error Bound for the Quadratic Gaussian ProblemRuida Zhou, Chao Tian 0002, Tie Liu 0002. 903-908 [doi]
• On characterizing optimal Wasserstein GAN solutions for non-Gaussian dataYu-Jui Huang, Shih-Chun Lin, Yu-Chih Huang, Kuan-Hui Lyu, Hsin-Hua Shen, Wan-Yi Lin. 909-914 [doi]
• (αD, αG)-GANs: Addressing GAN Training Instabilities via Dual ObjectivesMonica Welfert, Kyle Otstot, Gowtham R. Kurri, Lalitha Sankar. 915-920 [doi]
• Breaking the Quadratic Communication Overhead of Secure Multi-Party Neural Network TrainingXingyu Lu, Basak Güler. 921-926 [doi]
• Improved Upper and Lower Bounds on the Capacity of the Binary Deletion ChannelIttai Rubinstein, Roni Con. 927-932 [doi]
• Permutation Sum-Capacity of Binary Adder Multiple-Access ChannelsWilliam Lu, Anuran Makur. 933-938 [doi]
• Competitive Channel-CapacityMichael Langberg, Oron Sabag. 939-944 [doi]
• Feedback Capacity of OU-Colored AWGN ChannelsJun Su, Guangyue Han, Shlomo Shamai Shitz. 945-950 [doi]
• Minimizing Moments of AoI for Both Active and Passive Users through Second-Order AnalysisSiqi Fan, Yuxin Zhong, I-Hong Hou, Clement Kam. 951-956 [doi]
• Age of Information With Non-Poisson Updates in Cache-Updating NetworksPriyanka Kaswan, Sennur Ulukus. 957-962 [doi]
• Reliable and Unreliable Sources in Age-Based GossipingPriyanka Kaswan, Sennur Ulukus. 963-968 [doi]
• Age of Information Under Frame Slotted ALOHA in Random Access NetworksZhiling Yue, Howard H. Yang, Meng Zhang, Nikolaos Pappas 0001. 969-974 [doi]
• Generalized resource theory of purity: one-shot purity distillation with local noisy operations and one way classical communicationSayantan Chakraborty 0002, Aditya Nema, Francesco Buscemi. 980-984 [doi]
• On the Relation between Quantum Data Hiding and Quantum Key DistributionMatthias Christandl, Mads Friis Frand-Madsen. 985-990 [doi]
• Optimal Second-Order Rates for Quantum Information DecouplingYu-Chen Shen, Li Gao, Hao-Chung Cheng. 991-996 [doi]
• Efficient Interpolation-Based Decoding of Reed-Solomon CodesWrya K. Kadir, Hsuan-Yin Lin, Eirik Rosnes. 997-1002 [doi]
• Repair of Reed-Solomon Codes in the Presence of Erroneous NodesStanislav Kruglik, Gaojun Luo, Wilton Kim, Shubhransh Singhvi, Han Mao Kiah, San Ling, Huaxiong Wang. 1003-1008 [doi]
• On the Structure of Higher Order MDS CodesHarshithanjani Athi, Rasagna Chigullapally, Prasad Krishnan, V. Lalitha 0001. 1009-1014 [doi]
• Reduced-Complexity Erasure Decoding of Low-Rate Reed-Solomon Codes Based on LCH-FFTChao Chen, Sian-Jheng Lin, Zhongwei Li, Suihua Cai, Yunghsiang S. Han, Bo Bai 0001. 1015-1019 [doi]
• Upper bounds on the Natarajan dimensions of some function classesYing Jin. 1020-1025 [doi]
• Principled OOD Detection via Multiple TestingAkshayaa Magesh, Venugopal V. Veeravalli, Anirban Roy, Susmit Jha. 1026-1031 [doi]
• Kernel Subspace and Feature ExtractionXiangxiang Xu 0001, Lizhong Zheng. 1032-1037 [doi]
• The Exact Determinant of a Specific Class of Sparse Positive Definite MatricesMehdi Molkaraie. 1038-1043 [doi]
• A Stochastic Rate-Distortion Approach to Supervised Learning SystemsAhmed Elshafiy, Mahmoud Namazi, Kenneth Rose. 1044-1049 [doi]
• Indirect Rate Distortion Functions with f-Separable Distortion CriterionPhotios A. Stavrou, Yanina Shkel, Marios Kountouris. 1050-1055 [doi]
• The Rate-Distortion-Perception Trade-off with Side InformationYassine Hamdi, Deniz Gündüz. 1056-1061 [doi]
• Fundamental Limits of Reference-Based Sequence ReorderingNir Weinberger, Ilan Shomorony. 1062-1067 [doi]
• Conditional Rate-Distortion-Perception Trade-OffXueyan Niu, Deniz Gündüz, Bo Bai 0001, Wei Han 0004. 1068-1073 [doi]
• Computation of Rate-Distortion-Perception Functions With Wasserstein BarycenterChunhui Chen 0005, Xueyan Niu, Wenhao Ye, Shitong Wu, Bo Bai 0001, Weichao Chen, Sian-Jheng Lin. 1074-1079 [doi]
• Soft decoding without soft demapping with ORBGRANDWei An, Muriel Médard, Ken R. Duffy. 1080-1084 [doi]
• Leveraging Noise Recycling in Soft Detection Decoding Using ORBGRANDZeynep Ece Kizilates, Arslan Riaz, Giacomo F. Coraluppi, Muriel Médard, Ken R. Duffy, Rabia Tugce Yazicigil. 1085-1089 [doi]
• Soft-input, soft-output joint data detection and GRAND: A performance and complexity analysisHadi Sarieddeen, Peihong Yuan, Muriel Médard, Ken R. Duffy. 1090-1095 [doi]
• Partial Ordered Statistics Decoding with Enhanced Error PatternsMarwan Jalaleddine, Huayi Zhou, Jiajie Li, Warren J. Gross. 1096-1100 [doi]
• Learning-augmented streaming codes for variable-size messages under partial burst lossesMichael Rudow, K. V. Rashmi. 1101-1106 [doi]
• Rate-Optimal Streaming Codes over Small Finite Fields for Burst/Random Erasure ChannelsTakayuki Nozaki. 1107-1111 [doi]
• Explicit Information-Debt-Optimal Streaming Codes With Small MemoryM. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, P. Vijay Kumar. 1112-1117 [doi]
• Near-Optimal Streaming Codes with Linear Field SizeVinayak Ramkumar, Shobhit Bhatnagar, P. Vijay Kumar. 1118-1123 [doi]
• Detailed Asymptotics of the Delay-Reliability Tradeoff of Random Linear Streaming CodesPin-Wen Su, Yu-Chih Huang, Shih-Chun Lin, I-Hsiang Wang, Chih-Chun Wang. 1124-1129 [doi]
• Locally Mitigating Sneak-Path Interference in Resistive Memory ArraysTuan Thanh Nguyen, Panpan Li, Kui Cai 0001, Kees A. Schouhamer Immink. 1130-1135 [doi]
• Construction and Decoding of Codes over the Dual-Parameter Barrier Error ModelYuval Ben-Hur, Yuval Cassuto. 1136-1141 [doi]
• Low-access repair of Reed-Solomon codes in rack-aware storageJiaojiao Wang, Zitan Chen. 1142-1147 [doi]
• Codes for Correcting t Limited-Magnitude Sticky DeletionsShuche Wang, Van Khu Vu, Vincent Y. F. Tan. 1148-1153 [doi]
• One-Bit Quadratic Compressed Sensing: From Sample Abundance to Linear FeasibilityArian Eamaz, Farhang Yeganegi, Deanna Needell, Mojtaba Soltanalian. 1154-1159 [doi]
• Compressed Error HARQ: Feedback Communication on Noise-Asymmetric ChannelsSravan Kumar Ankireddy, S. Ashwin Hebbar, Yihan Jiang, Pramod Viswanath, Hyeji Kim. 1160-1165 [doi]
• Matrix Completion over Finite Fields: Bounds and Belief Propagation AlgorithmsMahdi Soleymani, Qiang Liu, Hessam Mahdavifar, Laura Balzano. 1166-1171 [doi]
• 1-Bit Compressed Sensing with Local Sparsity PatternsSaikiran Bulusu, Venkata Gandikota, Pramod K. Varshney. 1172-1177 [doi]
• Mismatched estimation of non-symmetric rank-one matrices corrupted by structured noiseTeng Fu, Yuhao Liu 0005, Jean Barbier, Marco Mondelli, Shansuo Liang, Tianqi Hou. 1178-1183 [doi]
• Capacity of Finite-State Two-Way ChannelsJian-Jia Weng, Fady Alajaji, Tamás Linder. 1184-1189 [doi]
• A Framework for Information-Theoretic ConversesJonathan Ponniah, Liang-Liang Xie. 1190-1195 [doi]
• Capacity Bounds for the Poisson-Repeat ChannelMohammad Kazemi 0001, Tolga M. Duman. 1196-1201 [doi]
• Capacity Bounds for Identification With Effective SecrecyJohannes Rosenberger, Abdalla Ibrahim, Boulat A. Bash, Christian Deppe, Roberto Ferrara, Uzi Pereg. 1202-1207 [doi]
• On the Zero-Error Capacity with HelperAmos Lapidoth, Yiming Yan. 1208-1212 [doi]
• Optimal Strategies for Distributed Sampling and Detection of Poisson ProcessesVanlalruata Ralte, Amitalok J. Budkuley, Stefano Rini. 1213-1218 [doi]
• Success Probabilities of L2-norm Regularized Babai Detectors and MaximizationXiao-Wen Chang, Qincheng Lu, Yingzi Xu. 1219-1224 [doi]
• Hypothesis Testing for Adversarial Channels: Chernoff-Stein ExponentsEeshan Modak, Neha Sangwan, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran. 1225-1230 [doi]
• On Correlation Detection of Gaussian Databases via Local Decision MakingRan Tamir. 1231-1236 [doi]
• Detecting a Planted Bipartite GraphAsaf Rotenberg, Wasim Huleihel, Ofer Shayevitz. 1237-1242 [doi]
• Improved Field Size Bounds for Higher Order MDS CodesJoshua Brakensiek, Manik Dhar, Sivakanth Gopi. 1243-1248 [doi]
• Binary MDS Array Codes with Flexible Array Dimensions and Their Fast EncodingJingjie Lv, Weijun Fang, Bin Chen 0011, Shu-Tao Xia, Xiangyu Chen 0004. 1249-1254 [doi]
• Side Encoding for MDS Array CodesFuqiang Sun, Qin Huang, Jiayi Rui, Ting-Yi Wu, Yunghsiang Sam Han. 1255-1260 [doi]
• Some New Constructions of AFER-Optimal Binary Linear Block CodesAbdullah Murad, Wai Ho Mow. 1261-1265 [doi]
• Correcting One Error in Non-Binary Channels with FeedbackIlya Vorobyev, Vladimir S. Lebedev, Alexey V. Lebedev. 1266-1270 [doi]
• Binary convolutional codes with optimal column distancesZita Abreu, Julia Lieb, Joachim Rosenthal. 1271-1276 [doi]
• Tight Upper Bounds on the Error Probability of Spinal Codes over Fading ChannelsXiaomeng Chen, Aimin Li, Shaohua Wu. 1277-1282 [doi]
• A Direct Construction of Optimal Symmetrical Z-Complementary Code Sets of Prime Power LengthsPraveen Kumar, Sudhan Majhi, Subhabrata Paul. 1283-1287 [doi]
• A New and Direct Construction of Asymptotically Optimal Multiple Sets of Multiple Zero-Correlation Zone Sequence SetsNishant Kumar, Sudhan Majhi, Subhabrata Paul. 1288-1293 [doi]
• Gapped Binomial Complexities in SequencesMichel Rigo, Manon Stipulanti, Markus A. Whiteland. 1294-1299 [doi]
• Levenshtein's Reconstruction Problem with Different Error PatternsVille Junnila, Tero Laihonen, Tuomo Lehtilä. 1300-1305 [doi]
• Thompson Sampling Regret Bounds for Contextual Bandits with sub-Gaussian rewardsAmaury Gouverneur, Borja Rodríguez Gálvez, Tobias J. Oechtering, Mikael Skoglund. 1306-1311 [doi]
• Multi-Arm Bandits over Action Erasure ChannelsOsama A. Hanna, Merve Karakas, Lin F. Yang, Christina Fragouli. 1312-1317 [doi]
• Distributed Stochastic Bandits with Corrupted and Defective Input CommandsMeng-Che Chang, Matthieu R. Bloch. 1318-1323 [doi]
• Secure Distributed Storage: Optimal Trade-Off Between Storage Rate and Privacy LeakageRémi A. Chou, Jörg Kliewer. 1324-1329 [doi]
• Repairing Reed-Solomon Codes over Prime Fields via Exponential SumsRoni Con, Noah Shutty, Itzhak Tamo, Mary Wootters. 1330-1335 [doi]
• Fast and Straggler-Tolerant Distributed SGD with Reduced Computation LoadMaximilian Egger, Serge Kas Hanna, Rawad Bitar. 1336-1341 [doi]
• PIR array codes: the optimality of Blackburn-Etzion constructionChen Wang, YiWei Zhang. 1342-1347 [doi]
• t-PIR Schemes with Flexible Parameters via Star Products of Berman CodesSrikar Kale, Keshav Agarwal, Prasad Krishnan. 1348-1353 [doi]
• Two-Server Private Information Retrieval with Optimized Download Rate and Result VerificationStanislav Kruglik, Son Hoang Dau, Han Mao Kiah, Huaxiong Wang. 1354-1359 [doi]
• Optimal Learning Rate of Sending One Bit Over Arbitrary Acyclic BISO-Channel NetworksChih-Chun Wang, David J. Love. 1360-1365 [doi]
• Tight Exponential Strong Converse for Source Coding Problem with Encoded Side InformationDaisuke Takeuchi, Shun Watanabe. 1366-1371 [doi]
• Computation of Marton's Error Exponent for Discrete Memoryless SourcesYutaka Jitsumatsu. 1372-1377 [doi]
• Sequential Hypothesis Testing for Markov ChainsGreg Fields, Tara Javidi. 1378-1383 [doi]
• Bandwidth-Constrained Distributed Quickest Change Detection in Heterogeneous Sensor Networks: Anonymous vs Non-Anonymous SettingsWen-Hsuan Li, Yu-Chih Huang. 1384-1389 [doi]
• Testing for the Bradley-Terry-Luce ModelAnuran Makur, Japneet Singh. 1390-1395 [doi]
• Near-Optimal Degree Testing for Bayes NetsVipul Arora 0002, Arnab Bhattacharyya 0001, Clément L. Canonne, Joy Qiping Yang. 1396-1401 [doi]
• MacWilliams-Like Identities for Certain Vectorial Bent FunctionsJiaxin Wang, Yadi Wei, Zhe Sun, Fang-Wei Fu 0001. 1402-1407 [doi]
• On the Implementation of Boolean Functions on Content-Addressable MemoriesRon M. Roth. 1408-1413 [doi]
• Constructing Quadratic and Cubic Negabent Functions over Finite FieldsFei Guo, Zilong Wang 0001, Guang Gong. 1414-1418 [doi]
• A Computational Design of Unimodular Complementary and Z-complementary SetsZhi Gu, Avik Ranjan Adhikary, Zhengchun Zhou, Meng Yang. 1419-1424 [doi]
• kDaisaburo Yoshioka. 1425-1429 [doi]
• Broadcast Channel SimulationMichael X. Cao, Navneeth Ramakrishnan, Mario Berta, Marco Tomamichel. 1430-1435 [doi]
• On the Limits of HARQ Prediction for Short Deterministic Codes with Error Detection in Memoryless ChannelsBaris Göktepe, Cornelius Hellge, Tatiana Rykova, Thomas Schierl, Slawomir Stanczak. 1436-1441 [doi]
• Timid/Bold Coding for Channels with Cost ConstraintsAdeel Mahmood, Aaron B. Wagner. 1442-1447 [doi]
• Variable-Length Codes with Bursty FeedbackJames Y. Chen, Recep Can Yavas, Victoria Kostina. 1448-1453 [doi]
• Reward Teaching for Federated Multi-armed BanditsChengshuai Shi, Wei Xiong 0015, Cong Shen 0001, Jing Yang 0002. 1454-1459 [doi]
• On High-dimensional and Low-rank Tensor BanditsChengshuai Shi, Cong Shen 0001, Nicholas D. Sidiropoulos. 1460-1465 [doi]
• Best Arm Identification in Bandits with Limited Precision SamplingKota Srinivas Reddy, P. N. Karthik, Nikhil Karamchandani, Jayakrishnan Nair 0001. 1466-1471 [doi]
• Risk-Averse Combinatorial Semi-BanditsRanga Shaarad Ayyagari, Ambedkar Dukkipati. 1472-1477 [doi]
• The Cardinality Bound on the Information Bottleneck Representations is TightEtam Benger, Shahab Asoodeh, Jun Chen. 1478-1483 [doi]
• Distributed Information Bottleneck for a Primitive Gaussian Diamond MIMO ChannelYi Song, Hao Xu 0003, Kai-Kit Wong, Giuseppe Caire, Shlomo Shamai Shitz. 1484-1489 [doi]
• Information Bottleneck Revisited: Posterior Probability Perspective with Optimal TransportLingyi Chen, Shitong Wu, Wenhao Ye, Huihui Wu, Hao Wu 0060, Wenyi Zhang 0001, Bo Bai 0001, Yining Sun. 1490-1495 [doi]
• Task-aware Network Coding over Butterfly NetworkJiangnan Cheng, Sandeep Chinchali, Ao Tang. 1496-1501 [doi]
• Perfect vs. Independent Feedback in the Multiple-Access ChannelOliver Kosut, Michelle Effros, Michael Langberg. 1502-1507 [doi]
• Relay Channels with Unreliable HelpersYossef Steinberg. 1508-1513 [doi]
• Gaussian Broadcast Channels with Bidirectional Conferencing Decoders and Correlated NoisesReza Khosravi-Farsani, Wei Yu 0001. 1514-1519 [doi]
• Private Read Update Write (PRUW) With Heterogeneous DatabasesSajani Vithana, Sennur Ulukus. 1520-1525 [doi]
• Single-Server Pliable Private Information Retrieval With Side InformationSarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes. 1526-1531 [doi]
• k-server Byzantine-Resistant PIR Scheme with Optimal Download Rate and Optimal File SizeStanislav Kruglik, Son Hoang Dau, Han Mao Kiah, Huaxiong Wang. 1532-1537 [doi]
• Private Information Retrieval When Private Noisy Side Information is AvailableHassan ZivariFard, Rémi A. Chou. 1538-1543 [doi]
• Density Devolution for Ordering Synthetic ChannelsHsin-Po Wang 0001, Chi-Wei Chin. 1544-1549 [doi]
• Optimal Self-Dual Inequalities to Order Polarized BECsTing-Chun Lin, Hsin-Po Wang 0001. 1550-1555 [doi]
• How Many Matrices Should I Prepare To Polarize Channels Optimally Fast?Hsin-Po Wang 0001, Venkatesan Guruswami. 1556-1561 [doi]
• Fast Methods for Ranking Synthetic BECsHsin-Po Wang 0001, Vlad-Florin Dragoi. 1562-1567 [doi]
• Achievable Error Exponents for Almost Fixed-Length M-ary ClassificationJun Diao, Lin Zhou 0002, Lin Bai 0001. 1568-1573 [doi]
• Stability Analysis of the Gaussian Han-Kobayashi Region for Z-Interference ChannelsJingbo Liu. 1574-1579 [doi]
• Achievable Resolution Limits of Noisy Adaptive 20 Questions Estimation for Multiple TargetsChunsong Sun, Lin Zhou. 1580-1585 [doi]
• X-Secure T-Private Linear Computation With Graph Based Replicated StorageHaobo Jia, Zhuqing Jia. 1586-1591 [doi]
• The Capacity of Oblivious Transfer with Replicated Databases and Binary Erasure Multiple Access ChannelTianyou Pei, Wei Kang 0002, Nan Liu 0001. 1592-1596 [doi]
• Approximate Private Inference in Quantized ModelsZirui Deng, Netanel Raviv. 1597-1602 [doi]
• The Capacity of 4-Star-Graph PIRYuhang Yao, Syed Ali Jafar. 1603-1608 [doi]
• Quickly-Decodable Group Testing with Fewer Tests: Price-Scarlett's Nonadaptive Splitting with Explicit ScalarsHsin-Po Wang 0001, Ryan Gabrys, Venkatesan Guruswami. 1609-1614 [doi]
• Probabilistic Group Testing in Distributed Computing with Attacked WorkersSarthak Jain, Martina Cardone, Soheil Mohajer. 1615-1620 [doi]
• Noisy Adaptive Group Testing for Community-Oriented ModelsSurin Ahn, Wei-Ning Chen, Ayfer Özgür. 1621-1626 [doi]
• Constructions for Nonadaptive Tropical Group TestingNicholas Kwan, Lele Wang. 1627-1632 [doi]
• Third-Party Private Set IntersectionFoo Yee Yeo, Jason H. M. Ying. 1633-1638 [doi]
• Mean Estimation Under Heterogeneous Privacy: Some Privacy Can Be FreeSyomantak Chaudhuri, Thomas A. Courtade. 1639-1644 [doi]
• Block Design-Based Local Differential Privacy MechanismsHyun Young Park, Seung-Hyun Nam, Si-Hyeon Lee. 1645-1650 [doi]
• The Privacy-Utility Tradeoff in Rank-Preserving Dataset ObfuscationMahshad Shariatnasab, Farhad Shirani 0001, S. Sitharama Iyengar. 1651-1656 [doi]
• Coding for IBLTs with Listing GuaranteesDaniella Bar-Lev, Avi Mizrahi, Tuvi Etzion, Ori Rottenstreich, Eitan Yaakobi. 1657-1662 [doi]
• On the Information Capacity of Nearest Neighbor RepresentationsKordag Mehmet Kilic, Jin Sima, Jehoshua Bruck. 1663-1668 [doi]
• Reaching Consensus in Dense Erdős-Rényi GraphsRan Tamir. 1669-1674 [doi]
• Arithmetic Complexity of Frequency-Domain Representations of Time-Computable SignalsHolger Boche, Yannik N. Böck. 1675-1680 [doi]
• Distributed Lossy Computation with Structured Codes: From Discrete to Continuous SourcesAdriano Pastore, Sung-Hoon Lim, Chen Feng 0001, Bobak Nazer, Michael Gastpar. 1681-1686 [doi]
• On Mismatched Oblivious RelayingMichael Dikshtein, Nir Weinberger, Shlomo Shamai Shitz. 1687-1692 [doi]
• Shared Information for the Cliqueylon GraphSagnik Bhattacharya, Prakash Narayan. 1693-1698 [doi]
• Deterministic Identification Over Multiple-Access ChannelsJohannes Rosenberger, Abdalla Ibrahim, Christian Deppe, Roberto Ferrara. 1699-1704 [doi]
• Improved Belief Propagation Decoders for Polar CodesCheng-Yu Kao, Chung-Hsuan Wang, Chi-Chao Chao. 1705-1710 [doi]
• Stronger Polarization for the Deletion ChannelDar Arava, Ido Tal. 1711-1716 [doi]
• Efficient Evaluation of Polarization Behavior for Large KernelsAnatolii Ashikhmin, Peter Trifonov. 1717-1722 [doi]
• New Search for the Polarization-Adjusted Convolutional Codes with Respect to the AFER-Optimality CriterionMurad Abdullah, Wai Ho Mow. 1723-1728 [doi]
• HerA Scheme: Secure Distributed Matrix Multiplication via Hermitian CodesRoberto Assis Machado, Gretchen L. Matthews, Welington Santos. 1729-1734 [doi]
• Transaction Confirmation in Coded BlockchainIlan Tennenhouse, Netanel Raviv. 1735-1740 [doi]
• An Optimal Coded Matrix Multiplication Scheme for Leveraging Partial StragglersLiyuan Song, Li Tang, Yi Wu. 1741-1746 [doi]
• Optimal (2, δ) Locally Repairable Codes via Punctured Simplex CodesDong Wang, Weijun Fang, Sihuang Hu. 1747-1752 [doi]
• A construction of Maximally Recoverable LRCs for small number of local groupsManik Dhar, Sivakanth Gopi. 1753-1757 [doi]
• Some Constructions of Perfect and k-optimal (r,δ)-LRCsHengfeng Jin, Yao Tian, Fang-Wei Fu 0001. 1758-1763 [doi]
• Codes on Matrices and Some ApplicationsSmarajit Das. 1764-1769 [doi]
• Building Hard Problems by Combining Easy OnesRiddhi Ghosal, Amit Sahai. 1770-1775 [doi]
• Pointwise Sliced Mutual Information for Neural Network ExplainabilityShelvia Wongso, Rohan Ghosh, Mehul Motani. 1776-1781 [doi]
• Variable-Length Insertion-Based Noisy SortingZiao Wang, Nadim Ghaddar, Banghua Zhu, Lele Wang 0001. 1782-1787 [doi]
• On the Optimal Bounds for Noisy ComputingBanghua Zhu, Ziao Wang, Nadim Ghaddar, Jiantao Jiao, Lele Wang 0001. 1788-1793 [doi]
• Strong Data Processing Inequalities for Locally Differentially Private MechanismsBehnoosh Zamanlooy, Shahab Asoodeh. 1794-1799 [doi]
• Data Compression with Private Local DecodabilityVenkat Chandar, Aslan Tchamkerten, Shashank Vatedka. 1800-1805 [doi]
• Total Variation with Differential Privacy: Tighter Composition and Asymptotic BoundsElena Ghazi, Ibrahim Issa. 1806-1811 [doi]
• On the Privacy of Social Networks with Personal Privacy ChoicesCarolina Naim, Fangwei Ye, Salim El Rouayheb. 1812-1817 [doi]
• Strong Converses for Memoryless Bi-Static ISACMehrasa Ahmadipour, Michèle A. Wigger, Shlomo Shamai. 1818-1823 [doi]
• A Proof of the Noiseberg Conjecture for the Gaussian Z-Interference ChannelMax H. M. Costa, Amin Gohari, Chandra Nair, David Ng. 1824-1829 [doi]
• CFMA for Gaussian MIMO Multiple Access ChannelsLanwei Zhang, Jamie S. Evans, Jingge Zhu. 1830-1835 [doi]
• Capacity-Distortion Tradeoff of Noisy Gaussian State AmplificationYinfei Xu, Tao Guo, Daming Cao, Wei Xu 0001. 1836-1841 [doi]
• A Diagonal Splitting Algorithm for Adaptive Group TestingChaorui Yao, Pavlos Nikolopoulos, Christina Fragouli. 1842-1847 [doi]
• Finding a Burst of Positives via Nonadaptive Semiquantitative Group TestingYun-Han Li, Ryan Gabrys, Jin Sima, Ilan Shomorony, Olgica Milenkovic. 1848-1853 [doi]
• Non-adaptive Quantitative Group Testing via Plotkin-Type ConstructionsMahdi Soleymani, Hessam Mahdavifar, Tara Javidi. 1854-1859 [doi]
• Low-Density Parity-Check Codes and Spatial Coupling for Quantitative Group TestingMgeni Makambi Mashauri, Alexandre Graell i Amat, Michael Lentmaier. 1860-1865 [doi]
• On Semi-Supervised Estimation of DistributionsH. S. Melihcan Erol, Erixhen Sula, Lizhong Zheng. 1866-1871 [doi]
• 1 Estimation in Gaussian Noise: On the Optimality of Linear EstimatorsLeighton Pate Barnes, Alex Dytso, H. Vincent Poor. 1872-1877 [doi]
• An Information Theoretic Approach for Collaborative Distributed Parameter EstimationXinyi Tong, Tianren Peng, Shao-Lun Huang. 1878-1883 [doi]
• Entropy Rate Estimation for Markov Chains with Continuous DistributionsPuning Zhao, Lifeng Lai. 1884-1889 [doi]
• Data-Driven Polar Codes for Unknown Channels With and Without MemoryZiv Aharoni, Bashar Huleihel, Henry D. Pfister, Haim H. Permuter. 1890-1895 [doi]
• Source Polarization-Adjusted Convolutional CodesTyler Kann, Shrinivas Kudekar, Matthieu R. Bloch. 1896-1901 [doi]
• Capacity Achieving Codes for an Erasure Queue-channelJaswanthi Mandalapu, Avhishek Chatterjee, Krishna P. Jagannathan, Andrew Thangaraj. 1902-1907 [doi]
• Modified PAC CodesZuoxin Cai, Li Chen, Wenxin Liu, Huazi Zhang. 1908-1913 [doi]
• Exact variances of von Neumann entropy over fermionic Gaussian statesYouyi Huang, Lu Wei 0001. 1914-1918 [doi]
• Sample-Optimal Quantum Process Tomography with non-adaptive Incoherent MeasurementsAadil Oufkir. 1919-1924 [doi]
• Rate-limited Quantum-to-Classical Optimal Transport: A Lossy Source Coding PerspectiveHafez M. Garmaroudi, S. Sandeep Pradhan, Jun Chen. 1925-1930 [doi]
• Quantum secret sharing and tripartite informationGuangkuo Liu, Peixue Wu, Haneul Kim, Marius Junge. 1931-1936 [doi]
• Federated Learning with Local Fairness ConstraintsYuchen Zeng, Hongxu Chen, Kangwook Lee 0001. 1937-1942 [doi]
• Wireless Coded Distributed Learning with Gaussian-based Local Differential PrivacyYilei Xue, Xi Lin 0003, Jun Wu, Jianhua Li. 1943-1948 [doi]
• Sample-and-Forward: Communication-Efficient Control of the False Discovery Rate in NetworksMehrdad Pournaderi, Yu Xiang 0004. 1949-1954 [doi]
• Differentially Private Online Federated Learning With Personalization and FairnessOlusola Tolulope Odeyomi. 1955-1960 [doi]
• Secret Sharing Over a Gaussian Broadcast Channel: Optimal Coding Scheme Design and Deep Learning Approach at Short BlocklengthRumia Sultana, Vidhi Rana, Rémi A. Chou. 1961-1966 [doi]
• Access-Redundancy Tradeoffs in Quantized Linear ComputationsVinayak Ramkumar, Netanel Raviv, Itzhak Tamo. 1967-1972 [doi]
• Explicit Low-Bandwidth Evaluation Schemes for Weighted Sums of Reed-Solomon-Coded SymbolsHan Mao Kiah, Wilton Kim, Stanislav Kruglik, San Ling, Huaxiong Wang. 1973-1978 [doi]
• Distributed Matrix Computations with Low-weight EncodingsAnindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton. 1979-1984 [doi]
• Trading Communication for Computation in Byzantine-Resilient Gradient CodingChristoph Hofmeister, Luis Maßny, Eitan Yaakobi, Rawad Bitar. 1985-1990 [doi]
• Order-Optimal Joint Transmission and Identification in Massive Multi-User MIMO via Group TestingGeorge Vershinin, Asaf Cohen 0001, Omer Gurewitz. 1991-1996 [doi]
• Upper Bounds for the Stability Regions of Coded Poisson ReceiversCheng-En Lee, Hsiao-Wen Yu, Cheng-Shang Chang, Duan-Shin Lee. 1997-2002 [doi]
• Unsourced Massive Access-Based Digital Over-the-Air Computation for Efficient Federated Edge LearningLi Qiao, Zhen Gao 0001, Zhongxiang Li, Deniz Gündüz. 2003-2008 [doi]
• An Asynchronous Massive Access Scheme with Dynamic Range ConsiderationsLina Liu, Dongning Guo. 2009-2014 [doi]
• Coded Downlink Massive Random AccessRyan Song, Kareem M. Attiah, Wei Yu 0001. 2015-2020 [doi]
• On a Class of Optimal Locally Recoverable Codes with AvailabilityClifton Garrison, Giacomo Micheli, Logan Nott, Vincenzo Pallozzi Lavorante, Phillip Waitkevich. 2021-2026 [doi]
• Designing Compact Repair Groups for Reed-Solomon CodesDinh Thi Xinh, Serdar Boztas, Son Hoang Dau, Emanuele Viterbo. 2027-2032 [doi]
• Locally Repairable Convertible Codes: Erasure Codes for Efficient Repair and ConversionFrancisco Maturana, K. V. Rashmi. 2033-2038 [doi]
• On Extremal Rates of Storage over GraphsZhou Li 0003, Hua Sun 0001. 2039-2044 [doi]
• New Constructions of Binary MDS Array Codes with Optimal Repair BandwidthLei Li, Chenhao Ying, Liang Chen, Yuanyuan Dong, Yuan Luo 0003. 2045-2050 [doi]
• Parallel Monte Carlo Markov Chain Decoding of Linear CodesJiun-Ting Huang, Young-Han Kim 0001. 2051-2056 [doi]
• Achieving Capacity on Non-Binary Channels with Generalized Reed-Muller CodesGalen Reeves, Henry D. Pfister. 2057-2062 [doi]
• *Luca G. Tallini, Bella Bose. 2063-2068 [doi]
• Fast Encoding of Hermitian Codes Based on Lin-Chung-Han Fast Fourier TransformSuihua Cai, Chao Chen, Yunqi Wan, Xiao Ma 0001. 2069-2074 [doi]
• Systematic Encoding of Elliptic Codes with Dynamic Information SetsJianguo Zhao, Li Chen. 2075-2080 [doi]
• Rectangular Rotational Invariant Estimator for General Additive Noise MatricesFarzad Pourkamali, Nicolas Macris. 2081-2086 [doi]
• Functional Properties of the Ziv-Zakai bound with Arbitrary InputsMin-Oh Jeong, Alex Dytso, Martina Cardone. 2087-2092 [doi]
• Concentration Bounds for Discrete Distribution Estimation in KL DivergenceClément L. Canonne, Ziteng Sun, Ananda Theertha Suresh. 2093-2098 [doi]
• Robust High-Dimensional Linear Discriminant Analysis under Training Data ContaminationYuyang Shi, Aditya Deshmukh, Yajun Mei, Venugopal V. Veeravalli. 2099-2104 [doi]
• Minimax Risk Upper Bounds Based on Shell Analysis of a Quantized Maximum Likelihood EstimatorNoam Gavish, Or Ordentlich. 2105-2110 [doi]
• The Mutual Information In The Vicinity of Capacity-Achieving Input DistributionsHao-Chung Cheng, Baris Nakiboglu. 2111-2116 [doi]
• Efficient Evaluation of the Probability of Error of Random Coding EnsemblesIoannis Papoutsidakis, Angela Doufexi, Robert J. Piechocki. 2117-2122 [doi]
• Second-Order Performance of Early Decoding with Shell Codes in Gaussian Broadcast ChannelsMarcel Mross, Pin-Hsun Lin, Eduard A. Jorswieck. 2123-2128 [doi]
• Learning Channel Codes from Data: Performance Guarantees in the Finite Blocklength RegimeNeil Irwin Bernardo, Jingge Zhu, Jamie S. Evans. 2129-2134 [doi]
• Characterization of All Optimal Finite-length Codes of Size Four for Binary Symmetric ChannelsYanyan Dong, Shenghao Yang 0001. 2135-2140 [doi]
• Weight and Trapping Set Distributions for Non-Binary Regular Low-Density Parity-Check Code EnsemblesEmna Ben Yacoub. 2141-2146 [doi]
• ABS+ Polar Codes: Exploiting More Linear Transforms on Adjacent BitsGuodong Li, Min Ye 0005, Sihuang Hu. 2147-2152 [doi]
• On the Weight Spectrum Improvement of Pre-transformed Reed-Muller Codes and Polar CodesYuan Li, Zicheng Ye, Huazi Zhang, Jun Wang 0062, Guiying Yan, Zhiming Ma. 2153-2158 [doi]
• Blahut-Arimoto Algorithm for Marton's Inner BoundYanqing Liu, Yanan Dou, Yanlin Geng. 2159-2164 [doi]
• Delay-Calibrated User Activity Detection for Asynchronous Massive Random AccessZhichao Shao, Xiaojun Yuan 0002. 2165-2170 [doi]
• On expanding the toolkit of locality-based coded computation to the coordinates of inputsMichael Rudow, Venkatesan Guruswami, K. V. Rashmi. 2171-2176 [doi]
• Compression-Informed Coded ComputingMichael Rudow, Neophytos Charalambides, Alfred O. Hero III, K. V. Rashmi. 2177-2182 [doi]
• Coded matrix computation with gradient codingKyungrak Son, Aditya Ramamoorthy. 2183-2188 [doi]
• Differentially Private Coded ComputingHsuan-Po Liu, Mahdi Soleymani, Hessam Mahdavifar. 2189-2194 [doi]
• Optimal Multidimensional Differentially Private Mechanisms in the Large-Composition RegimeWael Alghamdi, Shahab Asoodeh, Flávio P. Calmon, Juan Felipe Gómez, Oliver Kosut, Lalitha Sankar. 2195-2200 [doi]
• Schrödinger Mechanisms: Optimal Differential Privacy Mechanisms for Small SensitivityWael Alghamdi, Shahab Asoodeh, Flávio P. Calmon, Juan Felipe Gómez, Oliver Kosut, Lalitha Sankar. 2201-2206 [doi]
• Differentially Private Secure Multiplication: Hiding Information in the Rubble of NoiseViveck R. Cadambe, Haewon Jeong, Flávio P. Calmon. 2207-2212 [doi]
• On the Gibbs Exponential Mechanism and Private Synthetic Data GenerationAmir-Reza Asadi, Po-Ling Loh. 2213-2218 [doi]
• Theoretical analysis of achievable rates for channel-polarized multilevel coding under binary-input AWGN channelsTakeshi Kakizaki, Masanori Nakamura, Fukutaro Hamaoka, Yoshiaki Kisaka. 2219-2224 [doi]
• Approximation Methods for Enumerating Sequences for Probabilistic Amplitude ShapingWei Liu, Tom Richardson, Hao Xu, Changlong Xu, Liangming Wu, Ori Shental. 2225-2230 [doi]
• On the Sum-Capacity of Two-User Optical Intensity Multiple Access ChannelsLongguang Li, Ru-Han Chen, Jing Zhou 0001. 2231-2235 [doi]
• Universal Prediction of m-ary SequencesAlankrita Bhatt. 2236-2241 [doi]
• Control of a Multiplicative Observation Noise System: MAP-based Achievable StrategyMoses Won, Gireeja Ranade. 2242-2247 [doi]
• Maximal-Capacity Discrete Memoryless Channel IdentificationMaximilian Egger, Rawad Bitar, Antonia Wachter-Zeh, Deniz Gündüz, Nir Weinberger. 2248-2253 [doi]
• 2×2 Zero-Sum Games with Commitments and Noisy ObservationsKe Sun 0014, Samir M. Perlaza, Alain Jean-Marie. 2254-2259 [doi]
• Updating Top-k Dominate Individuals with Incomplete Data AdditionJimmy Ming-Tai Wu, Ke Wang, Huizhen Yan, Chao-Chun Chen, Pei-Wei Chen, Jerry Chun-Wei Lin. 2260-2265 [doi]
• 3GD-MV: Sparse-SignSGD with Majority Vote for Communication-Efficient Distributed LearningChanho Park, Namyoon Lee. 2266-2271 [doi]
• Personalized Privacy-Preserving Distributed Learning on Heterogeneous DataAditya Pradeep, Michael Gastpar. 2272-2277 [doi]
• Perturbation-Resilient Sets for Dynamic Service BalancingJin Sima, Chao Pan 0003, Olgica Milenkovic. 2278-2283 [doi]
• Node Repair for Adversarial Graphical NetworksAdway Patra, Alexander Barg. 2284-2289 [doi]
• Weighted Graph Coloring for Quantized ComputingDerya Malak. 2290-2295 [doi]
• Fundamental Limits of Distributed Linearly Separable Computation under Cyclic AssignmentWenbo Huang, Kai Wan, Hua Sun 0001, Mingyue Ji, Robert Caiming Qiu, Giuseppe Caire. 2296-2301 [doi]
• Successive Refinement of Shannon Cipher System Under Maximal LeakageZhuangfei Wu, Lin Bai 0001, Lin Zhou 0002. 2302-2307 [doi]
• Subfield Attack on NTRU by using symmetric function mapShixin Tian, Zhili Dong, Kunpeng Wang, Chang Lv. 2308-2313 [doi]
• A One-way Secret Key Agreement with Security Against Active AdversariesSomnath Panja, Shaoquan Jiang, Reihaneh Safavi-Naini. 2314-2319 [doi]
• An Upper Bound on Secret Key Rates for General Multiterminal Wiretap ChannelsAmin Gohari, Gerhard Kramer. 2320-2325 [doi]
• Deterministic-Random Tradeoff of Integrated Sensing and Communications in Gaussian Channels: A Rate-Distortion PerspectiveFan Liu 0005, Yifeng Xiong, Kai Wan, Tony Xiao Han, Giuseppe Caire. 2326-2331 [doi]
• Modeling Statistical Delay, Error-Rate, and Joint-Delay/Error-Rate QoS-Exponents Over M-MIMO Mobile Wireless Networks Using FBCXi Zhang, Jingqing Wang, H. Vincent Poor. 2332-2337 [doi]
• Capacity of Noncoherent FSK with Doppler Frequency UncertaintyJesús Gómez-Vilardebó, Xavier Mestre, Mònica Navarro, Jorge Quintanilla. 2338-2343 [doi]
• RIS-Aided MIMO Systems with Simultaneous Active and Passive Information Transfer: Iterative Decoding and Evolution AnalysisWenjun Jiang, Xiaojun Yuan 0002. 2344-2349 [doi]
• On Sparse Regression LDPC CodesJamison R. Ebert, Jean-François Chamberland, Krishna R. Narayanan. 2350-2355 [doi]
• On the Tanner Cycle Distribution of QC-LDPC Codes from Polynomial Parity-Check MatricesAnthony Gómez-Fonseca, Roxana Smarandache, David G. M. Mitchell. 2356-2361 [doi]
• Degree-degree Correlated Low-density Parity-check Codes Over a Binary Erasure ChannelHsiao-Wen Yu, Cheng-En Lee, Ruhui Zhang, Cheng-Shang Chang, Duan-Shin Lee. 2362-2367 [doi]
• Two new algorithms for error support recovery of low rank parity check codesErmes Franch, Chunlei Li 0001. 2368-2373 [doi]
• Interpreting Training Aspects of Deep-Learned Error-Correcting CodesNatasha Devroye, Abhijeet Mulgund, Raj Shekhar, György Turán, Milos Zefran, Yingyao Zhou. 2374-2379 [doi]
• Neural Estimation of Multi-User Capacity RegionsBashar Huleihel, Dor Tsur, Ziv Aharoni, Oron Sabag, Haim H. Permuter. 2380-2385 [doi]
• Learning to Code on Graphs for Topological Interference ManagementZhiwei Shan, Xinping Yi, Han Yu, Chung-Shou Liao, Shi Jin 0002. 2386-2391 [doi]
• Secure Embedding Aggregation for Federated Representation LearningJiaxiang Tang, Jinbao Zhu, Songze Li, Lichao Sun 0001. 2392-2397 [doi]
• Weakly Secure Summation with Colluding UsersZhou Li, Yizhou Zhao, Hua Sun 0001. 2398-2403 [doi]
• Secure Gradient Aggregation for Wireless Multi-Server Federated LearningZhenhao Huang, Songze Li, Kai Liang, Youlong Wu. 2404-2409 [doi]
• Coded Parallelism for Distributed Deep LearningSongting Ji, Zhaoyang Zhang 0001, Zhaohui Yang 0001, Richeng Jin, Qianqian Yang 0002. 2410-2415 [doi]
• Detectability of Denial-of-Service Attacks on Arbitrarily Varying Channels with State ConstraintsChristian Arendt, Janis Nötzel, Holger Boche. 2416-2421 [doi]
• On Authentication against a Myopic Adversary using Stochastic CodesMayank Bakshi, Oliver Kosut. 2422-2427 [doi]
• Security Bounds for Bitcoin Under Network DelayMustafa Doger, Sennur Ulukus. 2428-2433 [doi]
• Bounds for Binary Multimedia Codes with the Identifiable Parent PropertyHongna Yang, Yujie Gu, YiWei Zhang. 2434-2439 [doi]
• Direct Constructions of Multiple Shift Complementary Sets of Flexible LengthsAbhishek Roy 0006, Sudhan Majhi. 2440-2445 [doi]
• Complementary Graph Entropy, AND Product, and Disjoint Union of GraphsNicolas Charpenay, Maël Le Treust, Aline Roumy. 2446-2451 [doi]
• Information Inequalities via Ideas from Additive CombinatoricsChin Wa Ken Lau, Chandra Nair. 2452-2457 [doi]
• Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic CombinatoricsKeshav Goyal, Duc Tu Dao, Han Mao Kiah, Mladen Kovacevic 0001. 2458-2463 [doi]
• Context-tree weighting for real-valued time series: Bayesian inference with hierarchical mixture modelsIoannis Papageorgiou, Ioannis Kontoyiannis. 2464-2469 [doi]
• Time Series Analysis with Bayesian Context Trees: Classical Asymptotics and Finite-n BoundsIoannis Kontoyiannis. 2470-2475 [doi]
• Uniqueness of Distributional BP Fixed Point in Ising Model on TreesQian Yu, Yury Polyanskiy. 2476-2481 [doi]
• Assisted Unsupervised Domain AdaptationCheng Chen, Jiawei Zhang, Jie Ding 0002, Yi Zhou. 2482-2487 [doi]
• On the Generalization Error of Meta Learning for the Gibbs AlgorithmYuheng Bu, Harsha Vardhan Tetali, Gholamali Aminian, Miguel R. D. Rodrigues, Gregory W. Wornell. 2488-2493 [doi]
• Exact Asymptotics for Discrete Noiseless ChannelsAndreas Lenz 0001, Stephen Melczer, Cyrus Rashtchian, Paul H. Siegel. 2494-2498 [doi]
• Matching Correlated Inhomogeneous Random Graphs using the k-core EstimatorMiklós Z. Rácz, Anirudh Sridhar. 2499-2504 [doi]
• A Non-Asymptotic Analysis of Mismatched GuessworkAlexander Mariona, Homa Esfahanizadeh, Rafael G. L. D'Oliveira, Muriel Médard. 2505-2510 [doi]
• Matrix Recovery from Permutations: An Algebraic Geometry ApproachManolis C. Tsakiris. 2511-2516 [doi]
• Non Binary LDPC Coded Orthogonal Modulation Schemes based on Non Binary Multilevel CodingJocelyn Bourduge, Charly Poulliat, Benjamin Gadat. 2517-2522 [doi]
• On the Advantages of Asynchrony in the Unsourced MACAlexander Fengler, Alejandro Lancho, Krishna Narayanan, Yury Polyanskiy. 2523-2528 [doi]
• Fully Private Grouped Matrix Multiplication with Colluding WorkersLev Tauz, Lara Dolecek. 2529-2534 [doi]
• Sparse and Private Distributed Matrix Multiplication with Straggler ToleranceMaximilian Egger, Marvin Xhemrishi, Antonia Wachter-Zeh, Rawad Bitar. 2535-2540 [doi]
• Data Allocation for Approximate Gradient Coding in Edge NetworksHaojun Li, Yi Chen 0013, Kenneth W. Shum, Chi Wan Sung. 2541-2546 [doi]
• Hierarchical Coded Gradient Aggregation Based on Layered MDS CodesM. Nikhil Krishnan, Anoop Thomas, Birenjith Sasidharan. 2547-2552 [doi]
• Differential MPSK with n-Bit Phase QuantizationSamiru Gayan, Hazer Inaltekin, Rajitha Senanayake, Jamie S. Evans. 2553-2558 [doi]
• A Primal-Dual Algorithmic Aspect of Link Scheduling in Dynamic Wireless NetworksYa-Chun Liang, Chung-Shou Liao, Xinping Yi. 2559-2564 [doi]
• Broadcast Packet Erasure Channels with Alternating Single-User FeedbackYen-Cheng Chu, Alireza Vahid, Sheng-Kai Chung, Shih-Chun Lin. 2565-2570 [doi]
• On the Capacity and State Estimation Error of Binary "Beam-Pointing" Channels with Block Memory and FeedbackSiyao Li, Giuseppe Caire. 2571-2576 [doi]
• Mixing a Covert and a Non-Covert UserAbdelaziz Bounhar, Mireille Sarkiss, Michèle A. Wigger. 2577-2582 [doi]
• On Distribution-Preserving Mitigation Strategies for Communication under Cognitive AdversariesSoumita Hazra, J. Harshan. 2583-2588 [doi]
• ε-Almost Collision-Flat Universal Hash Functions Motivated by Information-Theoretic SecurityMoritz Wiese, Holger Boche. 2589-2594 [doi]
• On the Benefit of Single-User Feedback for Secret Communication over Broadcast Erasure ChannelsYun-Mei Liao, I-Hsiang Wang. 2595-2600 [doi]
• Optimal Subspace Perturbation Bounds under Gaussian NoiseSean O'Rourke, Van Vu, Ke Wang 0003. 2601-2606 [doi]
• Limit Distribution Theory for KL divergence and Applications to Auditing Differential PrivacySreejith Sreekumar, Ziv Goldfeld, Kengo Kato. 2607-2612 [doi]
• High-Dimensional Smoothed Entropy Estimation via Dimensionality ReductionKristjan H. Greenewald, Brian Kingsbury, Yuancheng Yu. 2613-2618 [doi]
• On the best approximation by finite Gaussian mixturesYun Ma, Yihong Wu 0001, Pengkun Yang. 2619-2624 [doi]
• Entry-Specific Bounds for Low-Rank Matrix Completion under Highly Non-Uniform SamplingXumei Xi, Christina Lee Yu, Yudong Chen 0001. 2625-2630 [doi]
• Capturing and Interpreting Unique InformationPraveen Venkatesh, Keerthana Gurushankar, Gabriel Schamberg. 2631-2636 [doi]
• Differentially Private Detection of Sparse Gaussian MixturesRuizhi Zhang, Shanshan Cao. 2637-2642 [doi]
• Data-Driven Quickest Change Detection in Hidden Markov ModelsQi Zhang, Zhongchang Sun, Luis C. Herrera, Shaofeng Zou. 2643-2648 [doi]
• Distributed Fact CheckingAshwin Verma, Alireza Sharbafchi, Behrouz Touri, Soheil Mohajer. 2649-2654 [doi]
• A Bilateral Bound on the Mean-Square Error for Estimation in Model MismatchAmir Weiss, Alejandro Lancho, Yuheng Bu, Gregory W. Wornell. 2655-2660 [doi]
• Thermal-Aware Channel CapacityYeow Meng Chee, Tuvi Etzion, Kees A. Schouhamer Immink, Tuan Thanh Nguyen, Van Khu Vu, Jos H. Weber, Eitan Yaakobi. 2661-2666 [doi]
• Counting Constrained Codewords in Binary Linear Codes via Fourier ExpansionsV Arvind Rameshwar 0001, Navin Kashyap. 2667-2672 [doi]
• Quantized-Constraint Concatenation and the Covering Radius of Constrained SystemsDor Elimelech, Tom Meyerovitch, Moshe Schwartz 0001. 2673-2678 [doi]
• Bounds on the Essential Covering Radius of Constrained SystemsDor Elimelech, Tom Meyerovitch, Moshe Schwartz 0001. 2679-2684 [doi]
• The Min-entropy of Distributed Wireless Link Scheduling Algorithms under Arbitrary InterferenceDariusz R. Kowalski, Miguel A. Mosteiro. 2685-2690 [doi]
• Complexity-Constrained Clustered Cell-Free Networking for Sum Capacity MaximizationFuning Xia, Junyuan Wang 0001. 2691-2696 [doi]
• Reliable Throughput of Generalized Collision Channel without SynchronizationYijun Fan, Yanxiao Liu 0003, Yi Chen, Shenghao Yang 0001, Raymond W. Yeung. 2697-2702 [doi]
• Linial's Algorithm and Systematic Deletion-Correcting CodesYuting Li, Farzad Farnoud. 2703-2707 [doi]
• Codes Correcting a Single Long Duplication ErrorDaniil Goshkoder, Nikita Polyanskii, Ilya Vorobyev. 2708-2713 [doi]
• Computationally Relaxed Locally Decodable Codes, RevisitedAlexander R. Block, Jeremiah Blocki. 2714-2719 [doi]
• Correcting a substring edit error of bounded lengthYuanyuan Tang, Sarvin Motamen, Hao Lou, Kallie Whritenour, Shuche Wang, Ryan Gabrys, Farzad Farnoud. 2720-2725 [doi]
• Non-binary Codes Correcting Two DeletionsWentu Song, Kui Cai 0001. 2726-2731 [doi]
• Secure Block Joint Source-Channel Coding with Sequential EncodingHamid Ghourchian, Tobias J. Oechtering, Mikael Skoglund. 2732-2737 [doi]
• Integrated Communication and Receiver Sensing with Security Constraints on Message and StateMehrasa Ahmadipour, Michèle A. Wigger, Shlomo Shamai. 2738-2743 [doi]
• On Strong Secrecy for Multiple Access Channel with States and causal CSIYiqi Chen, Tobias J. Oechtering, Mikael Skoglund, Yuan Luo 0003. 2744-2749 [doi]
• Achievable Region of the K-User MAC Wiretap Channel Under Strong SecrecyHao Xu 0003, Kai-Kit Wong, Giuseppe Caire. 2750-2755 [doi]
• Submodular Function Inequalities Indexed by Chordal GraphsEmma Pollard, Mokshay Madiman. 2756-2761 [doi]
• Measuring the Complexity of an Exchangeable GraphAnda Skeja, Sofia C. Olhede. 2762-2767 [doi]
• The Capacity of Channels with O(1)-Bit FeedbackEric Ruzomberka, Yongkyu Jang, David J. Love, H. Vincent Poor. 2768-2773 [doi]
• Bounding the Permanent of a Non-negative Matrix via its Degree- M Bethe and Sinkhorn PermanentsYuwen Huang, Pascal O. Vontobel. 2774-2779 [doi]