Table of Contents

• A Low-Latency Decoding of CA-Polar-SPC Product CodesXinwei Zhao, Xiao Mat. 1-6 [doi]
• Pliable Index Coding with Restricted Decoding SetsJunping Wu, Lawrence Ong, Sarah Johnson, Jin Yeong Tan. 7-12 [doi]
• On the Hermitian Hulls of Two-Point Algebraic Geometry CodesLin Sok, Martianus Frederic Ezerman, San Ling. 13-18 [doi]
• New Cauchy MDS Array Codes with Flexible Sub-Packetization and Efficient DecodingPeikai Li, Jingjie Lv, Linqi Song, Li Zhang, Hanxu Hou. 19-24 [doi]
• On Information Theoretic Fairness: Compressed Representations with Perfect Demographic ParityAmirreza Zamani, Borja Rodríguez Gálvez, Mikael Skoglund. 25-30 [doi]
• On Local Mutual-Information PrivacyKhac-Hoang Ngo, Johan Östman, Alexandre Graell i Amat. 31-36 [doi]
• Secure Semantic Communication Over Wiretap ChannelDenis Kozlov, Mahtab Mirmohseni, Rahim Tafazolli. 37-42 [doi]
• Physical-Layer Security for MIMO Visible Light Communication Wiretap ChannelSufang Yang, Longguang Li, Jintao Wang 0001. 43-48 [doi]
• Large Deviations for Outlier Hypothesis Testing of Continuous SequencesLina Zhu, Lin Zhou. 49-54 [doi]
• One-Shot Achievability Region for Hypothesis Testing with Communication ConstraintYuanxin Guo, Sadaf Salehkalaibar, Stark C. Draper, Wei Yu. 55-60 [doi]
• Large Deviations for Outlier Hypothesis Testing with Distribution UncertaintyXiaotian Zhang, Jun Diao, Lin Zhou. 61-66 [doi]
• Covering Codes as Near-Optimal Quantizers for Distributed Hypothesis Testing Against IndependenceFatemeh Khaledian, Reza Asvadi, Elsa Dupraz, Tad Matsumoto. 67-72 [doi]
• Demand Private Coded Caching: The Two-File CaseQinyi Lu, Nan Liu, Wei Kang. 73-78 [doi]
• Optimal Memory-Rate Tradeoff for Secure Multi-Access Coded Caching: The Case of Largest Access NumberHan Fang, Qinyi Lu, Nan Liu, Wei Kang. 79-84 [doi]
• On the Regret of Coded Caching with Adversarial RequestsAnupam Nayak, Kota Srinivas Reddy, Nikhil Karamchandani. 85-90 [doi]
• Coded Caching for Hierarchical Two-Layer Multi-Access Networks with Low Coding DelayRajlaxmi Pandey, B. Sundar Rajan. 91-96 [doi]
• Revisiting Distributed Source Coding for Efficient Downlink Transmission in Coded Edge ComputingRong Hu, Xiaofan He. 97-102 [doi]
• Multi-terminal Strong Coordination with Degraded Source ObservationsViswanathan Ramachandran 0001, Tobias J. Oechtering, Mikael Skoglund. 103-108 [doi]
• An Achievable Rate-Distortion Region for Joint State and Message Communication over Multiple Access ChannelsXinyang Li, Vlad-Costin Andrei, Ullrich J. Mönich, Holger Boche. 109-114 [doi]
• Optimal Sampling for Uncertainty-of-Information Minimization in a Remote Monitoring SystemXiaomeng Chen, Aimin Li, Shaohua Wu. 115-120 [doi]
• Sampling to Achieve the Goal: An Age-aware Remote Markov Decision ProcessAimin Li, Shaohua Wu, Gary C. F. Lee, Xiaomeng Chen, Sumei Sun. 121-126 [doi]
• Information Freshness in Random Access Networks with Energy HarvestingShuyu Xiao, Xinghua Sun, Wen Zhan, Xijun Wang 0001. 127-132 [doi]
• Timely Offloading in Mobile Edge Cloud SystemsNitya Sathyavageeswaran, Roy D. Yates, Anand D. Sarwate, Narayan Mandayam Rutgers. 133-138 [doi]
• Age of Information in Multi-Source Broadcast ChannelSubhankar Banerjee, Sennur Ulukus. 139-144 [doi]
• Capacity Bounds of Broadcast Channel with a Full-Duplex Base-User PairYanlin Geng, Xueyan Niu, Bo Bai 0001, Wei Han 0004. 145-150 [doi]
• Zero-Error Capacity of Broadcast Channels with Two Binary OutputsQi Cao, Zihan Wu, Guanchong Niu, Yanlin Geng, Baoming Bai. 151-156 [doi]
• Variable-Length Feedback Codes Over Known and Unknown Channels with Non-Vanishing Error ProbabilitiesRecep Can Yavas, Vincent Y. F. Tan. 157-162 [doi]
• Wireless MapReduce Arrays for Coded Distributed ComputingElizabath Peter, K. K. Krishnan Namboodiri, B. Sundar Rajan. 163-168 [doi]
• One-Shot Information HidingYanxiao Liu, Cheuk Ting Li. 169-174 [doi]
• Secure Summation with User Selection and CollusionYizhou Zhao, Hua Sun 0001. 175-180 [doi]
• Common Information in Well-Mixing Graphs and Applications to Information-Theoretic CryptographyGeoffroy Caillat-Grenier, Andrei E. Romashchenko, Rustam Zyavgarov. 181-186 [doi]
• Reducing Ciphertext and Key Sizes for MLWE-Based CryptosystemsGeorg Maringer, Antonia Wachter-Zeh. 187-192 [doi]
• Theoretical Bounds for the Size of Elementary Trapping Sets by Graph Theory MethodsHaoran Xiong, Zicheng Ye, Huazi Zhang, Jun Wang 0062, Ke Liu, Dawei Yin, Guanghui Wang 0002, Guiying Yan, Zhiming Ma. 193-198 [doi]
• Block-MDS QC-LDPC Codes with Application to High-Dimensional Quantum Key DistributionLev Tauz, Debarnab Mitra, Jayanth Shreekumar, Murat Can Sarihan, Chee Wei Wong, Lara Dolecek. 199-204 [doi]
• Entanglement-Assisted Quasi-Cyclic LDPC CodesPavan Kumar, Abhi Kumar Sharma, Shayan Srinivasa Garani. 205-210 [doi]
• Explicit Constructions of Girth-Eight QC-LDPC Codes: A Unified Framework Motivated by TDGSGuohua Zhang, Yulin Hu, Defeng Ren, Yi Fang 0005. 211-216 [doi]
• Practical Coding Schemes based on LDPC Codes for Distributed Parametric RegressionJiahui Wei, Elsa Dupraz, Philippe Mary. 217-222 [doi]
• Byzantine-Resilient Secure Aggregation for Federated Learning Without Privacy CompromisesYue Xia, Christoph Hofmeister, Maximilian Egger, Rawad Bitar. 223-228 [doi]
• A Communication-Efficient Semi-Decentralized Approach for Federated Learning with StragglersChengxi Li, Ming Xiao, Mikael Skoglund. 229-234 [doi]
• FedUHB: Accelerating Federated Unlearning via Polyak Heavy Ball MethodYu Jiang, Chee-Wei Tan 0001, Kwok-Yan Lam. 235-240 [doi]
• Federated Learning Meets Network Coding: Efficient Coded Hierarchical Federated LearningTianli Gao, Jiahong Lin, Congduan Li, Chee-Wei Tan 0001, Jun Gao. 241-246 [doi]
• Addressing Fluctuating Stragglers in Distributed Matrix Multiplication via Fountain CodesSiyuan Wang, Jianping Wang, Linqi Song. 247-252 [doi]
• On the I/O Cost of Linear Repair Schemes for Arbitrary $(n,k)$ Reed-Solomon CodesWenhao Liu, Zhengyi Jiang, Zhongyi Huang, Linqi Song, Hanxu Hou. 253-258 [doi]
• Rack-Aware Minimum-Storage Regenerating Codes with Optimal Access for Consecutive Node FailuresJiaojiao Wang, Xun Guan. 259-264 [doi]
• Weight Distributions of Two Classes of Optimal $(r, \delta)$-Locally Repairable CodesYao Tian, Hengfeng Jin, Fang-Wei Fu 0001. 265-270 [doi]
• Conjugate-Piggybacking Codes: MDS Array Codes with Lower Repair Bandwidth over Small Field SizeHao Shi, Zhengyi Jiang, Zhongyi Huang, Bo Bai 0001, Gong Zhang 0001, Hanxu Hou. 271-276 [doi]
• On the Asymptotic HGR Maximal Correlation of Gaussian Markov ChainTianren Peng, Xinyi Tong, Shao-Lun Huang. 277-282 [doi]
• Refined Statistical Bounds for Classification Error Mismatches with Constrained Bayes ErrorZijian Yang, Vahe Eminyan, Ralf Schlüter, Hermann Ney. 283-288 [doi]
• Convexity Results on Derivative of Negative Fisher Information Along Heat FlowKen Chen, Yanlin Geng. 289-294 [doi]
• Truncated Non-Uniform Quantization for Distributed SGDGuangfeng Yan, Tan Li 0002, Yuanzhang Xiao, Hanxu Hou, Congduan Li, Linqi Song. 295-300 [doi]
• An Information-Theoretic Analysis of Temporal GNNsAmirmohammad Farzaneh. 301-306 [doi]
• Improved Stability Bounds for Graph Convolutional Neural Networks Under Graph PerturbationsJun Zhang, Ziping Zhao. 307-312 [doi]
• On Verifying Entropic Vectors with Distributions Generated by Neural NetworksShuhao Zhang, Nan Liu 0001, Wei Kang 0002, Haim H. Permuter. 313-318 [doi]
• Score Matching with Deep Neural Networks: A Non-Asymptotic AnalysisEvan Scope Crafts, Xianyang Zhang, Bo Zhao. 319-323 [doi]
• No Advantage of Non-Local Cooperation in Distributed Compression of Classical SourcesHyun Young Park, Seung-Hyun Nam, Si-Hyeon Lee. 324-329 [doi]
• Coordination Capacity for Classical-Quantum CorrelationsHosen Nator, Uzi Pereg. 330-335 [doi]
• Entanglement Coordination Rates in Multi-User NetworksHosen Nator, Uzi Pereg. 336-341 [doi]
• Good Entanglement-Assisted Qubit Codes from Matrix Product CodesLin Sok, Martianus Frederic Ezerman, San Ling. 342-347 [doi]
• On the Quantization Goodness of Polar LatticesLing Liu, Shanxiang Lyu, Cong Ling 0001, Baoming Bai. 348-353 [doi]
• Lossy Compression for Sparse AggregationYijun Fan, Fangwei Ye, Raymond W. Yeung. 354-359 [doi]
• Rate-Distortion Tradeoff of Bistatic Integrated Sensing and CommunicationTian Jiao, Zhiqiang Wei 0001, Yanlin Geng, Kai Wan, Zai Yang, Giuseppe Caire. 360-365 [doi]
• Lossy Compression with Data, Perception, and Classification ConstraintsYuhan Wang, Youlong Wu, Shuai Ma 0002, Ying Jun Angela Zhang. 366-371 [doi]
• Sequential Hypothesis Testing of Quantum StatesGreg Fields, Neha Sangwan, Jack Postlewaite, Saikat Guha, Tara Javidi. 372-377 [doi]
• Sequential Outlier Hypothesis Testing under Universality ConstraintsJun Diao, Lin Zhou 0002. 378-383 [doi]
• High-Dimensional Sequential Testing of Multiple HypothesesYiming Xing, Shen Yan, Ziming Wang. 384-389 [doi]
• Cascaded Group TestingWaqar Mirza, Nikhil Karamchandani, Niranjan Balachandran. 390-395 [doi]
• A New Early-Termination Method for the Berlekamp-Massey AlgorithmChao Chen 0013, Nianqi Tang, Yunghsiang S. Han, Baoming Bai, Jiefei Zhang, Wenhao Zhou. 396-400 [doi]
• New Reed-Solomon Codes with All XOR Operation for Better En/Decoding PerformanceGefeng Deng, Zhengyi Jiang, Bo Bai 0001, Gong Zhang 0001, Xiuyin Zhang, Hanxu Hou. 401-406 [doi]
• Improved Construction for Multiplicative Repetition Based Non-Binary Polar CodesRongchi Xu, Peiyao Chen, Ling Liu, Min Zhu 0003, Baoming Bai. 407-412 [doi]
• Fast Successive-Cancellation Decoding of Polar Codes with Reed-Solomon KernelJianhan Zhao, Wei Zhang 0055, Yanyan Liu 0001. 413-417 [doi]
• Ultra-Low Complexity Communication Algorithms Based on (n, n(n-l), n-l) PGCsLi Peng 0002. 418-423 [doi]
• Analysis of Cross-Domain Message Passing for OTFS TransmissionsRuoxi Chong, Shuangyang Li, Zhiqiang Wei 0001, Michail Matthaiou, Derrick Wing Kwan Ng, Giuseppe Caire. 424-429 [doi]
• Systematic Construction of Golay Complementary Sets of Arbitrary Lengths and Alphabet SizesAbhishek Roy 0006, Sudhan Majhi, Subhabrata Paul. 430-435 [doi]
• Fast Iterative ELAA-MIMO Detection Exploiting Static Channel ComponentsJiuyu Liu, Yi Ma 0002, Rahim Tafazolli. 436-441 [doi]
• Locally Constrained Guessing Codeword Decoding of Short Block CodesXiangping Zheng, Xiao Ma 0001. 442-447 [doi]
• Order Skipping Ordered Statistics Decoding and its Performance AnalysisXihao Li, Wenhao Chen, Li Chen, Yuan Li, Huazi Zhang. 448-453 [doi]
• Reduced Complexity SISO Decoding Algorithm for the First-Order Reed-Muller CodesLiudmila Karakchieva, Peter Trifonov. 454-459 [doi]
• Guessing what, Noise or Codeword?Xiao Ma. 460-465 [doi]
• An Efficient Adaptive Belief Propagation Decoder for Polar CodesZhongjun Yang, Zuoxin Cai, Li Chen, Huazi Zhang. 466-471 [doi]
• Security, Privacy and Linear Function Retrieval in Multi-Access Combinatorial Topology with Private CacheMallikharjuna Chinnapadamala, B. Sundar Rajan. 472-477 [doi]
• A New Hotplug Coded Caching Scheme Using PDAsMallikharjuna Chinnapadamala, Charul Rajput, B. Sundar Rajan. 478-483 [doi]
• Hierarchical Caching System with Hotplug Model Using HpPDAAbhay Kumar Maurya, Charul Rajput, B. Sundar Rajan. 484-489 [doi]
• Reflecting Intelligent Surfaces-Assisted Multiple-Antenna Coded CachingXiaofan Niu, Minquan Cheng, Kai Wan, Robert Caiming Qiu, Giuseppe Caire. 490-495 [doi]
• A Novel Construction of Coded Caching Schemes with Polynomial Subpacketizations via Projective GeometryHuimei Wei, Minquan Cheng, Kahin Leung. 496-501 [doi]
• Multispectral Band Selection Using Correlation Explanation for Identification of Discriminative Bands Related to Grapevine DiseasesShurong Zhang, Alban Goupil, Valeriu Vrabie, Eric Perrin, Marie-Laure Panon. 502-507 [doi]
• Maximizing User Admittance for Cognitive Satellite-Terrestrial Networks Using ODE-Inspired Spectral Radius EstimationKai Wang, Chee-Wei Tan 0001, Christopher G. Brinton. 508-513 [doi]
• Geometric Analysis of Non-Convex Optimization Landscapes for Robust M-Estimation of LocationHongyuan Yang, Ziping Zhao, Ying Sun. 514-519 [doi]
• Robust Risk-Sensitive Reinforcement Learning with Conditional Value-at-RiskXinyi Ni, Lifeng Lai. 520-525 [doi]
• The Second-Order Perspectives of Minimax Parameter Estimation in Restricted Space with Weighted Squared Error LossTianren Peng, Xinyi Tong, Shao-Lun Huang. 526-531 [doi]
• Neural Estimation of the Information Bottleneck Based on a Mapping ApproachLingyi Chen, Shitong Wu, Sicheng Xu, Wenyi Zhang 0001, Huihui Wu. 532-536 [doi]
• Information-Theoretic Analysis of the Gibbs Algorithm: An Individual Sample ApproachYouheng Zhu, Yuheng Bu. 537-542 [doi]
• A Non-asymptotic Framework for Characterizing Dependency Structures in Multimodal LearningWeida Wang, Tao Shi, Yaoyuan Liang, Xinyi Tong, Shao-Lun Huang. 543-548 [doi]
• On the Paley RIP and Paley Graph ExtractorShohei Satake. 549-554 [doi]
• Capacity Bounds on Optical Wireless Relay ChannelsMeiyun Huang, Longguang Li. 555-560 [doi]
• Divergence Inequalities from Multivariate Taylor's TheoremIan George, Alice Zheng, Akshay Bansal. 561-566 [doi]
• Augustin Information in the Vicinity of Augustin Capacity-Achieving Input DistributionsHao-Chung Cheng, Baris Nakiboglu. 567-572 [doi]
• Optimal Rate Region for Key Efficient Hierarchical Secure Aggregation with User CollusionXiang Zhang 0019, Kai Wan, Hua Sun 0001, Shiqiang Wang, Mingyue Ji, Giuseppe Caire. 573-578 [doi]
• PoW Security-Latency Under Random Delays and the Effect of Transaction FeesMustafa Doger, Sennur Ulukus, Nail Akar. 579-584 [doi]
• Existence and Algorithmic Construction of $q$-ary Secure Codes with List DecodingLing Jiang, Yujie Gu, Jinping Fan, Ying Miao 0001. 585-590 [doi]
• Secret-Key Generation with PUFs and Biometric Identifiers for Compound Authentication ChannelsVamoua Yachongka, Rémi A. Chou. 591-596 [doi]
• On the New Rank Metric Codes Related to Gabidulin CodesRan Li, Fang-Wei Fu 0001. 597-602 [doi]
• On Function-Correcting CodesRohit Premlal, B. Sundar Rajan. 603-608 [doi]
• Computer Formalization of Deletion-Correcting Permutation CodesMinhan Gao, Kenneth W. Shum. 609-614 [doi]
• A Tighter Distance Upper-Bound for Gottesman-Kitaev-Preskill CodesShobhit Bhatnagar, P. Vijay Kumar. 615-620 [doi]
• Coding for Synthesis DefectsZiyang Lu, Han Mao Kiah, YiWei Zhang, Robert N. Grass, Eitan Yaakobi. 621-626 [doi]
• How to Find Simple Conditions for Successful Sequence Reconstruction?Chen Wang, Eitan Yaakobi, YiWei Zhang. 627-632 [doi]
• Studying the Cycle Complexity of DNA SynthesisAmit Zrihan, Eitan Yaakobi, Zohar Yakhini. 633-638 [doi]
• On the Expected Number of Views Required for Fixed-Error Sequence ReconstructionVivian Papadopoulou, V Arvind Rameshwar 0001, Antonia Wachter-Zeh. 639-644 [doi]
• Leveraging Noisy Observations in Zero-Sum GamesEmmanouil M. Athanasakos, Samir M. Perlaza. 645-650 [doi]
• Non-Iterative Algorithm for Channel CapacityMasahito Hayashi. 651-656 [doi]
• Achievability Bounds on Unequal Error Protection CodesLiuquan Yao, Shuai Yuan, Yuan Li 0034, Jun Wang 0062, Guiying Yan, Zhiming Ma. 657-662 [doi]
• Statistics of Random Binning Based on Tsallis DivergenceMasoud Kavian, Mohammad Mahdi Mojahedian, Mohammad Hossein Yassaee, Mahtab Mirmohseni, Mohammad Reza Aref. 663-668 [doi]
• Sum-Capacity for Symmetric Finite-State Gaussian Multiple Access Channel with Delayed FeedbackDengfeng Xia, Han Deng, Peng Xu 0002, Bin Dai 0003. 669-674 [doi]
• Gaussian Relay Channel with Noiseless Feedback: RevisitHan Deng, Dengfeng Xia, Peng Xu 0002, Bin Dai 0003. 675-680 [doi]
• Efficient Coding for Computation Over Gaussian Multiple-Access Channel with Noiseless/Noisy FeedbackYuhan Yang, Han Deng, Peng Xu 0002, Bin Dai 0003. 681-686 [doi]
• Causal Vector-Valued Witsenhausen Counterexamples with FeedbackMengyuan Zhao, Maël Le Treust, Tobias J. Oechtering. 687-692 [doi]
• Semantic Security with Unreliable Entanglement Assistance: Interception and LossMeir Lederman, Uzi Pereg. 693-698 [doi]
• Towards Quantum-Safe Distributed Learning via Homomorphic Encryption: Learning with GradientsGuangfeng Yan, Shanxiang Lyu, Hanxu Hou, Zhiyong Zheng, Linqi Song. 699-704 [doi]
• Quantum $X$-Secure $B$-Byzantine $T$-Colluding Private Information RetrievalMohamed Nomeir, Alptug Aytekin, Sennur Ulukus. 705-710 [doi]
• Covert Communication with Positive Rate Over State-Dependent Quantum ChannelsHassan ZivariFard, Rémi A. Chou, Xiaodong Wang 0001. 711-716 [doi]
• Algebraic Geometric Rook Codes for Coded Distributed ComputingGretchen L. Matthews, Pedro Soto 0001. 717-722 [doi]
• Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix MultiplicationJesús Gómez-Vilardebó, Burak Hasircioglu, Deniz Gündüz. 723-728 [doi]
• Optimal Bandwidth for All-Linear-Reduce OperationZhengrui Li, Wai Ho Mow, Yunghsiang S. Han, Yunqi Wan. 729-734 [doi]
• Network Function Computation for Vector Linear FunctionsQin Zhou, Fang-Wei Fu 0001. 735-740 [doi]
• Finite Field Multiple Access for Sourced Massive Random Access with Finite BlocklengthQi-Yue Yu, Shi-wen Lin, Shu Lin. 741-746 [doi]
• Alternating Maximization Algorithm for Mismatch Capacity with Oblivious RelayingXinwei Li, Lingyi Chen, Shitong Wu, Huihui Wu, Hao Wu, Wenyi Zhang. 747-752 [doi]
• Sparse Degree Optimization for BATS CodesHoover H. F. Yin, Jie Wang. 753-758 [doi]
• Random Alloy Codes and the Fundamental Limits of Coded Distributed TensorsPedro Soto. 759-764 [doi]
• Identification via Binary Uniform Permutation ChannelAbhishek Sarkar, Bikash Kumar Dey. 765-770 [doi]
• Detecting Informationally-Dense SubsetsChao Zhao, Ali Al-Bashabsheh, Chung Chan. 771-776 [doi]
• Relative Fractional Independence NumberSharareh Alipour, Amin Gohari, Mehrshad Taziki. 777-782 [doi]
• Identification via Gaussian Multiple Access Channels in the Presence of FeedbackYaning Zhao, Wafa Labidi, Holger Boche, Eduard A. Jorswieck, Christian Deppe. 783-788 [doi]