Table of Contents

• Towards General Function Approximation in Nonstationary Reinforcement LearningSongtao Feng, Ming Yin 0003, Ruiquan Huang, Yu-Xiang Wang 0003, Jing Yang 0002, Yingbin Liang. 1-6 [doi]
• ⌈n/2⌉Zihao Zhang, Guodong Li, Sihuang Hu. 1-6 [doi]
• Low-Complexity Constrained Coding Schemes for Two-Dimensional Magnetic RecordingDogukan Özbayrak, Duru Uyar, Ahmed H. Hareedy. 1-6 [doi]
• Camouflage Adversarial Attacks on Multiple Agent SystemsZiqing Lu, Guanlin Liu, Lifeng Lai, Weiyu Xu. 7-12 [doi]
• Erasure Coded Neural Network Inference via Fisher AveragingDivyansh Jhunjhunwala, Neharika Jali, Gauri Joshi, Shiqiang Wang 0001. 13-18 [doi]
• Frequency Domain Diffusion Model with Scale-Dependent Noise ScheduleAmir Ziashahabi, Baturalp Buyukates, Artan Sheshmani, Yi-Zhuang You, Salman Avestimehr. 19-24 [doi]
• Sparsely Pre-Transformed Polar Codes for Low-Complexity SCL DecodingGeon Choi, Namyoon Lee. 25-30 [doi]
• Approaching Maximum Likelihood Decoding Performance via Reshuffling ORBGRANDLi Wan, Wenyi Zhang 0001. 31-36 [doi]
• Improved Construction of Robust Gray CodesDorsa Fathollahi, Mary Wootters. 37-42 [doi]
• Permutation Codes in Levenshtein, Ulam and Generalized Kendall-Tau MetricsShuche Wang, Yeow Meng Chee, Van Khu Vu. 43-48 [doi]
• AIFV Codes Allowing 2-bit Decoding Delays for Unequal Bit CostKen-ichi Iwata, Kengo Hashimoto, Takahiro Wakayama, Hirosuke Yamamoto. 49-54 [doi]
• An Asymmetric Encoding - Decoding Scheme for Lossless Data CompressionHirosuke Yamamoto, Ken-ichi Iwata. 55-60 [doi]
• Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV CodesMordecai J. Golin, Reza Hosseini Dolatabadi, Arian Zamani. 61-66 [doi]
• A (Weakly) Polynomial Algorithm for AIVF CodingMordecai J. Golin, Reza Hosseini Dolatabadi, Arian Zamani. 67-72 [doi]
• A Third Information-Theoretic Approach to Finite de Finetti TheoremsM. Berta, Lampros Gavalakis, Ioannis Kontoyiannis. 73-78 [doi]
• An Extension of Mcdiarmid's InequalityRichard Combes. 79-84 [doi]
• A Multi-Sequence Prophet Inequality Under Observation ConstraintsAristomenis Tsopelakos, Olgica Milenkovic. 85-90 [doi]
• Lq Lower Bounds on Distributed Estimation via Fisher InformationWei-Ning Chen, Ayfer Özgür. 91-96 [doi]
• Coding for Composite DNA to Correct Substitutions, Strand Losses, and DeletionsFrederik Walter, Omer Sabary, Antonia Wachter-Zeh, Eitan Yaakobi. 97-102 [doi]
• Correcting a Single Deletion in Reads from a Nanopore SequencerAnisha Banerjee, Yonatan Yehezkeally, Antonia Wachter-Zeh, Eitan Yaakobi. 103-108 [doi]
• Error-Correcting Codes for Combinatorial Composite DNAOmer Sabary, Inbal Preuss, Ryan Gabrys, Zohar Yakhini, Leon Anavy, Eitan Yaakobi. 109-114 [doi]
• The Capacity of the Weighted Read ChannelOmer Yerushalmi, Tuvi Etzion, Eitan Yaakobi. 115-120 [doi]
• On the Existence of Some Completely Regular Codes in Hamming GraphsDenis S. Krotov. 121-126 [doi]
• s-additive Codes: Efficient ComputationCristina Fernández-Córdoba, Adrián Torres-Martín, Carlos Vela, Mercè Villanueva. 127-132 [doi]
• Explicit Good Codes Approaching Distance 1 in Ulam MetricElazar Goldenberg, Mursalin Habib, Karthik C. S.. 133-138 [doi]
• Near-optimal constructions of constant weight codes and constant composition codes asymptotically attaining the Johnson boundMiao Liu, Chong Shangguan. 139-144 [doi]
• Competitive Analysis of Arbitrary Varying ChannelsMichael Langberg, Oron Sabag. 145-150 [doi]
• The State-Dependent Channel with a Rate-Limited Cribbing HelperAmos Lapidoth, Yossef Steinberg. 151-154 [doi]
• Fixed-Memory Capacity Bounds for the Gilbert-Elliott ChannelYutong Han, Albert Guillén i Fàbregas. 155-159 [doi]
• An Achievable Scheme for Channels with an Amplitude Constraint Using Walsh FunctionsRon Dabora, Shlomo Shamai, H. Vincent Poor. 160-165 [doi]
• On the Secrecy Capacity of 1-2-1 Atomic NetworksMohammad Milanian, Minoh Jeong, Martina Cardone. 166-171 [doi]
• Covert Distributed Detection over Discrete Memoryless ChannelsAbdelaziz Bounhar, Mireille Sarkiss, Michèle A. Wigger. 172-177 [doi]
• A Monotone Circuit Construction for Individually-Secure Multi-Secret SharingCailyn Bass, Alejandro Cohen, Rafael G. L. D'Oliveira, Muriel Médard. 178-183 [doi]
• Bounds on the Statistical Leakage-Resilience of Shamir's Secret SharingUtkarsh Gupta, Hessam Mahdavifar. 184-189 [doi]
• Mining Invariance from Nonlinear Multi-Environment Data: Binary ClassificationAustin Goddard, Kang Du, Yu Xiang 0004. 190-195 [doi]
• Benefits of Stochastic Mirror Descent in High-Dimensional Binary ClassificationK. Nithin Varma, Babak Hassibi. 196-201 [doi]
• Regularized Linear Regression for Binary ClassificationDanil Akhtiamov, Reza Ghane, Babak Hassibi. 202-207 [doi]
• Group Fairness with Uncertain Sensitive AttributesAbhin Shah, Maohao Shen, Jongha Jon Ryu, Subhro Das, Prasanna Sattigeri, Yuheng Bu, Gregory W. Wornell. 208-213 [doi]
• A Unified View of Group Fairness Tradeoffs Using Partial Information DecompositionFaisal Hamman, Sanghamitra Dutta. 214-219 [doi]
• Intrinsic Fairness-Accuracy Tradeoffs Under Equalized OddsMeiyu Zhong, Ravi Tandon. 220-225 [doi]
• Minimizing Distortion in Data Embedding Using LDGM Codes and the Cavity MethodMasoumeh Alinia, David G. M. Mitchell. 226-231 [doi]
• Reinforcement Learning for Near-Optimal Design of Zero-Delay Codes for Markov SourcesLiam Cregg, Tamás Linder, Serdar Yüksel. 232-237 [doi]
• Characterization of the Distortion-Perception Tradeoff for Finite Channels with Arbitrary MetricsDror Freirich, Nir Weinberger, Ron Meir. 238-243 [doi]
• Generalization and Informativeness of Conformal PredictionMatteo Zecchin, Sangwoo Park 0002, Osvaldo Simeone, Fredrik Hellström. 244-249 [doi]
• Cross-Validation Conformal Risk ControlKfir M. Cohen, Sangwoo Park 0002, Osvaldo Simeone, Shlomo Shamai Shitz. 250-255 [doi]
• Risk Bound on MDL Estimator for Simple ReLU NetworksYoshinari Takeishi, Jun'ichi Takeuchi. 256-261 [doi]
• Message- Relevant Dimension Reduction of Neural PopulationsAmanda Merkley, Pulkit Grover, Alice Y. Nam, Y. Kate Hong. 262-267 [doi]
• A Simple Self-Decoding Model for Neural CodingThach V. Bui. 268-273 [doi]
• Causality Testing, Directed Information and Spike TrainsAndreas Theocharous, Georgia G. Gregoriou, Panagiotis Sapountzis, Ioannis Kontoyiannis. 274-279 [doi]
• Estimating the Weight Enumerators of Reed-Muller Codes via SamplingShreyas Jain, V Arvind Rameshwar 0001, Navin Kashyap. 280-285 [doi]
• Generalized Reed-Muller Codes: A New Construction of Information SetsJosé Joaquín Bernal. 286-290 [doi]
• Recursive Subproduct Codes with Reed-Muller-like StructureAditya Siddheshwar, Lakshmi Prasad Natarajan, Prasad Krishnan. 291-296 [doi]
• Deterministic Identification Over Channels with Finite Output: A Dimensional Perspective on Superlinear RatesPau Colomer, Christian Deppe, Holger Boche, Andreas J. Winter 0002. 297-302 [doi]
• Deterministic Identification: From Theoretical Analysis to Practical Identification CodesIlya Vorobyev, Christian Deppe, Luis Torres-Figueroa, Holger Boche. 303-308 [doi]
• Second-Order Identification Capacity of AWGN ChannelsZhicheng Liu, Yuan Li, Huazi Zhang, Jun Wang 0062, Guiying Yan, Zhiming Ma. 309-314 [doi]
• Variable-Length Secret Key Agreement via Random Stopping TimeJunda Zhou, Cheuk Ting Li. 315-320 [doi]
• A Perfect Ideal Hierarchical Secret Sharing Scheme Based on the CRT for Polynomial RingsJing Yang 0035, Shu-Tao Xia, Xianfang Wang, Jiangtao Yuan, Fang-Wei Fu 0001. 321-326 [doi]
• Repurposing Physical Layer Secret Keys: A Novel Paradigm for Common Randomness GenerationPrashanth K. H. Sheshagiri, Juan A. Cabrera 0002, Frank H. P. Fitzek. 327-332 [doi]
• Limit Distribution for Quantum Relative EntropySreejith Sreekumar, Mario Berta. 333-338 [doi]
• A Causal Model for Quantifying Multipartite Classical and Quantum CorrelationsShuchan Wang, Gerhard Wunder. 339-344 [doi]
• Entanglement cost of discriminating quantum states under locality constraintsChenghong Zhu, Chengkai Zhu, Zhiping Liu, Xin Wang. 345-350 [doi]
• Locally-Measured Rényi DivergencesTobias Rippchen, Sreejith Sreekumar, Mario Berta. 351-356 [doi]
• Effect of Weight Quantization on Learning Models by Typical Case AnalysisShuhei Kashiwamura, Ayaka Sakata, Masaaki Imaizumi. 357-362 [doi]
• Sharp Information-Theoretic Thresholds for Shuffled Linear RegressionLeon Lufkin, Yihong Wu, Jiaming Xu. 363-367 [doi]
• Data-Driven Estimation of the False Positive Rate of the Bayes Binary Classifier via Soft LabelsMinoh Jeong, Martina Cardone, Alex Dytso. 368-373 [doi]
• Rate of Convergence of an Over-Parametrized Convolutional Neural Network Image Classifier Learned by Gradient DescentMichael Kohler, Benjamin Walter 0001, Adam Krzyzak. 374-379 [doi]
• On the Privacy Guarantees of Differentially Private Stochastic Gradient DescentShahab Asoodeh, Mario Díaz. 380-385 [doi]
• Controlled privacy leakage propagation throughout differential private overlapping grouped learningShahrzad Kiani, Franziska Boenisch, Stark C. Draper. 386-391 [doi]
• Utilitarian Privacy and Private SamplingAman Bansal, Rahul Chunduru, Deepesh Data, Manoj Prabhakaran 0001. 392-397 [doi]
• Age Aware Scheduling for Differentially-Private Federated LearningKuan-Yu Lin, Hsuan-Yin Lin, Yu-Pin Hsu 0001, Yu-Chih Huang. 398-403 [doi]
• On the Rate-Distortion Function for Sampled Cyclostationary Gaussian Processes with MemoryZikun Tan, Ron Dabora, H. Vincent Poor. 404-409 [doi]
• On Convergence of Discrete Schemes for Computing the Rate-Distortion Function of Continuous SourceLingyi Chen, Shitong Wu, Wenyi Zhang, Huihui Wu, Hao Wu. 410-415 [doi]
• On the Lossy Compression of Spatial NetworksPraneeth Kumar Vippathalla, Martin Wachiye Wafula, Mihai-Alin Badiu, Justin P. Coon. 416-421 [doi]
• Estimation of Rate- Distortion Function for Computing with Decoder Side InformationHeasung Kim, Hyeji Kim, Gustavo de Veciana. 422-427 [doi]
• Design and Analysis of a Family of Complexity-Constrained LDPC CodesMassimo Battaglioni, Matteo Amagliani, Marco Baldi, Franco Chiaraluce, Giovanni Cancellieri. 428-433 [doi]
• Generalized Quasi-Cyclic LDPC Codes: Design and Efficient EncodingRoxana Smarandache, Anthony Gómez-Fonseca, David G. M. Mitchell. 434-439 [doi]
• Progressive Reconstruction of Large QC-LDPC Codes over a Noisy ChannelYuanbo Mi, Zhao Chen 0002, Liuguo Yin, Xi Chen. 440-445 [doi]
• Group Codes with Low-Density Orthogonal IdempotentFabián Molina, Paolo Santini, Marco Baldi. 446-451 [doi]
• Achieving DNA Labeling Capacity with Minimum Labels through Extremal de Bruijn SubgraphsChristoph Hofmeister, Anina Gruica, Dganit Hanania, Rawad Bitar, Eitan Yaakobi. 452-457 [doi]
• Coding Scheme for Noisy Nanopore Sequencing with Backtracking and Skipping ErrorsYeow Meng Chee, Kees A. Schouhamer Immink, Van Khu Vu. 458-463 [doi]
• Covering All Bases: The Next Inning in DNA Sequencing EfficiencyHadas Abraham, Ryan Gabrys, Eitan Yaakobi. 464-469 [doi]
• Asymptotically Optimal Codes Correcting One Substring EditL. Yuting, Yuanyuan Tang, Hao Lou, Ryan Gabrys, Farzad Farnoud. 470-475 [doi]
• Efficient Decoding of a Class of Reed-Solomon Codes Over Fermat FieldsChao Chen 0013, Baoming Bai, Xiao Ma 0001, Yunghsiang S. Han, Nianqi Tang, Xiaotian Wang 0001. 476-481 [doi]
• Reed-Solomon Codes over Cyclic Polynomial Ring with Lower Encoding/Decoding ComplexityWenhao Liu, Zhengyi Jiang, Zhongyi Huang, Linqi Song, Hanxu Hou. 482-487 [doi]
• Deep Holes of Twisted Reed-Solomon CodesWeijun Fang, Jingke Xu. 488-493 [doi]
• Repairing Reed-Solomon Codes with Less BandwidthShu Liu 0004, Yunqi Wan, Chaoping Xing. 494-498 [doi]
• Information Velocity of Cascaded AWGN Channels with FeedbackElad Domanovitz, Anatoly Khina, Tal Philosof, Yuval Kochman. 499-504 [doi]
• Message-Cognizant Assistance and Feedback for the Gaussian ChannelAmos Lapidoth, Ligong Wang 0002, Yiming Yan. 505-509 [doi]
• Channel Coding with Mean and Variance Cost ConstraintsAdeel Mahmood, Aaron B. Wagner. 510-515 [doi]
• Systematic Transmission With Fountain Parity Checks for Erasure Channels With Stop FeedbackHengjie Yang, Richard D. Wesel. 516-521 [doi]
• Missing Mass Under Random DuplicationsPrafulla Chandra, Andrew Thangaraj. 522-526 [doi]
• Low-rank Matrix Sensing With Dithered One-Bit QuantizationFarhang Yeganegi, Arian Eamaz, Mojtaba Soltanalian. 527-532 [doi]
• Sharper Rates of Convergence for the Tensor Graphical Lasso EstimatorShuheng Zhou, Kristjan H. Greenewald. 533-538 [doi]
• Detection of Signals in Colored Noise: Leading Eigenvalue Test for Non-central F-matricesPrathapasinghe Dharmawansa, Saman Atapattu, Jamie S. Evans, Kandeepan Sithamparanathan. 539-544 [doi]
• Bipartite Entanglement of Noisy Stabilizer States Through the Lens of Stabilizer CodesKenneth Goodenough, Aqil Sajjad, Eneet Kaur, Saikat Guha 0001, Don Towsley. 545-550 [doi]
• Quantum Illumination Advantage for Classification Among an Arbitrary Library of TargetsAli Cox, Quntao Zhuang, Jeffrey H. Shapiro, Saikat Guha 0001. 551-556 [doi]
• Quantum Doeblin Coefficients: A Simple Upper Bound on Contraction CoefficientsChristoph Hirche. 557-562 [doi]
• Empirical Risk Minimization and Uniform Convergence for Probabilistically Observed and Quantum Measurement Hypothesis ClassesAbram Magner, Arun Padakandla. 563-568 [doi]
• Conditional Mutual Information Constrained Deep Learning: Framework and Preliminary ResultsEn-Hui Yang, Shayan Mohajer Hamidi, Linfeng Ye, Renhao Tan, Beverly Yang. 569-574 [doi]
• Supervised Contrastive Representation Learning: Landscape Analysis with Unconstrained FeaturesTina Behnia, Christos Thrampoulidis. 575-580 [doi]
• Theoretical Guarantees of Data Augmented Last Layer Retraining MethodsMonica Welfert, Nathan Stromberg, Lalitha Sankar. 581-586 [doi]
• Robust VAEs via Generating Process of Noise Augmented DataHiroo Irobe, Wataru Aoki, Kimihiro Yamazaki, Yuhui Zhang, Takumi Nakagawa, Hiroki Waida, Yuichiro Wada, Takafumi Kanamori. 587-592 [doi]
• Optimal Private Discrete Distribution Estimation with One-Bit CommunicationSeung-Hyun Nam, Vincent Y. F. Tan, Si-Hyeon Lee. 593-598 [doi]
• Differentially Private Synthetic Data with Private Density EstimationNikolija Bojkovic, Po-Ling Loh. 599-604 [doi]
• Training Generative Models from Privatized Data via Entropic Optimal TransportDaria Reshetova, Wei-Ning Chen, Ayfer Özgür. 605-610 [doi]
• Differentially Private Fair Binary ClassificationsHrad Ghoukasian, Shahab Asoodeh. 611-616 [doi]
• Few-Shot Channel-Agnostic Analog Coding: A Near-Optimal SchemeMohammad Ali Maddah-Ali, Soheil Mohajer. 617-622 [doi]
• One Shot Joint Source Channel CodingNir Elkayam, Meir Feder. 623-628 [doi]
• Unequal Message Protection: One-Shot analysis via Poisson Matching LemmaAshish Khisti, Arash Behboodi, Gabriele Cesa, Kumar Pratik. 629-634 [doi]
• Power-limited Modulation-Estimation with a HelperAnatoly Khina, Neri Merhav. 635-640 [doi]
• Analysis of Coded Shaped QAM Signaling at Short and Moderate LengthsIrina E. Bocharova, Boris D. Kudryashov, Sander Mikelsaar. 641-646 [doi]
• Short Regular Girth-8 QC-LDPC Codes from Exponent Matrices with Vertical SymmetryGuohua Zhang, Aijing Sun, Ling Liu, Yi Fang. 647-652 [doi]
• Probabilistic Design of Multi-Dimensional Spatially-Coupled CodesCanberk Irimagzi, Ata Tanrikulu, Ahmed H. Hareedy. 653-658 [doi]
• Pseudoredundancy for the Bit-Flipping AlgorithmJens Zumbrägel. 659-662 [doi]
• Short Systematic Codes for Correcting Random Edit Errors in DNA StorageSerge Kas Hanna. 663-668 [doi]
• Efficient DNA Synthesis Codes with Error Correction and Runlength Limited ConstraintTuan Thanh Nguyen, Kui Cai 0001, Kees A. Schouhamer Immink. 669-674 [doi]
• A Combinatorial Perspective on Random Access Efficiency for DNA StorageAnina Gruica, Daniella Bar-Lev, Alberto Ravagnani, Eitan Yaakobi. 675-680 [doi]
• Capacity of Frequency-based Channels: Encoding Information in Molecular ConcentrationsYuval Gerzon, Ilan Shomorony, Nir Weinberger. 681-686 [doi]
• Pair-Covering CodesAvital Boruchovsky, Tuvi Etzion, Eitan Yaakobi. 687-692 [doi]
• On the Classification of $\mathbb{Z}_{2}\mathbb{Z}_{4}\mathbb{Z}_{8}$-Linear Hadamard CodesDipak Kumar Bhunia, Cristina Fernández-Córdoba, Mercè Villanueva. 693-698 [doi]
• Endomorphisms of Linear Block CodesJonathan Mandelbaum, Sisi Miao, Holger Jäkel, Laurent Schmalen. 699-704 [doi]
• Nonlinear Codes with Low RedundancyShu Liu 0004, Chaoping Xing. 705-710 [doi]
• Binomial Channel: On the Capacity-Achieving Distribution and Bounds on the CapacityLuca Barletta, Ian Zieder, Antonino Favano, Alex Dytso. 711-716 [doi]
• Information Rates Over DMCs with Many Independent ViewsV. Arvind Rameshwar, Nir Weinberger. 717-722 [doi]
• Capacity-Maximizing Input Symbol Selection for Discrete Memoryless ChannelsMaximilian Egger, Rawad Bitar, Antonia Wachter-Zeh, Deniz Gündüz, Nir Weinberger. 723-728 [doi]
• New Algorithms for Computing Sibson Capacity and Arimoto CapacityAkira Kamatsuka, Yuki Ishikawa, Koki Kazama, Takahiro Yoshida. 729-734 [doi]
• On the Success Probability of the $L_{0}$-regularized Box-constrained Babai PointXiao-Wen Chang, Yingzi Xu. 735-740 [doi]
• Linear Operator Approximate Message Passing: Power Method with Partial and Stochastic UpdatesRiccardo Rossetti, Bobak Nazer, Galen Reeves. 741-746 [doi]
• A Convergence Analysis of Approximate Message Passing with Non-Separable Functions and Applications to Multi-Class ClassificationBurak Çakmak, Yue M. Lu, Manfred Opper. 747-752 [doi]
• Efficient Nonconvex Optimization for Two-way Sparse Reduced-Rank RegressionCheng Cheng, Ziping Zhao. 753-758 [doi]
• Equivalence of Empirical Risk Minimization to Regularization on the Family of $f- \text{Divergences}$Francisco Daunas, Iñaki Esnaola, Samir M. Perlaza, H. Vincent Poor. 759-764 [doi]
• Error Exponent in Agnostic PAC LearningAdi Hendel, Meir Feder. 765-770 [doi]
• Universal Batch Learning Under The Misspecification SettingShlomi Vituri, Meir Feder. 771-776 [doi]
• Minimal Communication-Cost Statistical LearningMilad Sefidgaran, Abdellatif Zaidi, Piotr Krasnowski. 777-782 [doi]
• Violation of Leggett-Garg inequalities implies information erasureAlberto Montina, Stefan Wolf 0001. 783-788 [doi]
• Adversarial Quantum Machine Learning: An Information-Theoretic Generalization AnalysisPetros Georgiou, Sharu Theresa Jose, Osvaldo Simeone. 789-794 [doi]
• Receiver Algorithms to Approach the Quantum Limit of Demodulating Pulse Position ModulationLeo Bia, Christos N. Gagatsos, Saikat Guha 0001. 795-800 [doi]
• On Two-Stage Quantum Estimation and Asymptotics of Quantum-Enhanced Transmittance SensingZihao Gong, Boulat A. Bash. 801-806 [doi]
• MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper NodesGuodong Li, Ningning Wang, Sihuang Hu, Min Ye 0005. 807-812 [doi]
• More Results for Regenerating Codes on GraphsAdway Patra, Alexander Barg. 813-818 [doi]
• On the Parameters of Codes for Data AccessAltan B. Kilic, Alberto Ravagnani, Emina Soljanin. 819-824 [doi]
• The Optimal Finite-Sample Error Probability in Asymmetric Binary Hypothesis TestingValentinian Lungu, Ioannis Kontoyiannis. 831-836 [doi]
• Asymptotically optimal multistage tests for multihypothesis testingYiming Xing, Georgios Fellouris. 837-842 [doi]
• Non-Convex Robust Hypothesis Testing Using Sinkhorn Uncertainty SetsJie Wang, Rui Gao, Yao Xie. 843-848 [doi]
• Robust Multi-Hypothesis Testing with Moment-Constrained Uncertainty SetsAkshayaa Magesh, Zhongchang Sun, Venugopal V. Veeravalli, Shaofeng Zou. 849-854 [doi]
• Low-Rate, Low-Distortion Compression with Wasserstein DistortionYang Qiu, Aaron B. Wagner. 855-860 [doi]
• A Distributionally Robust Approach to Shannon Limits using the Wasserstein DistanceVikrant Malik, Taylan Kargin, Victoria Kostina, Babak Hassibi. 861-866 [doi]
• A Converse Bound on the Mismatched Distortion-Rate FunctionMaël Le Treust, Tristan Tomala. 867-872 [doi]
• Uniform Distribution on ($n - 1$)-Sphere: Rate-Distortion Under Squared Error DistortionAlex Dytso, Martina Cardone. 873-878 [doi]
• On $k$-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace ReconstructionKuan Cheng, Elena Grigorescu, Xin Li, Madhu Sudan 0001, Minshen Zhu. 879-884 [doi]
• Tree Trace Reconstruction - Reductions to String Trace ReconstructionThomas Jacob Maranzatto. 885-890 [doi]
• Sequence Reconstruction over 3-Deletion ChannelsDi Zhang, Gennian Ge, YiWei Zhang. 891-896 [doi]
• Reconstruction of multiple strings of constant weight from prefix-suffix compositionsYaoyu Yang, Zitan Chen. 897-902 [doi]
• A Relay Algorithm of BCH Codes for a Quick Start of the Berlekamp-Massey AlgorithmNaoaki Kokubun, Yuki Kondo, Hironori Uchikawa. 903-908 [doi]
• An Earlier Termination Algorithm to Find Error Locator Polynomial in Error Correction of RS CodesZhengyi Jiang, Hao Shi, Zhongyi Huang, Bo Bai 0001, Gong Zhang 0001, Hanxu Hou. 909-914 [doi]
• An Explicit Construction of $q\text{-ary}$ MDS Array Codes and Their Efficient DecodingJingjie Lv, Weijun Fang, Shu-Tao Xia, Hanxu Hou. 915-920 [doi]
• Coset Error Patterns in Recursive Projection-Aggregation DecodingFanyun Chen, Bin Zhang, Qin Huang. 921-926 [doi]
• Private Sum Computation: Trade-Off Between Shared Randomness and PrivacyRémi A. Chou, Jörg Kliewer, Aylin Yener. 927-932 [doi]
• Perfect Subset Privacy in Polynomial ComputationZirui Deng, Vinayak Ramkumar, Netanel Raviv. 933-938 [doi]
• Private Multiple Linear Computation: A Flexible Communication-Computation TradeoffJinbao Zhu, Lanping Li, Xiaohu Tang, Ping Deng. 939-944 [doi]
• On Multi-Message Private ComputationAli Gholami, Kai Wan, Tayyebeh Jahani-Nezhad, Hua Sun 0001, Mingyue Ji, Giuseppe Caire. 945-950 [doi]
• Peak Age of Information under Tandem of QueuesAshirwad Sinha, Shubhransh Singhvi, Praful D. Mankar, Harpreet S. Dhillon. 951-956 [doi]
• AoI -optimal Scheduling for Arbitrary K -channel Update- Through-Queue SystemsWon Jun Lee, Chih-Chun Wang. 957-962 [doi]
• Optimizing Information Freshness in Mobile Networks with Age-Threshold ALOHAFangming Zhao, Nikolaos Pappas 0001, Chuan Ma, Xinghua Sun, Tony Q. S. Quek, Howard H. Yang. 963-968 [doi]
• Protocol Sequences for Age of Information Under Multiple-Packet ReceptionYinian Zheng, Fang Liu 0022, Yuan-Hsun Lo, Tsai-Lien Wong, Kangkang Xu, Yijin Zhang. 969-974 [doi]
• Low Complexity Approximate Bayesian Logistic Regression for Sparse Online LearningGil I. Shamir, Wojciech Szpankowski. 975-980 [doi]
• Personalized Heterogeneous Gaussian Mean Estimation Under Communication ConstraintsRuida Zhou, Suhas N. Diggavi. 981-986 [doi]
• Multivariate Priors and the Linearity of Optimal Bayesian Estimators under Gaussian NoiseLeighton Pate Barnes, Alex Dytso, Jingbo Liu, H. Vincent Poor. 987-992 [doi]
• Bayesian Persuasion: From Persuasion toward Counter-SuasionAnanya Das, Aishwarya Soni, Amitalok J. Budkuley. 993-998 [doi]
• Min-Entropic Quantities Induced by Cones: Properties & Operational InterpretationsIan George, Eric Chitambar. 1005-1010 [doi]
• Fully Quantum Arbitrarily Varying Channel Coding for Entanglement-Assisted CommunicationPaula Belzig. 1011-1016 [doi]
• Secure Communication with Unreliable Entanglement AssistanceMeir Lederman, Uzi Pereg. 1017-1022 [doi]
• Universal Framework for Parametric Constrained CodingAdir Kobovich, Orian Leitersdorf, Daniella Bar-Lev, Eitan Yaakobi. 1023-1028 [doi]
• Decoding Sparse Reed-Solomon Codes with Known SupportWilton Kim, Joel Nathanael Raj, Stanislav Kruglik, Han Mao Kiah. 1029-1034 [doi]
• Thermal-Aware Channel with Multiple WiresYeow Meng Chee, Tuvi Etzion, Kees A. Schouhamer Immink, Tuan Thanh Nguyen, Van Khu Vu, Jos H. Weber, Eitan Yaakobi. 1035-1040 [doi]
• Tight Lower Bound on Cross-Rack Update Bandwidth and Explicit ConstructionsZhengyi Jiang, Bin Yu, Zhongyi Huang, Linqi Song, Bo Bai 0001, Gong Zhang 0001, Hanxu Hou. 1041-1046 [doi]
• High Probability Latency Quickest Change Detection over a Finite HorizonYu-Han Huang, Venugopal V. Veeravalli. 1047-1052 [doi]
• Syndrome-Based Fusion Rules in Heterogeneous Distributed Quickest Change DetectionWen-Hsuan Li, Yu-Chih Huang. 1053-1058 [doi]
• Quickest Detection in High-Dimensional Linear Regression Models via Implicit RegularizationQunzhi Xu, Yi Yu, Yajun Mei. 1059-1064 [doi]
• Monitoring High-Dimensional Streaming Data via Fusing Nonparametric Shiryaev-Roberts StatisticsXinyuan Zhang, Yajun Mei. 1065-1070 [doi]
• Rate-Distortion-Perception Tradeoff for Lossy Compression Using Conditional Perception MeasureSadaf Salehkalaibar, Jun Chen 0005, Ashish Khisti, Wei Yu 0001. 1071-1076 [doi]
• Computation of the Multivariate Gaussian Rate-Distortion-Perception FunctionGiuseppe Serra 0003, Photios A. Stavrou, Marios Kountouris. 1077-1082 [doi]
• The Rate-Distortion-Perception Trade-off: the Role of Private RandomnessYassine Hamdi, Aaron B. Wagner, Deniz Gündüz. 1083-1088 [doi]
• Copula-Based Estimation of Continuous Sources for a Class of Constrained Rate-Distortion FunctionsGiuseppe Serra 0003, Photios A. Stavrou, Marios Kountouris. 1089-1094 [doi]
• Improved Non-Asymptotic Lower Bound on the Size of Optimal Insertion/Deletion Correcting CodeYuhang Pi, Zhifang Zhang, Yaqian Zhang. 1095-1100 [doi]
• New Construction of q-ary Codes Correcting a Burst of at Most t DeletionsWentu Song, Kui Cai 0001, Tony Q. S. Quek. 1101-1106 [doi]
• Improving the Singleton-Type Upper Bounds for Non-Linear Deletion Correcting CodesShiqin Liu, Chen Wang, Gennian Ge, YiWei Zhang. 1107-1112 [doi]
• On Fixed Length Systematic All Limited Magnitude Zero Deletion/Insertion Error Control CodesLuca G. Tallini, Hoang-Vu, Bella Bose. 1113-1118 [doi]
• Mixed-Weight Conflict-Avoiding CodesYijin Zhang, Tsai-Lien Wong, Kangkang Xu, Yuan-Hsun Lo. 1119-1124 [doi]
• Frame Codes for the Block-Erasure ChannelItamar Jacoby, Ram Zamir. 1125-1130 [doi]
• Construction of 4-phase Golay Complementary Sequence Sets with Small Number of Constituent Sequences and Arbitrary LengthCheng Du, Yi Jiang 0002. 1131-1136 [doi]
• A New Construction of Enhanced Cross Z-Complementary Sets with Maximum Zero Correlation ZoneZhen-Ming Huang, Cheng-Yu Pai, Zilong Liu 0001, Chao-Yu Chen. 1137-1142 [doi]
• Write Voltage Optimization to Increase Flash Lifetime in a Two-Variance Gaussian ChannelAva Asmani, Semira Galijasevic, Richard D. Wesel. 1143-1148 [doi]
• Fast Readable Multi-Cell Coding for Flash MemoryHironori Uchikawa, Noboru Shibata, Taira Shibuya. 1149-1154 [doi]
• Efficient and Timely Memory AccessVishakha Ramani, Ivan Seskar, Roy D. Yates. 1155-1160 [doi]
• On-Access Error Correction in Certain Types of Content-Addressable MemoriesRon M. Roth, Giacomo Pedretti. 1161-1166 [doi]
• Timely Gossip with Age-Dependent NetworksHan Xu, Yinfei Xu, Tiecheng Song. 1167-1172 [doi]
• Age of Gossip in Random and Bipartite NetworksThomas Jacob Maranzatto. 1173-1178 [doi]
• Goal-Oriented Communications for Remote Inference Under Two-Way Delay with MemoryCagri Ari, Md Kamran Chowdhury Shisher, Elif Uysal, Yin Sun. 1179-1184 [doi]
• PAC Learnability for Reliable Communication Over Discrete Memoryless ChannelsJiakun Liu, Wenyi Zhang 0001, H. Vincent Poor. 1185-1190 [doi]
• Neural Estimation of Multi-User Capacity Regions Over Discrete ChannelsBashar Huleihel, Dor Tsur, Ziv Aharoni, Oron Sabag, Haim H. Permuter. 1191-1196 [doi]
• Neural Network Equalizers and Successive Interference Cancellation for Bandlimited Channels with a NonlinearityDaniel Plabst, Tobias Prinz, Francesca Diedolo, Thomas Wiegart, Georg Böcherer, Norbert Hanik, Gerhard Kramer. 1197-1202 [doi]
• Graph Neural Network-Based Joint Equalization and DecodingJannis Clausius, Marvin Geiselhart, Daniel Tandler, Stephan ten Brink. 1203-1208 [doi]
• Optimality of Meta-Converse for Channel SimulationMario Berta, Omar Fawzi, Aadil Oufkir. 1209-1214 [doi]
• Coherent Distributed Source Simulation as Multipartite Quantum State SplittingIan George, Hao-Chung Cheng. 1221-1226 [doi]
• Data Transmission over a Bosonic Channel under Classical NoiseJanis Nötzel. 1227-1232 [doi]
• New EVENODD+ Codes with More Flexible Parameters and Lower ComplexityPanyu Zhu, Jingjie Lv, Yunghsiang S. Han, Linqi Song, Hanxu Hou. 1233-1238 [doi]
• Upper Bound on Coding Rate over Resistive Random-Access Memory Channel under Arbitrary Input DistributionGuanghui Song, Qi Cao, L. Ying, H. Xuan, Kui Cai 0001. 1239-1244 [doi]
• Error-Resilient Weakly Constrained Coding via Row-by-Row CodingPrachi Mishra, Navin Kashyap. 1251-1256 [doi]
• Detection of Correlated Random VectorsDor Elimelech, Wasim Huleihel. 1257-1262 [doi]
• Testing Dependency of Weighted Random GraphsMor Oren-Loberman, Vered Paslev, Wasim Huleihel. 1263-1268 [doi]
• Neyman-Pearson Causal InferenceJoni Shaska, Urbashi Mitra. 1269-1274 [doi]
• Large Deviations for Statistical Sequence MatchingLin Zhou 0002, Qianyun Wang, Jingjing Wang 0001, Lin Bai 0001, Alfred O. Hero III. 1275-1280 [doi]
• Error Exponents of Discrete Memoryless Channels Under Small MismatchPriyanka Patel, Francesc Molina, Albert Guillén i Fàbregas. 1281-1284 [doi]
• The Method of Types for the AWGN Channel: Error ExponentSergey Tridenski, Anelia Somekh-Baruch. 1285-1290 [doi]
• On Guessing Random Additive Noise DecodingHamdi Joudeh. 1291-1296 [doi]
• An Achievable Error Exponent for the Information Bottleneck ChannelHan Wu, Hamdi Joudeh. 1297-1302 [doi]
• Characterizing positive-rate secure multicast network coding with eavesdropping nodesMichael Langberg, Michelle Effros. 1303-1308 [doi]
• The Langberg-Médard Multiple Unicast Conjecture for Networks with Collapsed BackboneKai Cai, Guangyue Han. 1309-1314 [doi]
• Distributionally Robust Degree Optimization for BATS CodesHoover H. F. Yin, Jie Wang 0049, Sherman S. M. Chow. 1315-1320 [doi]
• Efficient Binary Batched Network Coding Employing Partial RecoveryLicheng Mao, Shenghao Yang 0001. 1321-1326 [doi]
• A New Family of Binary Sequences Based on the Generalized ERC ConstructionFrancisco-Javier Soto, Ana I Gómez, Domingo Gómez-Pérez. 1327-1331 [doi]
• Network Analysis of Baker's Map Implemented in a Fixed-Point Arithmetic DomainKai Tan, Chengqing Li. 1332-1337 [doi]
• The Unique Form of the Uncorrelated Optimal ZCZ Sequence FamiliesGangsan Kim, Hong-Yeop Song. 1338-1342 [doi]
• On de Bruijn Covering Sequences and ArraysYeow Meng Chee, Tuvi Etzion, Hoang Ta 0001, Van Khu Vu. 1343-1348 [doi]
• Perfect Multi-User Distributed ComputingAli Khalesi, Petros Elia. 1349-1354 [doi]
• Multi-access Distributed Computing Models using Map-Reduce ArraysShanuja Sasi, Onur Günlü, B. Sundar Rajan. 1355-1360 [doi]
• Decentralized Uncoded Storage Elastic Computing with Heterogeneous Computation SpeedsWenbo Huang, Xudong You, Kai Wan, Robert Caiming Qiu, Mingyue Ji. 1361-1366 [doi]
• Sparse Gaussian Gradient CodeYuxin Jiang, Wenqin Zhang, Yuan Luo 0003, Lele Wang. 1367-1372 [doi]
• Optimal Denial-of-Service Attacks Against Status UpdatingSaad Kriouile, Mohamad Assaad, Deniz Gündüz, Touraj Soleymani. 1373-1378 [doi]
• When to Preempt in a Status Update System?Subhankar Banerjee, Sennur Ulukus. 1379-1384 [doi]
• Optimal Update Policy for the Monitoring of Distributed SourcesEric Graves 0001, Jake B. Perazzone, Kevin S. Chan. 1385-1390 [doi]
• AoII-Optimum Sampling of CTMC Information Sources Under Sampling Rate ConstraintsIsmail Cosandal, Nail Akar, Sennur Ulukus. 1391-1396 [doi]
• Section-Wise Revolving NBP-Like Decoders for QC-LDPC CodesQinshan Zhang, Bin Chen 0011, Tianqu Zhuang, Yong Jiang 0001, Shu-Tao Xia. 1397-1402 [doi]
• Interpreting Deepcode, a Learned Feedback CodeYingyao Zhou, Natasha Devroye, Gy. Turán, Milos Zefran. 1403-1408 [doi]
• Nested Construction of Polar Codes via TransformersSravan Kumar Ankireddy, S. Ashwin Hebbar, Heping Wan, Joonyoung Cho, Charlie Zhang 0001. 1409-1414 [doi]
• Dense KO Codes: Faster Convergence and Reduced Complexity Through Dense ConnectivityShubham Srivastava, Adrish Banerjee. 1415-1420 [doi]
• Quantum Channel Simulation in Fidelity is No More Difficult than State SplittingMichael X. Cao, Rahul Jain 0001, Marco Tomamichel. 1421-1425 [doi]
• Quantum Soft Covering and Decoupling with Relative Entropy CriterionXingyi He, Touheed Anwar Atif, S. Sandeep Pradhan. 1426-1431 [doi]
• Entanglement Sharing Across a Damping-Dephasing ChannelVikesh Siddhu, Dina Abdelhadi, Tomas Jochym-O'connor, John A. Smolin. 1432-1437 [doi]
• Simulation of Separable Quantum Measurements on Bipartite States via Likelihood POVMsArun Padakandla, Naqueeb Warsi. 1438-1443 [doi]
• Constructions of Binary MDS Array Codes with Optimal Cooperative Repair BandwidthLei Li, Xinchun Yu, Chenhao Ying, Liang Chen, Yuanyuan Dong, Yuan Luo. 1444-1449 [doi]
• Secure Storage Using Maximally Recoverable Locally Repairable CodesTim Janz, Hedongliang Liu, Rawad Bitar, Frank R. Kschischang. 1450-1455 [doi]
• On Low Field Size Constructions of Access-Optimal Convertible CodesSaransh Chopra, Francisco Maturana, K. V. Rashmi. 1456-1461 [doi]
• On Existence of Latency Optimal Uncoded Storage Schemes in Geo-Distributed Data Storage SystemsSrivathsa Acharya, P. Vijay Kumar, Viveck R. Cadambe. 1462-1467 [doi]
• On the Optimal Tradeoffs among Error Exponents in Active Sequential Multiple Hypothesis TestingChia-Yu Hsu, I-Hsiang Wang. 1468-1473 [doi]
• Sequential Adversarial Hypothesis TestingEeshan Modak, Mayank Bakshi, Bikash Kumar Dey, Vinod M. Prabhakaran. 1474-1479 [doi]
• A Unified Study on Sequentiality in Universal Classification with Empirically Observed StatisticsChing-Fang Li, I-Hsiang Wang. 1480-1485 [doi]
• Joint Sequential Detection and Isolation of Anomalies Under Composite HypothesesAnamitra Chaudhuri, Georgios Fellouris. 1486-1491 [doi]
• Pre-Decoder Processing Functions for a DMC with Mismatched DecodingJonathan Solel, Anelia Somekh-Baruch. 1492-1497 [doi]
• On Universal Decoding over Memoryless Channels with the Krichevsky-Trofimov EstimatorHenrique K. Miyamoto, Sheng Yang 0001. 1498-1503 [doi]
• A Double Maximization Approach for Optimizing the LM Rate of Mismatched DecodingLingyi Chen, Shitong Wu, Xinwei Li, Huihui Wu, Hao Wu, Wenyi Zhang. 1504-1509 [doi]
• Nearest Neighbor Decoding for a Class of Compound ChannelsFrancesc Molina, Priyanka Patel, Albert Guillén i Fàbregas. 1510-1513 [doi]
• Secure Network Function Computation: Function-SecurityYang Bai, Xuan Guang, Raymond W. Yeung. 1514-1519 [doi]
• New Bounds on Quantum Sample Complexity of Measurement ClassesMohsen Heidari, Wojciech Szpankowski. 1515-1520 [doi]
• Group Complete $-\{s\}$ Pliable Index CodingSina Eghbal, Badri N. Vellambi, Lawrence Ong, Parastoo Sadeghi. 1520-1525 [doi]
• GRAND-Assisted Random Linear Network Coding in Wireless BroadcastsRina Su, Qifu Tyler Sun, Mingshuo Deng, Zhongshan Zhang, Jinhong Yuan. 1526-1531 [doi]
• Computing Capacity of Binary Arithmetic Sum over Asymmetric Diamond NetworkRuze Zhang, Xuan Guang, Shenghao Yang 0001, Xueyan Niu, Bo Bai 0001. 1532-1537 [doi]
• Two-Weight Rank-Metric CodesFerdinando Zullo, Olga Polverino, Paolo Santonastaso, John Sheekey. 1538-1543 [doi]
• New Constructions for Linear Maximum Sum-Rank Distance CodesHuimin Lao, Yeow Meng Chee, Hao Chen 0029, Van Khu Vu. 1544-1549 [doi]
• Fusion over the Grassmannian for High-Rank Matrix CompletionJeremy S. Johnson, Huanran Li, Daniel L. Pimentel-Alarcón. 1550-1555 [doi]
• New Results on Coded Caching in Partially Cooperative D2D NetworksWenjie Guan, Kai Huang, Xinyu Xie, Jinbei Zhang, Kechao Cai, Xiaoxia Huang. 1556-1561 [doi]
• Two-Dimensional Multi-Access Coded Caching with Multiple Transmit AntennasK. K. Krishnan Namboodiri, Elizabath Peter, B. Sundar Rajan. 1562-1567 [doi]
• Improved Coded Caching from Two New Classes of PDAs from t-DesignsRashid Ummer N. T., B. Sundar Rajan. 1568-1573 [doi]
• Improved Hotplug Caching Scheme Using PDAsCharul Rajput, B. Sundar Rajan. 1574-1579 [doi]
• Information-Energy Capacity Region for SLIPT Systems Over Lognormal-Fading ChannelsKapila W. S. Palitharathna, Nizar Khalfet, Constantinos Psomas, George K. Karagiannidis, Ioannis Krikidis. 1580-1585 [doi]
• Computationally Efficient Codes for Strongly Dobrushin-Stambler Nonsymmetrizable Oblivious AVCsBikash Kumar Dey, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate, Y. Zhang. 1586-1591 [doi]
• Low-Complexity Pearson-Based Detection for AWGN Channels with OffsetAntonino Favano, Luca Barletta, Marco Sforzin, Paolo Amato, Marco Ferrari 0001. 1592-1597 [doi]
• An Efficient Inversion Encoding Scheme with k INV Signals on Bus TransmissionHongru Cao, Qi Cheng, Sian-Jheng Lin. 1598-1603 [doi]
• New Results on the Imbalance of FCSR Sequences and LFSR SubsequencesYueying Lou, Qichun Wang. 1604-1607 [doi]
• An Answer to an Open Problem on Balanced Boolean Functions with the Maximum Possible Walsh SupportsYueying Lou, Qichun Wang. 1608-1612 [doi]
• A Study of APN Functions in Dimension 7 Using AntiderivativesLukas Kölsch, Alexandr Polujan. 1613-1617 [doi]
• When does a Bent Concatenation Not Belong to the Completed Maiorana-McFarland Class?Sadmir Kudin, Enes Pasalic, Alexandr Polujan, Fengrong Zhang. 1618-1622 [doi]
• Federated Learning via Lattice Joint Source-Channel CodingSeyed Mohammad Azimi-Abarghouyi, Lav R. Varshney. 1623-1628 [doi]
• Hierarchical Federated Learning: The Interplay of User Mobility and Data HeterogeneityWei Dong, Howard H. Yang, Chenyuan Feng, Chen Sun. 1629-1634 [doi]
• Computation Selection: Scheduling Users to Enable Over-the-Air Federated LearningBobak Nazer, Krishna Narayanan. 1635-1640 [doi]
• Causal Impact Analysis for Asynchronous Decision MakingMert Kayaalp, Yunus Inan, Visa Koivunen, Ali H. Sayed. 1641-1645 [doi]
• Optimal Memory-Rate Tradeoff in Secure Coded Caching for Small Buffer or Small RateHan Fang, Nan Liu, Wei Kang. 1646-1651 [doi]
• On Demand-Private Hotplug Caching SystemsYinbin Ma, Daniela Tuninetti. 1652-1657 [doi]
• Coded Caching with File and Demand PrivacyChao Qi, Minquan Cheng, Xianhua Niu, Bin Dai 0003. 1658-1663 [doi]
• Placement Delivery Arrays for Coded Caching with Shared and Private CachesK. K. Krishnan Namboodiri, Elizabath Peter, B. Sundar Rajan. 1664-1669 [doi]
• Common Function Reconstruction with Information Swapping TerminalsTharindu Adikari, Stark C. Draper. 1670-1675 [doi]
• Distributed Source Coding Using Constrained-Random-Number GeneratorsJun Muramatsu. 1676-1681 [doi]
• On Channel Simulation with Causal Rejection SamplersDaniel Goc, Gergely Flamich. 1682-1687 [doi]
• Implicit and Explicit Formulas of the Joint RDF for a Tuple of Multivariate Gaussian Sources with Individual Square-Error DistortionsEvagoras Stylianou, Charalambos D. Charalambous, Themistoklis Charalambous. 1688-1693 [doi]
• Blahut-Arimoto Algorithm for Computing Capacity Region of Gaussian Vector Broadcast ChannelsTian Jiao, Yanlin Geng, Zai Yang. 1694-1699 [doi]
• Time-Shifted Alternating Gelfand-Pinsker Coding for Broadcast ChannelsConstantin Runge, Gerhard Kramer. 1700-1705 [doi]
• Achieving Gaussian Vector Broadcast Channel Capacity with Scalar LatticesM. Yusuf Sener, Gerhard Kramer, Shlomo Shamai Shitz, Ronald Böhnke, Wen Xu 0001. 1706-1711 [doi]
• Inter-Modal Coding in Broadcast Packet Erasure Channels with Varying StatisticsAlireza Vahid, Shih-Chun Lin. 1712-1717 [doi]
• Efficient Constructions of Non-Binary Codes Over Absorption ChannelsTuan Thanh Nguyen, Kui Cai 0001, Tony Q. S. Quek, Kees A. Schouhamer Immink. 1718-1723 [doi]
• Code Design for Duplex Read SequencingAdrian Vidal, Viduranga Bandara Wijekoon, Emanuele Viterbo. 1724-1729 [doi]
• On Achievable Rates for the Shotgun Sequencing Channel with ErasuresHrishi Narayanan, Prasad Krishnan, Nita Parekh. 1730-1735 [doi]
• On the Long-Term Behavior of k-tuples Frequencies in Mutation SystemsOhad Elishco. 1736-1741 [doi]
• Pseduo- Random and de Bruijn Array CodesTuvi Etzion. 1742-1747 [doi]
• A New Construction of Optimal Symmetrical ZCCSRajen Kumar, Prashant Kumar Srivastava, Sudhan Majhi. 1748-1752 [doi]
• Construction of Binary Odd Shift Complementary Pairs of All LengthsPiyush Priyanshu, Sudhan Majhi, Subhabrata Paul. 1753-1757 [doi]
• Improved Upper Bound for the Size of a Trifferent CodeSiddharth Bhandari, Abhishek Khetan. 1758-1763 [doi]
• Algorithms for Computing the Free Distance of Convolutional CodesZita Abreu, Joachim Rosenthal, Michael Schaller. 1764-1769 [doi]
• Linearity-Enhanced Serial List Decoding of Linearly Expurgated Tail-Biting Convolutional CodesWenhui Sui, Brendan Towell, Zihan Qu, Eugene Min, Richard D. Wesel. 1770-1775 [doi]
• Complementary Exclusion of Full Polynomials to Enable Dual List Decoding of Convolutional CodesZihan Qu, Amaael Antonini, Wenhui Sui, Eugene Min, Arthur Yang, Richard D. Wesel. 1776-1781 [doi]
• On Streaming Codes for Burst and Random ErrorsShobhit Bhatnagar, P. Vijay Kumar. 1782-1787 [doi]
• Generalized Step-Chirp Sequences with Flexible BandwidthCheng Du, Yi Jiang 0002. 1788-1793 [doi]
• Accelerating Quadratic Transform and WMMSEKaiming Shen, Ziping Zhao 0002, Yannan Chen, Zepeng Zhang, Hei Victor Cheng. 1794-1799 [doi]
• Electromagnetic Information Theory Motivated Near-Field Channel ModelZhongzhichao Wan, Jieao Zhu, Linglong Dai. 1800-1805 [doi]
• Task-Based Quantizer Design for Sensing With Random SignalsHang Ruan, Fan Liu. 1806-1811 [doi]
• Projective Systematic Authentication via Reed-Muller CodesHsuan-Po Liu, Hessam Mahdavifar. 1812-1817 [doi]
• A Convolutional Variant of the Niederreiter Cryptosystem with GRS CodesPaulo Almeida, Miguel Beltrá, Diego Napp. 1818-1823 [doi]
• A Key-Recovery Attack on the LCMQ Authentication ProtocolVu Nguyen, Thomas Johansson 0001, Qian Guo 0001. 1824-1829 [doi]
• Coding-Based Hybrid Post-Quantum Cryptosystem for Non-Uniform InformationSaar Tarnopolsky, Alejandro Cohen. 1830-1835 [doi]
• Fast FixMatch: Faster Semi-Supervised Learning with Curriculum Batch SizeJohn Chen 0002, Chen Dun, Anastasios Kyrillidis. 1836-1841 [doi]
• Robust Semi-supervised Learning via f-Divergence and α- Renyi DivergenceGholamali Aminian, Amirhossien Bagheri, Mahyar JafariNodeh, Radmehr Karimian, Mohammad Hossein Yassaee. 1842-1847 [doi]
• Fed-IT: Addressing Class Imbalance in Federated Learning through an Information- Theoretic LensShayan Mohajer Hamidi, Renhao Tan, Linfeng Ye, En-Hui Yang. 1848-1853 [doi]
• Efficient Unbiased SparsificationLeighton Barnes, Timothy Chow, Emma Cohen, Keith Frankston, Benjamin Howard, Fred Kochman, Daniel Scheinerman, Jeffrey M. Vanderkam. 1854-1859 [doi]
• A Multi-Server Publicly Verifiable Computation Scheme with Context-Hiding PropertyHong Chen, Jinyuan Li, Liang Feng Zhang. 1860-1865 [doi]
• Unconditional Security Using (Random) Anonymous Bulletin BoardAlbert Yu 0003, Hai H. Nguyen, Aniket Kate, Hemanta K. Maji. 1866-1871 [doi]
• An Improved Lower Bound on Oblivious Transfer Capacity via Interactive Erasure EmulationSo Suda, Shun Watanabe, Haruya Yamaguchi. 1872-1877 [doi]
• Towards Optimal Non-interactive Secure Multiparty Computation for Abelian ProgramsMaki Yoshida. 1878-1882 [doi]
• Rejection-Sampled Universal Quantization for Smaller Quantization ErrorsChih Wei Ling, Cheuk Ting Li. 1883-1888 [doi]
• Non-Linear Analog Processing Gains in Task-Based QuantizationMarian Temprana Alonso, Farhad Shirani 0001, Neil Irwin Bernardo, Yonina C. Eldar. 1889-1894 [doi]
• One-Shot Wyner-Ziv Compression of a Uniform SourceOguzhan Kubilay Ülger, Elza Erkip. 1895-1900 [doi]
• Distributed Local Sketching for £2 EmbeddingsNeophytos Charalambides, Arya Mazumdar. 1901-1906 [doi]
• Gaussian Channel Simulation with Rotated Dithered QuantizationSzymon Kobus, Lucas Theis, Deniz Gündüz. 1907-1912 [doi]
• Optimal Redundancy in Exact Channel SynthesisSharang M. Sriramu, Aaron B. Wagner. 1913-1918 [doi]
• Broadcast Channel Synthesis from Shared RandomnessMalhar A. Managoli, Vinod M. Prabhakaran. 1919-1924 [doi]
• Multi-terminal Strong Coordination Over Noisy Channels with Secrecy ConstraintsViswanathan Ramachandran, Tobias J. Oechtering, Mikael Skoglund. 1925-1930 [doi]
• Mutual Information of a class of Poisson-type Channels using Markov Renewal TheoryMaximilian Gehri, Nicolai Engelmann, Heinz Koeppl. 1931-1936 [doi]
• Capacity of Runlength-Limited and GC-Content Constrained Codes for DNA Data StorageFilip Paluncic, Daniella Paluncic, Bodhaswar T. Maharaj. 1937-1942 [doi]
• Representing Information on DNA Using Patterns Induced by Enzymatic LabelingDaniella Bar-Lev, Tuvi Etzion, Eitan Yaakobi, Zohar Yakhini. 1943-1948 [doi]
• Optimizing the Decoding Probability and Coverage Ratio of Composite DNATomer Cohen, Eitan Yaakobi. 1949-1954 [doi]
• On the Asymptotic Nonnegative Rank of Matrices and its Applications in Information TheoryYeow Meng Chee, Quoc-Tung Le, Hoang Ta 0001. 1955-1960 [doi]
• Group-Sparse Subspace Clustering with Elastic StarsHuanran Li, Daniel L. Pimentel-Alarcón. 1961-1966 [doi]
• On Counting Subsequences and Higher-Order Fibonacci NumbersHsin-Po Wang 0001, Chi-Wei Chin. 1967-1972 [doi]
• Directed Redundancy in Time SeriesJan Østergaard. 1973-1978 [doi]
• Streaming Codes for Three-Node Relay Networks with Burst ErasuresVinayak Ramkumar, Myna Vajha, M. Nikhil Krishnan. 1979-1984 [doi]
• An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional CodesZita Abreu, Julia Lieb, Michael Schaller. 1985-1990 [doi]
• On Streaming Codes for Simultaneously Correcting Burst and Random ErasuresShobhit Bhatnagar, Biswadip Chakraborty, P. Vijay Kumar. 1991-1996 [doi]
• Subset Adaptive Relaying for Streaming Erasure CodesMuhammad Ahmad Kaleem, Gustavo Kasper Facenda, Ashish Khisti. 1997-2002 [doi]
• Potential Functions and Percolation Thresholds of Coded Poisson ReceiversCheng-En Lee, Kuo-Yu Liao, Cheng-Shang Chang, Duan-Shin Lee. 2003-2008 [doi]
• A Novel Cross Domain Iterative Detection Based on the Interplay Between SPA and LMMSEShuangyang Li, Giuseppe Caire. 2009-2014 [doi]
• Multi-User SR-LDPC Codes via Coded Demixing with Applications to Cell-Free SystemsJamison R. Ebert, Jean-François Chamberland, Krishna R. Narayanan. 2015-2020 [doi]
• Quality Adaptation for Cache-Aided Degraded Broadcast ChannelsEleftherios Lampiris, Giuseppe Caire. 2021-2026 [doi]
• Asymptotics of Language Model AlignmentJoy Qiping Yang, Salman Salamatian, Ziteng Sun, Ananda Theertha Suresh, Ahmad Beirami. 2027-2032 [doi]
• Predicting Uncertainty of Generative LLMs with MARS: Meaning-Aware Response ScoringYavuz Faruk Bakman, Duygu Nur Yaldiz, Baturalp Buyukates, Salman Avestimehr, Chenyang Tao, Dimitrios Dimitriadis. 2033-2037 [doi]
• TexShape: Information Theoretic Sentence Embedding for Language ModelsKaan Kale, Homa Esfahanizadeh, Noel Elias, Oguzhan Baser, Muriel Médard, Sriram Vishwanath. 2038-2043 [doi]
• The Likelihood Gain of a Language Model as a Metric for Text SummarizationDana Levin, Alon Kipnis. 2044-2049 [doi]
• Quantum State Compression with Polar CodesJack Weinberg, Avijit Mandal, Henry D. Pfister. 2050-2055 [doi]
• Amplitude Transformation of Quantum State Based on QSVTLu Hou, Chang Lv. 2056-2061 [doi]
• Feynman Meets Turing: The Uncomputability of Quantum Gate-Circuit Emulation and ConcatenationYannik N. Böck, Holger Boche, Zoe Garcia del Toro, Frank H. P. Fitzek. 2062-2067 [doi]
• Rate-Limited Optimal Transport for Quantum Gaussian ObservablesHafez M. Garmaroudi, S. Sandeep Pradhan, Jun Chen. 2068-2073 [doi]
• Improved Bound for Robust Causal Bandits with Linear ModelsZirui Yan, Arpan Mukherjee, Burak Varici, Ali Tajer. 2074-2079 [doi]
• Multi-Armed Bandits with ProbingEray Can Elumar, Cem Tekin, Osman Yagan. 2080-2085 [doi]
• Federated Learning for Heterogeneous Bandits with Unobserved ContextsJiabin Lin, Shana Moothedath. 2086-2091 [doi]
• Explore-then-Commit Algorithms for Decentralized Two-Sided Matching MarketsTejas Pagare, Avishek Ghosh. 2092-2097 [doi]
• InfoMat: A Tool for the Analysis and Visualization Sequential Information TransferDor Tsur, Haim H. Permuter. 2098-2103 [doi]
• Symmetric Entropy Regions of Degrees Six and SevenZihan Li, Shaocheng Liu, Qi Chen. 2104-2109 [doi]
• Variational Characterizations of Sibson's α-Mutual InformationAmedeo Roberto Esposito, Michael Gastpar, Ibrahim Issa. 2110-2115 [doi]
• Neural Estimation of Entropic Optimal TransportTao Wang, Ziv Goldfeld. 2116-2121 [doi]
• Repairing a Single Erasure in Reed-Solomon Codes with Side InformationDinh Thi Xinh, Ba Thong Le, Son Hoang Dau, Serdar Boztas, Stanislav Kruglik, Han Mao Kiah, Emanuele Viterbo, Tuvi Etzion, Yeow Meng Chee. 2122-2127 [doi]
• A Formula for the I/O Cost of Linear Repair Schemes and Application to Reed-Solomon CodesZhongyan Liu, Zhifang Zhang. 2128-2133 [doi]
• Repairing with Zero Skip CostYeow Meng Chee, Son Hoang Dau, Tuvi Etzion, Han Mao Kiah, Yuan Luo 0003, Wenqin Zhang. 2134-2139 [doi]
• Repairing Schemes for Tamo-Barg CodesHan Cai, Ying Miao 0001, Moshe Schwartz 0001, Xiaohu Tang. 2140-2145 [doi]
• On the Separability of Beamforming for Reconfigurable Intelligent Surfaces Under Statistical CSIMaryam Farahnak-Ghazani, Negar Daryanavardan, Aria Nosratinia. 2146-2151 [doi]
• Decentralized Expectation Propagation for Semi-Blind Channel Estimation in Cell-Free NetworksZilu Zhao, Dirk Slock. 2152-2156 [doi]
• Novel Bounds for Semi-Blind Multiple-Access in Massive MIMOGeorge Vershinin, Asaf Cohen 0001, Omer Gurewitz. 2157-2162 [doi]
• Achievable Rate for RIS-Assisted Sparse Channel with State TrainingNegar Daryanavardan, Aria Nosratinia. 2163-2168 [doi]
• On the Existence of Cyclic Lattice CodesChengpin Luo, Brian M. Kurkoski. 2169-2173 [doi]
• On the Equivalence Between Probabilistic Shaping and Geometric Shaping: A Polar Lattice PerspectiveLing Liu, Shanxiang Lyu, Cong Ling 0001, Baoming Bai. 2174-2179 [doi]
• Voronoi Constellations of Generalized Construction D' Lattices from q-ary CodesAna Paula S. Pierini, Franciele C. Silva, Sueli I. R. Costa. 2180-2185 [doi]
• Construction $\pi_{A}$ Lattices Extended to Hurwitz Quaternion IntegersJuliana G. F. Souza, Sueli I. R. Costa, Cong Ling 0001. 2186-2191 [doi]
• New Partial Orders of Polar Codes for BMSCLiuquan Yao, Zhichao Liu, Yuan Li, Huazi Zhang, Jun Wang 0062, Guiying Yan, Zhi-Ming Ma. 2192-2197 [doi]
• Strong Polarization for Shortened and Punctured Polar CodesBoaz Shuval, Ido Tal. 2198-2203 [doi]
• PAC Code Rate-Profile Design Using Search-Constrained Optimization AlgorithmsMohsen Moradi, David G. M. Mitchell. 2204-2209 [doi]
• Trellis-Based Construction of Polar Codes for SCL DecodingXinyuanmeng Yao, Xiangping Zheng, Xiao Ma 0001. 2210-2215 [doi]
• Throughput and Latency of Network Coding in Line Networks with OutagesYanyan Dong, Shenghao Yang 0001, Jie Wang 0049, Fan Cheng 0002. 2216-2221 [doi]
• Coded Caching for Hierarchical Two-Layer Networks with Coded PlacementRajlaxmi Pandey, Charul Rajput, B. Sundar Rajan. 2222-2227 [doi]
• A Linear Feedback Coding Scheme for Computation Over Gaussian Multiple-Access ChannelsBin Dai 0003, Fan Cheng, Yuhan Yang, Dengfeng Xia. 2228-2232 [doi]
• Coded Multi-User Information Retrieval with a Multi-Antenna Helper NodeMilad Abolpour, Mohammad Javad Salehi, Soheil Mohajer, Seyed Pooya Shariatpanahi, Antti Tölli. 2233-2238 [doi]
• Boundary Multiple Measurement Vectors for Multi-Coset SamplerDong Xiao, Yun Lin, Jian Wang. 2239-2244 [doi]
• On the Generalized Sampling Expansion (GSE) for Graph SignalsReeteswar Rajguru, Balaji Udayagiri, Amitalok J. Budkuley, Stefano Rini. 2245-2250 [doi]
• Log-Concave Coupling for Sampling Neural Net PosteriorsCurtis McDonald, Andrew R. Barron. 2251-2256 [doi]
• Towards Optimal Inverse Temperature in the Gibbs AlgorithmYuheng Bu. 2257-2262 [doi]
• A Joint Code and Belief Propagation Decoder Design for Quantum LDPC CodesSisi Miao, Jonathan Mandelbaum, Holger Jäkel, Laurent Schmalen. 2263-2268 [doi]
• Upper Bounds on the Size of Entanglement-Assisted Codeword Stabilized Codes Using Semidefinite ProgrammingChing-Yi Lai, Pin-Chieh Tseng, Wei-Hsuan Yu. 2269-2274 [doi]
• Quantum Codes Derived from One-Generator Quasi-Twisted CodesAkram Saleh, Mohammad Reza Soleymani. 2275-2280 [doi]
• Robust Syndrome Extraction via BCH EncodingEren Guttentag, Andrew Nemec, Kenneth R. Brown. 2281-2286 [doi]
• BAI in Exponential Family: Efficiency and OptimalityArpan Mukherjee, Ali Tajer. 2287-2292 [doi]
• Best Arm Identification with Arm ErasuresKota Srinivas Reddy, P. N. Karthik, Vincent Y. F. Tan. 2293-2298 [doi]
• Optimal Stopping Rules for Best Arm Identification in Stochastic Bandits under Uniform SamplingVedang Gupta, Yash Gadhia, Shivaram Kalyanakrishnan, Nikhil Karamchandani. 2299-2304 [doi]
• Minimax Regret with Unbounded WeightsMichael Drmota, Philippe Jacquet, Changlong Wu, Wojciech Szpankowski. 2305-2310 [doi]
• On the Relation Between the Common Information Dimension and Wyner Common InformationOsama A. Hanna, Xinlin Li, Suhas N. Diggavi, Christina Fragouli. 2311-2316 [doi]
• Common Randomness Generation from Finite Compound SourcesRami Ezzine, Moritz Wiese, Christian Deppe, Holger Boche. 2317-2322 [doi]
• Shared Information Under Simple Markov IndependenciesMadhura Pathegama, Sagnik Bhattacharya. 2323-2328 [doi]
• Explicit Formula for Partial Information DecompositionAobo Lyu, Andrew Clark 0001, Netanel Raviv. 2329-2334 [doi]
• A Binary Linear Functional-Repair Regenerating Code on 72 Coding Spaces Related to PG(2, 8)Junming Ke, Henk D. L. Hollmann, Ago-Erik Riet. 2335-2340 [doi]
• Construction of Locally Repairable Array Codes with Optimal Repair Bandwidth Under the Rack-Aware Storage ModelYumeng Yang, Han Cai, Xiaohu Tang. 2341-2346 [doi]
• Set Transformation: Trade-Off Between Repair Bandwidth and Sub-PacketizationHao Shi, Zhengyi Jiang, Zhongyi Huang, Bo Bai 0001, Gong Zhang 0001, Hanxu Hou. 2347-2352 [doi]
• A Family of Access-Friendly MDS Array CodesZhongyan Liu, Zhifang Zhang. 2353-2358 [doi]
• Asymptotic Capacity of Non-Coherent One-Bit MIMO Channels with Block FadingSheng Yang, Richard Combes. 2359-2364 [doi]
• On $2\times 2$ MIMO Gaussian Channels with a Small Discrete-Time Peak-Power ConstraintAlex Dytso, Luca Barletta, Gerhard Kramer. 2365-2370 [doi]
• On the Capacity of Gaussian "Beam-Pointing" Channels with Block Memory and FeedbackSiyao Li, Fernando Pedraza, Giuseppe Caire. 2371-2376 [doi]
• Universal Transmission and Combining for Ultra-Reliable MIMO RelayingBarak Avraham, Elad Domanovitz, Uri Erez. 2377-2382 [doi]
• On One-Orbit Cyclic Subspace Codes of Gq(n, 3)Chiara Castello, Olga Polverino, Ferdinando Zullo. 2383-2388 [doi]
• Optimal full-length cyclic orbit flag codesClementa Alonso-González, Miguel Ángel Navarro-Párez. 2389-2393 [doi]
• Subspace Coding for Spatial SensingHessam Mahdavifar, Robin Rajamäki, Piya Pal. 2394-2399 [doi]
• Decoding Analog Subspace Codes: Algorithms for Character-Polynomial CodesSamin Riasat, Hessam Mahdavifar. 2400-2405 [doi]
• A Path Metric Based Construction of Polarization-Adjusted Convolutional CodesTyler Kann, Shrinivas Kudekar, Matthieu R. Bloch. 2406-2411 [doi]
• Successive Cancellation Sampling Decoder: An Attempt to Analyze List Decoding TheoreticallyHsin-Po Wang 0001, Venkatesan Guruswami. 2412-2417 [doi]
• Outer Code Designs for Augmented and Local-Global Polar Code ArchitecturesZiyuan Zhu, Paul H. Siegel. 2418-2423 [doi]
• Code Rate Optimization via Neural Polar DecodersZiv Aharoni, Bashar Huleihel, Henry D. Pfister, Haim H. Permuter. 2424-2429 [doi]
• A probabilistic analysis on general probabilistic scheduling problemsDaiki Suruga. 2430-2435 [doi]
• GRLinQ: A Distributed Link Scheduling Mechanism with Graph Reinforcement LearningZhiwei Shan, Xinping Yi, Le Liang, Chung-Shou Liao, Shi Jin 0002. 2436-2441 [doi]
• Networked Control with Hybrid Automatic Repeat Request ProtocolsTouraj Soleymani, John S. Baras, Deniz Gündüz. 2442-2447 [doi]
• Tight Differentiable Relaxation of Sum Ergodic Capacity Maximization for Clustered Cell-Free NetworkingBoxiang Ren, Han Hao, Ziyuan Lyu, Jingchen Peng, Junyuan Wang, Hao Wu. 2448-2453 [doi]
• QML-IB: Quantized Collaborative Intelligence between Multiple Devices and the Mobile NetworkJingchen Peng, Boxiang Ren, Lu Yang 0003, Chenghui Peng, Panpan Niu, Hao Wu 0060. 2454-2459 [doi]
• An Achievable and Analytic Solution to Information Bottleneck for Gaussian MixturesYi Song 0011, Kai Wan, Zhenyu Liao, Hao Xu 0003, Giuseppe Caire, Shlomo Shamai. 2460-2465 [doi]
• An Expectation-Maximization Relaxed Method for Privacy FunnelLingyi Chen, Jiachuan Ye, Shitong Wu, Huihui Wu, Hao Wu, Wenyi Zhang. 2466-2471 [doi]
• The Persuasion BottleneckMichael Gastpar, Aayush Rajesh. 2472-2477 [doi]
• Belief Propagation Decoding of Quantum LDPC Codes with Guided DecimationHanwen Yao, Waleed Abu Laban, Christian Häger, Alexandre Graell i Amat, Henry D. Pfister. 2478-2483 [doi]
• Entanglement-Assisted Quantum Codes from a Class of Unitary MatricesLin Sok, Martianus Frederic Ezerman, San Ling, Mareth Mam. 2484-2489 [doi]
• Decoding Strategies for Generalized Quantum Data-Syndrome Coding ProblemsKao-Yueh Kuo, Ching-Yi Lai. 2490-2495 [doi]
• Improved Logical Error Rate via List Decoding of Quantum Polar CodesAnqi Gong, Joseph M. Renes. 2496-2501 [doi]
• Valid: a Validated Algorithm for Learning in Decentralized Networks with Possible Adversarial PresenceMayank Bakshi, Sara Ghasvarianjahromi, Yauhen Yakimenka, Allison Beemer, Oliver Kosut, Jörg Kliewer. 2502-2507 [doi]
• Secure Inference for Vertically Partitioned Data Using Multiparty Homomorphic EncryptionShuangyi Chen, Yue Ju, Zhongwen Zhu, Ashish Khisti. 2508-2513 [doi]
• Byzantine-Resilient Federated Principal Subspace EstimationAnkit Pratap Singh, Namrata Vaswani. 2514-2519 [doi]
• Robust Distributed Gradient Descent to Corruption over Noisy ChannelsShuche Wang, Vincent Y. F. Tan. 2520-2525 [doi]
• Several Interpretations of Max-Sliced Mutual InformationDor Tsur, Haim H. Permuter, Ziv Goldfeld. 2526-2531 [doi]
• Computing Augustin Information via Hybrid Geodesically Convex OptimizationGuan-Ren Wang, Chung-En Tsai, Hao-Chung Cheng, Yen-Huan Li. 2532-2537 [doi]
• A New Characterization Of Augustin Information And MeanHao-Chung Cheng, Baris Nakiboglu. 2538-2543 [doi]
• On Doeblin Curves and Their PropertiesWilliam Lu, Anuran Makur, Japneet Singh. 2544-2549 [doi]
• Distributed Structured Matrix MultiplicationDerya Malak. 2550-2555 [doi]
• Distributed Matrix Multiplication with Straggler Tolerance Using Algebraic Function FieldsAdrián Fidalgo-Díaz, Umberto Martínez-Peñas. 2556-2561 [doi]
• Flexible Field Sizes in Secure Distributed Matrix Multiplication via Efficient Interference CancellationOkko Makkonen. 2562-2567 [doi]
• Secure Distributed Matrix Multiplication with PrecomputationRyann Cartor, Rafael G. L. D'Oliveira, Salim El Rouayheb, Daniel Heinlein, David A. Karpuk, Alex Sprintson. 2568-2573 [doi]
• Distribution-Preserving Integrated Sensing and Communication with Secure ReconstructionYiqi Chen, Tobias J. Oechtering, Holger Boche, Mikael Skoglund, Yuan Luo 0003. 2574-2579 [doi]
• Transmitter Actions for Secure Integrated Sensing and CommunicationTruman Welling, Onur Günlü, Aylin Yener. 2580-2585 [doi]
• Fundamental Limits of Communication-Assisted Sensing in ISAC SystemsFuwang Dong, Fan Liu 0005, Shihang Lu, Yifeng Xiong, Weijie Yuan, Yuanhao Cui. 2586-2591 [doi]
• Bistatic Integrated Sensing and Communication over Memoryless Relay ChannelsYao Liu 0007, Min Li 0008, Lawrence Ong, Aylin Yener. 2592-2597 [doi]
• Nested Construction of $\mathbb{Z}_{2^{L}} \text{-Linear}$ CodesGustavo Terra Bastos, Maiara F. Bollauf, Agnaldo José Ferrari, Øyvind Ytrehus. 2598-2603 [doi]
• Efficient Root-Finding for Interpolation-Based Decoding of Elliptic and Hyperelliptic CodesJianguo Zhao, Jiwei Liang, Li Chen. 2604-2609 [doi]
• Upper Bounds on the Rate of Linear Q-Ary K-Hash CodesStefano Della Fiore, Marco Dalai. 2610-2615 [doi]
• Weighted-Hamming Metric for Parallel ChannelsSebastian Bitzer, Alberto Ravagnani, Violetta Weger. 2616-2621 [doi]
• Random Staircase Generator Matrix CodesQianfan Wang, Yixin Wang, Yiwen Wang, Jifan Liang, Xiao Ma 0001. 2622-2627 [doi]
• Optimal Almost-Balanced SequencesDaniella Bar-Lev, Adir Kobovich, Orian Leitersdorf, Eitan Yaakobi. 2628-2633 [doi]
• One Code Fits All: Strong Stuck-At Codes for Versatile Memory EncodingRoni Con, Ryan Gabrys, Eitan Yaakobi. 2634-2639 [doi]
• Private Repair of a Single Erasure in Reed-Solomon CodesStanislav Kruglik, Han Mao Kiah, Son Hoang Dau, Eitan Yaakobi. 2640-2645 [doi]
• A New Approach to Harnessing Side Information in Multi-Server Private Information RetrievalNingze Wang, Anoosheh Heidarzadeh, Alex Sprintson. 2646-2651 [doi]
• Achieving Capacity of PIR with Private Side Information with Low Sub-packetization and without MDS CodesLeila Erhili, Anoosheh Heidarzadeh. 2652-2657 [doi]
• The Capacity of Symmetric Private Information Retrieval with Private Noisy Side InformationHassan ZivariFard, Rémi A. Chou, Xiaodong Wang 0001. 2658-2663 [doi]
• Dual-Source Symmetric PIR Without Data Replication or Shared RandomnessRémi A. Chou. 2664-2669 [doi]
• An Information-Theoretic Framework for Out-of-Distribution GeneralizationWenliang Liu, Guanding Yu, Lele Wang 0001, Renjie Liao. 2670-2675 [doi]
• A Note on Generalization Bounds for Losses with Finite MomentsBorja Rodríguez Gálvez, Omar Rivasplata, Ragnar Thobaben, Mikael Skoglund. 2676-2681 [doi]
• Data-Dependent Generalization Bounds via Variable-Size CompressibilityMilad Sefidgaran, Abdellatif Zaidi. 2682-2687 [doi]
• Hierarchical Generalization Bounds for Deep Neural NetworksHaiyun He, Christina Lee Yu, Ziv Goldfeld. 2688-2693 [doi]
• Optimal Lower Bound of the Average Indeterminate Length Lossless Quantum Block EncodingGeorge Androulakis, Rabins Wosti. 2694-2699 [doi]
• Graph Neural Networks for Enhanced Decoding of Quantum LDPC CodesAnqi Gong, Sebastian Cammerer, Joseph M. Renes. 2700-2705 [doi]
• A Family of Permutationally Invariant Quantum CodesArda Aydin, Max A. Alekseyev, Alexander Barg. 2706-2711 [doi]
• Abelian Group Codes for Classical and CQ Channel Coding: One-Shot and Asymptotic Rate BoundsJames Chin-Jen Pang, S. Sandeep Pradhan, Hessam Mahdavifar. 2712-2717 [doi]
• Sparsity-Based Secure Gradient Aggregation for Resource-Constrained Federated LearningHasin Us Sami, Basak Güler. 2718-2723 [doi]
• Secure Submodel Aggregation for Resource-Aware Federated LearningHasin Us Sami, Basak Güler. 2724-2729 [doi]
• On the Optimality of Secure Aggregation with Uncoded Groupwise Keys Against User Dropouts and User CollusionZiting Zhang, Jiayu Liu, Kai Wan, Hua Sun 0001, J. Mingyue, Giuseppe Caire. 2730-2735 [doi]
• Optimal Information Theoretic Secure Aggregation with Uncoded Groupwise KeysKai Wan, Hua Sun 0001, Mingyue Ji, Tiebin Mi, Giuseppe Caire. 2736-2741 [doi]
• Statistic Maximal LeakageShuaiqi Wang, Zinan Lin 0001, Giulia Fanti. 2742-2747 [doi]
• Binary Maximal LeakageRobinson D. H. Cung, Yanina Y. Shkel, Ibrahim Issa. 2748-2753 [doi]
• Maximal Guesswork LeakageGowtham R. Kurri, Malhar A. Managoli, Vinod M. Prabhakaran. 2754-2759 [doi]
• A Cross Entropy Interpretation of Renyi Entropy for $\alpha$ -leakageNi Ding, Mohammad Amin Zarrabian, Parastoo Sadeghi. 2760-2765 [doi]
• Local Decoding in Distributed Approximate ComputingDeheng Yuan, Tao Guo, Zhongyi Huang, Shi Jin 0003. 2766-2771 [doi]
• Non-Binary Covering Codes for Low-Access ComputationsVinayak Ramkumar, Netanel Raviv, Itzhak Tamo. 2772-2777 [doi]
• Rate-Limited Shuffling for Distributed ComputingShanuja Sasi, Onur Günlü. 2778-2783 [doi]
• On Decentralized Linearly Separable Computation With the Minimum Computation CostHaoning Chen, Minquan Cheng, Ziyu Zhang, Kai Liang, Zhenhao Huang, Youlong Wu. 2784-2789 [doi]
• Integrated Sensing and Communication in the Finite Blocklength RegimeHoma Nikbakht, Michèle A. Wigger, Shlomo Shamai, H. Vincent Poor. 2790-2795 [doi]
• On the Fundamental Tradeoff of Joint Communication and Quickest Change DetectionDaewon Seo, Sung-Hoon Lim. 2796-2801 [doi]
• Integrated Sensing and Communication Exploiting Prior Information: How Many Sensing Beams are Needed?Chan Xu, Shuowen Zhang. 2802-2807 [doi]
• Beamforming Design for Integrated Sensing and Communications Using Uplink-Downlink DualityKareem M. Attiah, Wei Yu 0001. 2808-2813 [doi]
• Error Correction from Partial Information Via Norm-Trace CodesEduardo Camps-Moreno, Gretchen L. Matthews, Welington Santos. 2814-2819 [doi]
• Asymptotic Construction of Locally Repairable Codes with Multiple Recovering SetsSongsong Li, Shu Liu 0004, Liming Ma, Yunqi Wan, Chaoping Xing. 2820-2825 [doi]
• On ML Decoding of Binary Cyclic-gap Constant Weight CodesBirenjith Sasidharan, Emanuele Viterbo, Son Hoang Dau. 2826-2831 [doi]
• An Optimal Sequence Reconstruction Algorithm for Reed-Solomon CodesShubhransh Singhvi, Roni Con, Han Mao Kiah, Eitan Yaakobi. 2832-2837 [doi]
• Approximate Locally Decodable Codes with Constant Query Complexity and Nearly Optimal RateGeoffrey Mon, Dana Moshkovitz, Justin Oh. 2838-2843 [doi]
• Reverse PAC Codes: Look-Ahead List DecodingXinyi Gu, Mohammad Rowshan, Jinhong Yuan. 2844-2849 [doi]
• Game of Coding: Beyond Trusted MajoritiesHanzaleh Akbari Nodehi, Viveck R. Cadambe, Mohammad Ali Maddah-Ali. 2850-2855 [doi]
• PoW Security-Latency and Transaction RateMustafa Doger, Sennur Ulukus. 2856-2861 [doi]
• Weakly Private Information Retrieval from Heterogeneously Trusted ServersYu-Shin Huang, Wenyuan Zhao, Ruida Zhou, Chao Tian 0002. 2862-2867 [doi]
• A Capacity Result on Weakly-Private Information RetrievalSong Chen, Haobo Jia, Zhuqing Jia. 2868-2873 [doi]
• Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information RetrievalOkko Makkonen, David A. Karpuk, Camilla Hollanti. 2874-2879 [doi]
• Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query AttackNeehar Verma, Camilla Hollanti. 2880-2885 [doi]
• CRYSTALS-Kyber With Lattice QuantizerShuiyin Liu, Amin Sakzad. 2886-2891 [doi]
• Network Coding-Based Post-Quantum Cryptography for Multi-Users with Different Security PermissionsAlejandro Cohen, Rafael G. L. D'Oliveira. 2892-2897 [doi]
• Optimum Fingerprinting Function for Winternitz One-Time SignatureMotonari Honda, Yuichi Kaji. 2898-2902 [doi]
• Exploiting Signature Leakages: Breaking Enhanced pqsigRMThomas Debris-Alazard, Pierre Loisel, Valentin Vasseur. 2903-2908 [doi]
• An Improved Upper Bound for Distributed Hypothesis TestingYuval Kochman. 2909-2914 [doi]
• Practical Short-Length Coding Schemes for Binary Distributed Hypothesis TestingElsa Dupraz, Ismaila Salihou Adamou, Reza Asvadi, Tad Matsumoto. 2915-2920 [doi]
• Sample Complexity of Locally Differentially Private Quantum Hypothesis TestingHao-Chung Cheng, Christoph Hirche, Cambyse Rouzé. 2921-2926 [doi]
• Optimal Distributed Quantizer Design for Binary Classification of Conditionally Independent Vector SourcesSara Zendehboodi, Sorina Dumitrescu. 2927-2932 [doi]
• Generalized Concatenated Polarization KernelsPeter Trifonov. 2933-2938 [doi]
• Near-Optimal Generalized Decoding of Polar-like CodesPeihong Yuan, Ken R. Duffy, Muriel Médard. 2939-2944 [doi]
• Weight Structure of Low/High-Rate Polar Codes and Its ApplicationsMohammad Rowshan, Vlad-Florin Dragoi, Jinhong Yuan. 2945-2950 [doi]
• Finite-Length Analysis of Polar Secrecy Codes for Wiretap ChannelsHessam Mahdavifar, Fariba Abbasi. 2951-2956 [doi]
• Soft Guessing Under Log-Loss Distortion Allowing ErrorsShota Saito. 2957-2962 [doi]
• What can Information Guess? Guessing Advantage vs. Rényi Entropy for Small LeakagesJulien Béguinot, Olivier Rioul. 2963-2968 [doi]
• Feedback Capacity of Nonlinear Decision Models with General Noise: Gaussian Applications with Filtering and Control Riccati EquationsCharalambos D. Charalambous, Stelios Louka. 2969-2974 [doi]
• Improved Bounds on the Interactive Capacity via Error Pattern AnalysisMudit Aggarwal, Manuj Mukherjee. 2975-2980 [doi]
• One-Shot Multiple Access Channel SimulationAditya Nema, Sreejith Sreekumar, Mario Berta. 2981-2986 [doi]
• Coded Many-User Multiple Access via Approximate Message PassingXiaoqi Liu, Kuan Hsieh, Ramji Venkataramanan. 2987-2992 [doi]
• Many-user multiple access with random user activityXiaoqi Liu, Pablo Pascual Cobo, Ramji Venkataramanan. 2993-2998 [doi]
• Compute-Forward Multiple Access for Gaussian Fast Fading ChannelsLanwei Zhang, Jingge Zhu, Jamie S. Evans. 2999-3004 [doi]
• Efficient Designs for Threshold Group Testing Without GapThach V. Bui, Yeow Meng Chee, Van Khu Vu. 3005-3010 [doi]
• Threshold Saturation for Quantitative Group Testing with Low-Density Parity-Check CodesMgeni Makambi Mashauri, Alexandre Graell i Amat, Michael Lentmaier. 3011-3016 [doi]
• Quantitative Group Testing with Tunable AdaptationMahdi Soleymani, Tara Javidi. 3017-3022 [doi]
• Noise-Tolerant Codebooks for Semi-Quantitative Group Testing: Application to Spatial GenomicsKok Hao Chen, Duc Tu Dao, Han Mao Kiah, Van Long Phuoc Pham, Eitan Yaakobi. 3023-3028 [doi]
• The Bethe Partition Function and the SPA for Factor Graphs based on Homogeneous Real Stable PolynomialsYuwen Huang, Pascal O. Vontobel. 3029-3034 [doi]
• Bounding Weakly Correlated Products from Below: Supermodularity is All You NeedDimitris Achlioptas, Kostas Zampetakis. 3035-3040 [doi]
• A Random CSP with Connections to Discrepancy Theory and Randomized TrialsEren C. Kizildag. 3041-3046 [doi]
• An Encoder-Decoder Approach for Packing CirclesAkshay Kiran Jose, Gangadhar Karevvanavar, Rajshekhar V. Bhat. 3047-3052 [doi]
• Differential-Privacy CapacityWael Alghamdi, Shahab Asoodeh, Flávio P. Calmon, Oliver Kosut, Lalitha Sankar. 3053-3058 [doi]
• On the Extreme Points of the (0, δ) - Differential Privacy PolytopeKaran Elangovan, Varun Jog. 3059-3064 [doi]
• Achieving the Exactly Optimal Privacy-Utility Trade-Off with Low Communication Cost via Shared RandomnessSeung-Hyun Nam, Hyun Young Park, Si-Hyeon Lee. 3065-3070 [doi]
• Quantifying Privacy via Information DensityLeonhard Grosse, Sara Saeidian, Parastoo Sadeghi, Tobias J. Oechtering, Mikael Skoglund. 3071-3076 [doi]
• Nearest Neighbor Representations of Neural CircuitsKordag Mehmet Kilic, Jin Sima, Jehoshua Bruck. 3077-3082 [doi]
• On the Non-Computability of Convex Optimization ProblemsHolger Boche, Andrea Grigorescu, Rafael F. Schaefer, H. Vincent Poor. 3083-3088 [doi]
• A Mathematical Framework for Computability Aspects of Algorithmic TransparencyHolger Boche, Adalbert Fono, Gitta Kutyniok. 3089-3094 [doi]
• Coded Computing Meets Quantum Circuit Simulation: Coded Parallel Tensor Network Contraction AlgorithmJin Lee, Zheng Zhang, Sofía González-García, Haewon Jeong. 3095-3100 [doi]
• Quantum Wiretap Channel Coding Assisted by Noisy CorrelationMinglai Cai, Andreas Winter. 3101-3105 [doi]
• Resource-Efficient Entanglement-Assisted Covert Communications over Bosonic ChannelsShi-Yuan Wang, Shang-Jen Su, Matthieu R. Bloch. 3106-3111 [doi]
• Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann MeasurementSoham Ghosh, Vladlen Galetsky, Pol Julià Farré, Christian Deppe, Roberto Ferrara, Holger Boche. 3112-3117 [doi]
• New Security Proof of a Restricted High-Dimensional QKD ProtocolHasan Iqbal, Walter O. Krawec. 3118-3123 [doi]
• One-Shot Coding over General Noisy NetworksYanxiao Liu 0003, Cheuk Ting Li. 3124-3129 [doi]
• DoF Analysis for (M, N)-Channels through a Number-Filling PuzzleYue Bi, Yue Wu 0010, Cunqing Hua. 3130-3135 [doi]
• On the capacity region of some classes of interference channelsAmin Gohari, Chandra Nair, Jinpei Zhao. 3136-3141 [doi]
• On Permutation Capacity Regions of Multiple-Access ChannelsWilliam Lu, Anuran Makur. 3142-3147 [doi]
• Break-Resilient Codes for Forensic 3D FingerprintingCanran Wang, Jin Sima, Netanel Raviv. 3148-3153 [doi]
• Near Optimal Constructions of Frameproof CodesMiao Liu, Zengjiao Ma, Chong Shangguan. 3154-3159 [doi]
• On the Affine Permutation Group of Certain Decreasing Cartesian CodesEduardo Camps-Moreno, Hiram H. López, Eliseo Sarmiento, Ivan Soprunov. 3160-3165 [doi]
• Window Weight Limited Gray Codes and Robust Positioning SequencesYeow Meng Chee, Huimin Lao, Tien Long Nguyen, Van Khu Vu. 3166-3171 [doi]
• Proving Information Inequalities by Gaussian EliminationLaigang Guo, Raymond W. Yeung, Xiao-Shan Gao. 3172-3177 [doi]
• Properties of the Strong Data Processing Constant for Rényi DivergenceLifu Jin, Amedeo Roberto Esposito, Michael Gastpar. 3178-3183 [doi]
• Self Improvement of the McEliece- Yu InequalityAndrei Tanasescu, Pantelimon George Popescu. 3184-3188 [doi]
• A Poisson Decomposition for Information and the Information-Event DiagramCheuk Ting Li. 3189-3194 [doi]
• Enhancing the Maximum Tolerable Number of Active Users for Unsourced Random AccessShan Lu 0003, Hiroshi Kamabe. 3195-3200 [doi]
• Enhanced ODMA with Channel Code Design and Pattern Collision Resolution for Unsourced Multiple AccessJianxiang Yan, Guanghui Song, Ying Li 0002, Zhaoji Zhang, Yuhao Chi. 3201-3206 [doi]
• Worst-Case Per-User Error Bound for Asynchronous Unsourced Multiple AccessJyun-Sian Wu, Pin-Hsun Lin, Marcel A. Mross, Eduard A. Jorswieck. 3207-3212 [doi]
• Unsourced Random Access in MIMO Quasi-Static Rayleigh Fading Channels with Finite BlocklengthJunyuan Gao, Yongpeng Wu 0001, Giuseppe Caire, Wei Yang 0001, Wenjun Zhang 0001. 3213-3218 [doi]
• Sparsity-Constrained Community-Based Group TestingSarthak Jain, Martina Cardone, Soheil Mohajer. 3219-3224 [doi]
• Group Testing with General Correlation Using HypergraphsHesam Nikpey, Saswati Sarkar, Shirin Saeedi Bidokhti. 3225-3230 [doi]
• Isolate and then Identify: Rethinking Adaptive Group TestingHsin-Po Wang 0001, Venkatesan Guruswami. 3231-3236 [doi]
• List-Decoding Separable Matrices for Non-Adaptive Combinatorial Group TestingJinping Fan, Yujie Gu, Ying Miao 0001, Zhebin Yu. 3237-3242 [doi]
• Less than 1-Bit Control of an Unstable AR Process with 1-Bit QuantizersRachel Bonen, Asaf Cohen 0001. 3243-3248 [doi]
• Detection of False Data Injection Attacks in Cyber-Physical SystemsSouvik Das, Avishek Ghosh, Debasish Chatterjee. 3249-3254 [doi]
• Coordination Coding with Causal Encoder for Vector-Valued Witsenhausen CounterexampleMengyuan Zhao, Maël Le Treust, Tobias J. Oechtering. 3255-3260 [doi]
• Coded Kalman Filtering over MIMO Gaussian Channels with FeedbackBarron Han, Victoria Kostina, Babak Hassibi, Oron Sabag. 3261-3266 [doi]
• HetDAPAC: Distributed Attribute-Based Private Access Control with Heterogeneous AttributesShreya Meel, Sennur Ulukus. 3267-3272 [doi]
• Interactive Byzantine-Resilient Gradient Coding for General Data AssignmentsShreyas Jain, Luis Maßny, Christoph Hofmeister, Eitan Yaakobi, Rawad Bitar. 3273-3278 [doi]
• On Securing Analog Lagrange Coded Computing from Colluding AdversariesRimpi Borah, J. Harshan. 3279-3284 [doi]
• Information Exchange is Harder with Noise at SourceManuj Mukherjee, Ran Gelles. 3285-3290 [doi]
• Infodemic Source Detection: Enhanced Formulations with Information FlowChao Zhao, Zimeng Wang, Qiaoqiao Zhou, Chee-Wei Tan 0001, Chung Chan. 3291-3296 [doi]
• Computation in Server-Assisted Noisy NetworksManuj Mukherjee, Ran Gelles. 3297-3301 [doi]
• The Benefit of More Bad Choices in Observational LearningPawan Poojary, Randall Berry. 3302-3307 [doi]
• Maximal $\alpha$ - Leakage for Quantum Privacy Mechanisms and Operational Meaning of Measured Renyi CapacityBo-Yu Yang, Hsuan Yu, Hao-Chung Cheng. 3308-3313 [doi]
• Quantum Private Membership AggregationAlptug Aytekin, Mohamed Nomeir, Sennur Ulukus. 3314-3319 [doi]
• Information Theoretic Analysis of a Quantum PUFKumar Nilesh, Christian Deppe, Holger Boche. 3320-3325 [doi]
• An Information-Theoretic Approach to Anonymous Access ControlAlfredo De Santis, Anna Lisa Ferrara, Barbara Masucci, Giorgio Venditti. 3326-3331 [doi]
• Nobody Expects a Differential Equation: Minimum Energy-Per-Bit for the Gaussian Relay Channel with Rank-1 Linear RelayingOliver Kosut, Michelle Effros, Michael Langberg. 3332-3337 [doi]
• Sliding Secure Symmetric Multilevel Diversity CodingTao Guo, Laigang Guo, Yinfei Xu, Congduan Li, Shi Jin, Raymond W. Yeung. 3338-3343 [doi]
• Universal Source Encryption under Side-Channel AttacksYasutada Oohama, Bagus Santoso. 3344-3349 [doi]
• Simultaneous Computation and Communication over MACMatthias Frey, Igor Bjelakovic, Michael C. Gastpar, Jingge Zhu. 3350-3355 [doi]
• Generalized Gradient Flow Decoding and its Tensor-ComputabilityTadashi Wadayama, Lantian Wei. 3356-3361 [doi]
• Performance Analysis of Generalized Product Codes with Irregular Degree DistributionSisi Miao, Jonathan Mandelbaum, Lukas Rapp, Holger Jäkel, Laurent Schmalen. 3362-3367 [doi]
• Precoded Polar Product CodesMustafa Cemil Coskun. 3368-3373 [doi]
• Bit-Flipping Decoder Failure Rate Estimation for (v, w)-Regular CodesAlessandro Annechini, Alessandro Barenghi, Gerardo Pelosi. 3374-3379 [doi]
• On the Optimality of Dictator Functions and Isoperimetric Inequalities on Boolean HypercubesZijie Chen, Chandra Nair. 3380-3385 [doi]
• Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information CombiningUri Erez, Or Ordentlich, Shlomo Shamai. 3386-3391 [doi]
• A Quantitative Version of More Capable Channel ComparisonDonald Kougang-Yombi, Jan Hazla. 3392-3397 [doi]
• An Information-Theoretic Proof of the Shannon-Hagelbarger TheoremVenkat Anantharam. 3398-3401 [doi]
• On Semi-Supervised Estimation of Discrete Distributions Under f-DivergencesH. S. Melihcan Erol, Lizhong Zheng. 3402-3407 [doi]
• Asymptotic Estimates for Spectral Estimators of Rotationally Invariant MatricesZhuohang He, Xiaojun Yuan 0002, Junjie Ma 0001. 3408-3413 [doi]
• Guaranteed Robust Large Precision Matrix Estimation Under t-DistributionFengpei Li, Ziping Zhao 0002. 3414-3419 [doi]
• Second-Order Characterization of Minimax Parameter Estimation in Restricted Parameter SpaceTianren Peng, Xinyi Tong, Shao-Lun Huang. 3420-3425 [doi]
• Exact Error Exponents for a Concatenated Coding Based Class of DNA Storage CodesYan Hao Ling, Jonathan Scarlett. 3426-3431 [doi]
• Performance Limits in 3D Localization via Molecular DiffusionFlavio Zabini, Barbara M. Masini. 3432-3437 [doi]
• On Noisy Duplication Channels with Markov SourcesBrendon McBain, James Saunderson, Emanuele Viterbo. 3438-3443 [doi]
• On the Capacity of Channels with Markov Insertions, Deletions and SubstitutionsRuslan Morozov, Tolga M. Duman. 3444-3449 [doi]
• Exact Graph Matching in Correlated Gaussian-Attributed Erdős- Rényi ModeJoonhyuk Yang, Hye Won Chung. 3450-3455 [doi]
• Subgraph Matching via Partial Optimal TransportWen-Xin Pan, Isabel Haasler, Pascal Frossard. 3456-3461 [doi]
• Graph Reconstruction from Noisy Random SubgraphsAndrew McGregor 0001, Rik Sengupta. 3462-3467 [doi]
• Spectral Convergence of Simplicial Complex SignalsPurui Zhang, Xingchao Jian, Feng Ji, Wee-Peng Tay, Bihan Wen. 3468-3473 [doi]
• $\mathrm{E}_{\gamma}$-Mixing TimeBehnoosh Zamanlooy, Shahab Asoodeh, Mario Díaz, Flávio P. Calmon. 3474-3479 [doi]
• Multi-Task Private Semantic CommunicationAmirreza Zamani, Sajad Daei, Tobias J. Oechtering, Mikael Skoglund. 3480-3485 [doi]
• A New Multi-Receiver Authentication Scheme for General Access StructureJing Yang 0035, Shu-Tao Xia, Xianfang Wang, Can Xiang, Fang-Wei Fu 0001. 3486-3491 [doi]
• Entropy-Achieving Compression with Private Local DecodabilityVenkat Chandar, Aslan Tchamkerten, Shashank Vatedka. 3492-3497 [doi]
• Modulo Sampling with 1-Bit Side Information: Performance Guarantees in the Presence of QuantizationNeil Irwin Bernardo, Shaik Basheeruddin Shah, Yonina C. Eldar. 3498-3503 [doi]
• Preconditioned Gradient Descent for Sketched Mixture LearningJoseph Gabet, Maxime Ferreira Da Costa. 3504-3509 [doi]
• Distributed Sampling for the Detection of Poisson Sources Under Observation ErasuresVanlalruata Ralte, Amitalok J. Budkuley, Stefano Rini. 3510-3515 [doi]
• Overflow-Avoiding Memory AMPShunqi Huang, Lei Liu 0005, Brian M. Kurkoski. 3516-3521 [doi]
• An Unconditionally Secure Encryption Protocol for Cloud StorageMohammad Moltafet, Hamid R. Sadjadpour, Zouheir Rezki. 3522-3527 [doi]
• Wiretapped Commitment Over Binary ChannelsAnuj Kumar Yadav, Manideep Mamindlapally, Amitalok J. Budkuley. 3528-3533 [doi]
• Error Correction Capabilities of Non-Linear Cryptographic Hash FunctionsAlejandro Cohen, Rafael G. L. D'Oliveira. 3534-3539 [doi]
• Generalization of LiNGAM that Allows ConfoundingJoe Suzuki, Tianle Yang. 3540-3545 [doi]
• Prediction with Noisy Expert AdviceAlankrita Bhatt, Victoria Kostina. 3546-3551 [doi]
• Batch Universal PredictionMarco Bondaschi, Michael Gastpar. 3552-3557 [doi]
• Points-Polynomials Incidence Theorem with an Application to Reed-Solomon CodesItzhak Tamo. 3558-3563 [doi]
• Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding CapacityAmit Berman, Yaron Shany, Itzhak Tamo. 3564-3569 [doi]
• Multiplicity Assignments for Koetter-Vardy Decoding. The Case of Traceability CodesMarcel Fernandez, Josep Cotrina Navau. 3570-3575 [doi]
• Quasi-OSD of Binary Image of RS Codes with Applications to JSCCXiangping Zheng, Qianfan Wang, Baodian Wei, Xiao Ma 0001. 3576-3581 [doi]
• Dimensional Discrete Entropy Power Inequalities for Log-Concave Random VectorsMatthieu Fradelizi, Lampros Gavalakis, Martin Rapaport. 3582-3587 [doi]
• An Entropic Inequality in Finite Abelian Groups Analogous to the Unified Brascamp-Lieb and Entropy Power InequalityChin Wa Ken Lau, Chandra Nair. 3588-3593 [doi]
• Gaussian Mixtures: Convexity Properties and CLT Rates for the Entropy and Fisher InformationAlexandros Eskenazis, Lampros Gavalakis. 3594-3599 [doi]
• McKean's Conjecture Under the Log-Concavity AssumptionYanlin Geng. 3600-3605 [doi]
• Ziv-Merhav Estimation for Hidden-Markov ProcessesNicholas Barnfield, Raphaël Grondin, Gaia Pozzoli, Renaud Raquépas. 3606-3611 [doi]
• Parameter Estimation Based on Noisy Chaotic Signals in the Weak-Noise RegimeNeri Merhav. 3612-3617 [doi]
• Unbiased Estimating Equation on Inverse Divergence and its ConditionsMasahiro Kobayashi, Kazuho Watanabe. 3618-3623 [doi]
• The Lattice-Input Discrete-Time Poisson ChannelFederico Bello, Alvaro Martín, Tatiana Rischewski, Gadiel Seroussi. 3624-3629 [doi]
• Improved Bounds on the Number of Support Points of the Capacity-Achieving Input for Amplitude Constrained Poisson ChannelsLuca Barletta, Alex Dytso, Shlomo Shamai. 3630-3635 [doi]
• On the Coverage Required for Diploid Genome AssemblyDaanish Mahajan, Chirag Jain, Navin Kashyap. 3636-3641 [doi]
• DIST-CURE: A Robust Distributed Learning Algorithm with Cubic Regularized NewtonAvishek Ghosh, Raj Kumar Maity, Arya Mazumdar. 3642-3647 [doi]
• SignSGD-FV: Communication-Efficient Distributed Learning Through Heterogeneous EdgesChanho Park, H. Vincent Poor, Namyoon Lee. 3648-3653 [doi]
• Distributed Learning for Dynamic Congestion GamesHongbo Li 0008, Lingjie Duan. 3654-3659 [doi]
• The Entrapment Problem in Random Walk Decentralized LearningZonghong Liu, Salim El Rouayheb, Matthew Dwyer 0004. 3660-3665 [doi]
• Private Approximate Nearest Neighbor Search for Vector Database QueryingSajani Vithana, Martina Cardone, Flávio P. Calman. 3666-3671 [doi]
• An Efficient, High-Rate Scheme for Private Information Retrieval over the Gaussian MACOr Elimelech, Asaf Cohen 0001. 3672-3677 [doi]
• Equal Requests are Asymptotically Hardest for Data RecoveryJüri Lember, Ago-Erik Riet. 3678-3683 [doi]
• Anomaly Search of a Hidden Markov ModelLevli Citron, Kobi Cohen, Qing Zhao 0001. 3684-3688 [doi]
• Numerical Stability of DFT Computation for Signals with Structured SupportCharantej Reddy Pochimireddy, Aditya Siripuram, Brad Osgood. 3689-3694 [doi]
• Optimized Parameter Design for Channel State Information-Free Location SpoofingJianxiu Li, Urbashi Mitra. 3695-3700 [doi]
• Sharp Analysis of Out-of-Distribution Error for "Importance-Weighted" Estimators in the Overparameterized RegimeKuo-Wei Lai, Vidya Muthukumar. 3701-3706 [doi]