{"generated_at":"2026-10-10T07:56:18Z","total":1006,"page":0,"pages":11,"page_size":100,"next":"/api/catalog?topic=information-theory&page=1","documents":[{"id":"arxiv-2610.10519","title":"Why Forget-Only Unlearning Needs Memorization","year":2026,"authors":["Luka Radić","Vikrant Singhal","Amartya Sanyal"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["statistical-learning","information-theory"],"keywords":["cs.LG","cs.IT","math.IT","stat.ML"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.10519","fulltext_endpoint":"/api/document/arxiv-2610.10519/fulltext","references_endpoint":null},{"id":"doi-4ae0ccc17dc5cdf595a0","title":"Large class of many-to-one mappings over quadratic extension of finite fields","year":2026,"authors":["Yanbin Zheng","Meiying Zhang","Yanjin Ding"],"author_count":5,"journal":"Finite Fields Appl., vol. 118, Art. no. 102928, 2027","doi":"10.1016/j.ffa.2026.102928","source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT","math.NT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/doi-4ae0ccc17dc5cdf595a0","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-1808.06723","title":"Modes of Information Flow","year":2026,"authors":["Ryan G. James","Blanca Daniella Mansante Ayala","Bahti Zakirov"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["cybersecurity","information-theory"],"keywords":["cond-mat.stat-mech","cs.CR","cs.IT","math.IT","nlin.CD"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-1808.06723","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2504.06209","title":"Information Thermodynamics of Agents: The Work Capacity of Channels with Memory","year":2026,"authors":["Lukas J. Fiderer","Paul C. Barth","Isaac D. Smith"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["cs.LG","cond-mat.stat-mech","cs.IT","math.IT","nlin.AO","nlin.CD","quant-ph"],"license":"CC-BY-4.0","has_fulltext":false,"has_references":false,"rights_class":"licensed_content","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2504.06209","fulltext_endpoint":null,"references_endpoint":null},{"id":"doi-34e82e1b2bf4c013261d","title":"Compressed Qubit Noise Spectroscopy: Piecewise-Linear Modeling and Rademacher Measurements","year":2026,"authors":["Kaixin Huang","Demitry Farfurnik","Dror Baron"],"author_count":4,"journal":"Phys. Rev. Applied 26, 034055 (2026)","doi":"10.1103/r813-2yvm","source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/doi-34e82e1b2bf4c013261d","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2604.15540","title":"Accessible Quantum Correlations Under Complexity Constraints","year":2026,"authors":["Álvaro Yángüez","Noam Avidan","Jan Kochanowski"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.CC","cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2604.15540","fulltext_endpoint":"/api/document/arxiv-2604.15540/fulltext","references_endpoint":null},{"id":"arxiv-2605.04493","title":"The unique, universal entropy for complex systems","year":2026,"authors":["Kenric P. Nelson"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cond-mat.stat-mech","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2605.04493","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2605.13684","title":"Scale-Sensitive Shattering: Learnability and Evaluability at Optimal Scale","year":2026,"authors":["Shashaank Aiyer","Yishay Mansour","Shay Moran"],"author_count":5,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.LG","cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2605.13684","fulltext_endpoint":"/api/document/arxiv-2605.13684/fulltext","references_endpoint":null},{"id":"arxiv-2605.24477","title":"The Normalized Maximum Likelihood for Regular Non-Smooth Models: Measure-Theoretic Foundations and Geometric Sampling","year":2026,"authors":["Trenton Lau","Gary P. T. Choi"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.LG","cs.IT","math.IT","math.ST","stat.TH"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2605.24477","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2606.19305","title":"Secret key-distribution over networks with node-based adversarial errors","year":2026,"authors":["Reza Sayyari","Michael Langberg"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2606.19305","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2606.24471","title":"Discrepancy for Random Linear Codes","year":2026,"authors":["Dean Doron","Tal Leonov","Jonathan Mosheiff"],"author_count":6,"journal":null,"doi":null,"source":"arxiv","topics":["cybersecurity","information-theory"],"keywords":["cs.IT","cs.CC","cs.CR","math.CO","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2606.24471","fulltext_endpoint":"/api/document/arxiv-2606.24471/fulltext","references_endpoint":null},{"id":"arxiv-2608.16857","title":"Fault-Tolerant Quantum Computation with Adversarial Errors","year":2026,"authors":["Nikolas P. Breuckmann","Louis Golowich","Umesh Vazirani"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.CC","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2608.16857","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.01474","title":"Binary Multiple-Node-Erasure-Correcting Codes over Complete Graphs: Constructions, q-Ary Metric Balls, and Duality","year":2026,"authors":["Aryeh Lev Zabokritskiy"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.CO","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.01474","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.10802","title":"A Time-Frequency Framework for GKP Codes","year":2026,"authors":["Franz Luef","Eduard Ortega"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["math-ph","cs.IT","math.FA","math.IT","math.MP","math.OA","quant-ph"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.10802","fulltext_endpoint":"/api/document/arxiv-2609.10802/fulltext","references_endpoint":null},{"id":"arxiv-2609.03736","title":"The half-rate linear programming bound for binary codes is $\\frac12-\\frac1π$","year":2026,"authors":["Andrew Salmon"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["math.CO","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.03736","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.10986","title":"A Mathematical Theory of Pragmatic Information","year":2026,"authors":["Kai Niu","Ping Zhang"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","cs.AI","cs.RO","cs.SY","eess.SY","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.10986","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.24201","title":"High-Rate Quasi-Dyadic Quantum LDPC Codes","year":2026,"authors":["Alessio Baldelli","Sisi Miao","Laurent Schmalen"],"author_count":5,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.24201","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.24675","title":"Exact Second-Order Asymptotics for Covert Communication over DMCs with Variational Distance Constraints","year":2026,"authors":["Qiaosheng Zhang","Lin Zhou","Xuelong Li"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.24675","fulltext_endpoint":"/api/document/arxiv-2609.24675/fulltext","references_endpoint":null},{"id":"arxiv-2609.33512","title":"Sunflowers of Reed--Solomon Codes","year":2026,"authors":["Roni Con","Anina Gruica","Maria Montanucci"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["math.CO","cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.33512","fulltext_endpoint":"/api/document/arxiv-2609.33512/fulltext","references_endpoint":null},{"id":"arxiv-2609.37368","title":"A Memory-Magic Exchange Law in Streaming Clifford+T Compilation","year":2026,"authors":["Jinze Yang","Yangyang Li","Xiu-Hao Deng"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT","math.NT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.37368","fulltext_endpoint":"/api/document/arxiv-2609.37368/fulltext","references_endpoint":null},{"id":"arxiv-2609.38243","title":"Approximate Uniformity in Finite Convolution Models","year":2026,"authors":["Nilava Metya","Satyaki Mukherjee"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.CO","math.IT","math.PR"],"license":"CC-BY-SA-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.38243","fulltext_endpoint":"/api/document/arxiv-2609.38243/fulltext","references_endpoint":null},{"id":"arxiv-2609.38259","title":"Systematic Codes Correcting Two Deletions with Three Redundant Symbols over Large Alphabets","year":2026,"authors":["Valery","Grishin","Aryeh Lev Zabokritskiy"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.38259","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.38471","title":"Derandomizing Dense Binary Hypervector Codebooks for Quantized Scalars","year":2026,"authors":["Dmitri Rachkovskij","Evgeny Osipov","Olexander Volkov"],"author_count":5,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","cs.AI","cs.NE","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.38471","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.38668","title":"Z-Sigil: A Public-Key Cryptosystem with Chained Selection over a Fiber Bundle of Module-Lattice Keys","year":2026,"authors":["Andrea Rondelli"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["cybersecurity","information-theory"],"keywords":["cs.CR","cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":false,"has_references":false,"rights_class":"licensed_content","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.38668","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.38919","title":"Complete bipartite embeddings, lattice non-embeddability, and non-Euclidean powers of information distance","year":2026,"authors":["Fengqi Hou"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.38919","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.39081","title":"Coding Agents for Coding Theory","year":2026,"authors":["Abraham Yeung"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","cs.AI","cs.LG","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.39081","fulltext_endpoint":"/api/document/arxiv-2609.39081/fulltext","references_endpoint":null},{"id":"arxiv-2609.39230","title":"Multi-View Block Distance Distributions and Linear Programming Bounds for Locally Recoverable Codes with Availability","year":2026,"authors":["Ming-Hsuan Kang","Maosheng Xiong","Yu Hsuan Hsieh"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.CO","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.39230","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.39345","title":"Constant-Overhead Injection into Quantum Codes","year":2026,"authors":["Louis Golowich","Venkatesan Guruswami"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.39345","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.39479","title":"Version Age-of-Information-based Semantic Secrecy Region Analysis","year":2026,"authors":["Qian Wang","Bohai Li","Chao Sun"],"author_count":6,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.39479","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.39667","title":"Distribution of Age of Information in the Erlang Loss System","year":2026,"authors":["Nail Akar","Sennur Ulukus"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","cs.PF","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.39667","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.39776","title":"Mission Efficiency Optimization in Low-Altitude Economy: Adaptive Power Allocation for Coordinating Heterogeneous Aircraft Swarms","year":2026,"authors":["Jiarui Zhang","Wei Feng","Chao Dong"],"author_count":5,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","cs.SY","eess.SY","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.39776","fulltext_endpoint":"/api/document/arxiv-2609.39776/fulltext","references_endpoint":null},{"id":"arxiv-2609.39890","title":"Quantum State Routing and Perfect State Transfer on Signed Graphs under Environmental Noise","year":2026,"authors":["Nur Mohammad Sanfui","Supriyo Dutta"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.DM","cs.IT","math.CO","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.39890","fulltext_endpoint":"/api/document/arxiv-2609.39890/fulltext","references_endpoint":null},{"id":"arxiv-2609.40061","title":"Equality in the Bosonic Quantum Entropy Power Inequality","year":2026,"authors":["Yonglong Li"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.40061","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.40182","title":"A mixing time method for estimating the sample complexity of quantum state discrimination","year":2026,"authors":["Juntai Zhou","Felix Leditzky"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.CC","cs.IT","math.IT","math.PR","math.RT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.40182","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.40080","title":"Universal Entanglement Distillation","year":2026,"authors":["Salvatore Tirone","Francesco Anna Mele","Vittorio Giovannetti"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.40080","fulltext_endpoint":"/api/document/arxiv-2609.40080/fulltext","references_endpoint":null},{"id":"arxiv-2609.40252","title":"From Random Quantum Codes to Explicit qLDPC Codes via Local Properties","year":2026,"authors":["Fernando Granha Jeronimo","Xiaojuan Ma","Nikhil Shagrithaya"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["cs.IT","math.IT","quant-ph"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.40252","fulltext_endpoint":"/api/document/arxiv-2609.40252/fulltext","references_endpoint":null},{"id":"arxiv-2609.40211","title":"Submodularity of entropy under quantum convolution","year":2026,"authors":["Milad M. Goodarzi"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.CO","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.40211","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.40262","title":"Quantum List Recovery and Decoding: Achievability and Limitations","year":2026,"authors":["Fernando Granha Jeronimo","Xiaojuan Ma"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.40262","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.40313","title":"Explicit Capacity-Achieving Quantum LDPC Codes List Decodable in Near-linear Time","year":2026,"authors":["William Gay","Fernando Granha Jeronimo","Abhi Shukul"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.40313","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.40319","title":"Local Automorphism-Aware Syndrome Compilation for General Quantum LDPC Codes","year":2026,"authors":["Eugenio Durazo Rocha","Olai Å. Mostad","Hsuan-Yin Lin"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.40319","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2001.03593","title":"Authentication Against a Myopic Adversary","year":2026,"authors":["Mayank Bakshi","Allison Beemer","Oliver Kosut"],"author_count":6,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2001.03593","fulltext_endpoint":null,"references_endpoint":null},{"id":"doi-279f21465461d5adbd9e","title":"Local Test for Unitarily Invariant Properties of Bipartite Quantum States","year":2026,"authors":["Kean Chen","Qisheng Wang","Zhicheng Zhang"],"author_count":3,"journal":"IEEE Transactions on Information Theory, 72(10): 7578-7603, 2026","doi":"10.1109/tit.2026.3697790","source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.CC","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/doi-279f21465461d5adbd9e","fulltext_endpoint":null,"references_endpoint":null},{"id":"doi-dace4b50247717051f14","title":"The Service Rate Region of Hamming Codes","year":2025,"authors":["Priyanka Choudhary","Maheshanand Bhaintwal"],"author_count":2,"journal":"IEEE Transactions on Information Theory, vol. 72, no. 9, pp. 6522-6533, Sept. 2026,","doi":"10.1109/tit.2026.3709105","source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.CO","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/doi-dace4b50247717051f14","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2512.02257","title":"Entropies associated with orbits of finite groups","year":2026,"authors":["Ryan Leal","Jingtong Sun","Juan Pablo Vigneaux"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT","math.RT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2512.02257","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2601.07622","title":"Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels","year":2026,"authors":["Hao Wu","Shengtian Yang","Huiguo Gao"],"author_count":6,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","cs.SY","eess.SY","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2601.07622","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2604.07639","title":"Exponential quantum advantage in processing massive classical data","year":2026,"authors":["Haimeng Zhao","Alexander Zlokapa","Hartmut Neven"],"author_count":7,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.AI","cs.CC","cs.IT","cs.LG","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2604.07639","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2604.12429","title":"Hierarchical Secure Distributed Linearly Separable Computation with Arbitrary Heterogeneous Data Assignment","year":2026,"authors":["Ziting Zhang","Chenyi Sun","Kai Wan"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2604.12429","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2605.06580","title":"Generalized Skew Multivariate Goppa Codes","year":2026,"authors":["Elena Berardini","Pranav Trivedi"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC-BY-SA-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2605.06580","fulltext_endpoint":"/api/document/arxiv-2605.06580/fulltext","references_endpoint":null},{"id":"arxiv-2605.18961","title":"4D and 5D Layer Codes through Color Routing","year":2026,"authors":["Andrew C. Yuan","Nouédyn Baspin"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math-ph","math.IT","math.MP"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2605.18961","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2607.08133","title":"Communication Advantages from Quantum Dense Network Coding","year":2026,"authors":["Ian George","Brian Doolittle"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2607.08133","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.08054","title":"Leveraged Learning: entropy cleared per bit received","year":2026,"authors":["Daniel Chernowitz"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cond-mat.stat-mech","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.08054","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.13608","title":"A lattice family with kissing numbers $τ(\\mathcal{L}_n) \\ge e^{2 \\sqrt{n}}$","year":2026,"authors":["Thijs Laarhoven","Scott Duke Kominers"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["math.CO","cs.IT","math.IT","math.MG","math.NT"],"license":"CC-BY-SA-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.13608","fulltext_endpoint":"/api/document/arxiv-2609.13608/fulltext","references_endpoint":null},{"id":"arxiv-2609.28635","title":"Continuity of Regularized Channel Rényi Divergences","year":2026,"authors":["Jinzhao Wang","Yuxiang Yang"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math-ph","math.IT","math.MP"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.28635","fulltext_endpoint":"/api/document/arxiv-2609.28635/fulltext","references_endpoint":null},{"id":"arxiv-2609.39121","title":"Metachecks in Bivariate Bicycle Codes: Syndrome Distance, Measurement Faults, and Repair Limits","year":2026,"authors":["Mohammad Rowshan"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.39121","fulltext_endpoint":"/api/document/arxiv-2609.39121/fulltext","references_endpoint":null},{"id":"arxiv-2609.39395","title":"Logical Operator Decomposition for Distance Analysis of Bivariate Bicycle Codes","year":2026,"authors":["Mohammad Rowshan","Simon Devitt"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.39395","fulltext_endpoint":"/api/document/arxiv-2609.39395/fulltext","references_endpoint":null},{"id":"arxiv-2609.39747","title":"A depolarizing choir sings in Gaussian harmony","year":2026,"authors":["Rabsan Galib Ahmed","Sujeet Bhalerao","Sungjai Lee"],"author_count":7,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.39747","fulltext_endpoint":"/api/document/arxiv-2609.39747/fulltext","references_endpoint":null},{"id":"arxiv-2610.00117","title":"Exact Posterior Prediction from Product Haar Measurements and a Randomized-Mesh Maximum-Likelihood Bridge","year":2026,"authors":["Naqueeb Ahmad Warsi","Ayanava Dasgupta","Masahito Hayashi"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.00117","fulltext_endpoint":"/api/document/arxiv-2610.00117/fulltext","references_endpoint":null},{"id":"arxiv-2610.00187","title":"Entanglement cost of quantum depolarization","year":2026,"authors":["Kun Fang"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.00187","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.00227","title":"Spatially Coupled MacKay-Neal Codes on Symmetric Markov Noise: A Reduction to BMS Channels","year":2026,"authors":["Kenta Kasai"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.00227","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.00291","title":"When Information Is Not Enough: Accuracy-Constrained Thermodynamic Costs of Binary Classification","year":2026,"authors":["Xuening Wu"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.00291","fulltext_endpoint":"/api/document/arxiv-2610.00291/fulltext","references_endpoint":null},{"id":"arxiv-2610.00295","title":"Adaptivity, Anchoring, and the Exact Oracle Complexity of Stochastic Fixed-Point Iterations","year":2026,"authors":["Yekini Shehu"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["math.OC","cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.00295","fulltext_endpoint":"/api/document/arxiv-2610.00295/fulltext","references_endpoint":null},{"id":"arxiv-2610.00382","title":"On the Relationship between Model Quantization and Model Inversion Attacks","year":2026,"authors":["Rongke Liu","Youwen Zhu"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["cybersecurity","information-theory"],"keywords":["cs.CR","cs.IT","cs.LG","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.00382","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.00427","title":"Modulation Augmentation and Constellation Shaping for LDPC-Coded QPSK","year":2026,"authors":["Heping Wan","Joonyoung Cho","Sandesh Rao Mattu"],"author_count":7,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.00427","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.00440","title":"Finite-blocklength classical communication over the quantum erasure channel with and without classical feedback","year":2026,"authors":["Mark M. Wilde"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.00440","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.00448","title":"Learning Local Fermionic Lindbladians under Parity Superselection","year":2026,"authors":["Tim Möbus","Daniel Stilck França","Cambyse Rouzé"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT","math.ST","stat.TH"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.00448","fulltext_endpoint":"/api/document/arxiv-2610.00448/fulltext","references_endpoint":null},{"id":"arxiv-2610.00571","title":"Interpreting Reasoning of Large Language Models via Partial Information Decomposition","year":2026,"authors":["Barproda Halder","Qiuyi Zhang","Sanghamitra Dutta"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","cs.AI","cs.CY","cs.LG","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.00571","fulltext_endpoint":"/api/document/arxiv-2610.00571/fulltext","references_endpoint":null},{"id":"arxiv-2610.00695","title":"Progressive-Resolution Secure Aggregation for Federated Learning","year":2026,"authors":["Seyed Mohammad Azimi-Abarghouyi"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["cybersecurity","information-theory"],"keywords":["cs.CR","cs.DC","cs.IT","cs.LG","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.00695","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.00763","title":"Reading While Writing: Baseline Information Requirements for Molecular Neural Interfaces","year":2026,"authors":["Hongbin Ni","Ozgur B. Akan"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.ET","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.00763","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.01068","title":"Learned Parallel Bit-Flipping Sequential Belief Propagation Decoding of Quantum LDPC Codes","year":2026,"authors":["Mohsen Moradi","Taejoon Kim","Remi A. Chou"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.01068","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.01228","title":"Task-Oriented Boolean Function Computation: Practical Code Constructions","year":2026,"authors":["Yangshuo He","Guanding Yu","Jingge Zhu"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.01228","fulltext_endpoint":"/api/document/arxiv-2610.01228/fulltext","references_endpoint":null},{"id":"arxiv-2610.01307","title":"Exploiting UAV Attitude for Covert Communications: Dynamics-Consistent Trajectory-Attitude Co-Design","year":2026,"authors":["Jinpeng Xu","Lin Zhou","Xin Xie"],"author_count":5,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.01307","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.01359","title":"Joint Communication and Sensing in Aerial Corridors: A Novel Stochastic Geometry Framework","year":2026,"authors":["Harris K. Armeniakos","Petros S. Bithas","Athanasios G. Kanatas"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.01359","fulltext_endpoint":"/api/document/arxiv-2610.01359/fulltext","references_endpoint":null},{"id":"arxiv-2610.01368","title":"Communication and Sensing Coverage of UAV Corridor under Beam Misalignment Error","year":2026,"authors":["Harris K. Armeniakos","Petros S. Bithas","Konstantinos Maliatsos"],"author_count":5,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.01368","fulltext_endpoint":"/api/document/arxiv-2610.01368/fulltext","references_endpoint":null},{"id":"arxiv-2610.01437","title":"Agentic Wireless Digital Twin Construction and Calibration Using Real-World Measurements","year":2026,"authors":["Fan-Hao Lin","Kun-Li Shih","Chu-Hsiang Huang"],"author_count":6,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.01437","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.01563","title":"Optimal Universal Coding of Integers","year":2026,"authors":["Wei Yan","Yunghsiang S. Han","Leqian Zheng"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.01563","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.01733","title":"Asymptotically unit-rate storage codes from binary BCH codes","year":2026,"authors":["Aryeh Lev Zabokritskiy"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.CO","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.01733","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.01792","title":"Learnt Attacks on Quantum Key Distribution under Channel Noise and Device Drift","year":2026,"authors":["Marcel Mordarski","Benjamin Gras","Abdelrahman Shehata"],"author_count":5,"journal":null,"doi":null,"source":"arxiv","topics":["cybersecurity","information-theory","quantum-computing"],"keywords":["quant-ph","cs.CR","cs.IT","cs.LG","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.01792","fulltext_endpoint":"/api/document/arxiv-2610.01792/fulltext","references_endpoint":null},{"id":"arxiv-2610.01828","title":"The Asymptotics of Language Model Alignment with Memory","year":2026,"authors":["Haricharan Balasundaram","V. Arvind Rameshwar"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.CL","cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.01828","fulltext_endpoint":"/api/document/arxiv-2610.01828/fulltext","references_endpoint":null},{"id":"arxiv-2610.01900","title":"Recovery Set Structures and Service Rates of Codes Obtained by the Plotkin-type Construction","year":2026,"authors":["Priyanka Choudhary","Maheshanand Bhaintwal"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.CO","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.01900","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.01941","title":"Universality Sacrifices Reliability in Classical-Quantum Channel Coding","year":2026,"authors":["Kaito Watanabe","Masahito Hayashi","Takaya Matsuura"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.01941","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.02113","title":"Quantum Advantage for Two-Party Differential Privacy","year":2026,"authors":["Daniel Alabi","Emil T. Khabiboulline"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["cybersecurity","information-theory","quantum-computing"],"keywords":["quant-ph","cs.CR","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.02113","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-1111.3240","title":"Salt-and-Pepper Noise Removal Based on Sparse Signal Processing","year":2026,"authors":["Abbas Kazerooni","Azarang Golmohammadi","Farokh Marvasti"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-1111.3240","fulltext_endpoint":null,"references_endpoint":null},{"id":"doi-a6027633d12fee924bf0","title":"A Fundamental Inequality for Lower-bounding the Error Probability for Classical and Quantum Multiple Access Channels and Its Applications","year":2015,"authors":["Takuya Kubo","Hiroshi Nagaoka"],"author_count":2,"journal":"IEICE Trans. Fundamentals, vol. E98-A, no. 12, pp. 2376-2383, 2015","doi":"10.1587/transfun.e98.a.2376","source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["cs.IT","math.IT","quant-ph"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/doi-a6027633d12fee924bf0","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2406.02001","title":"Higher-order Common Information","year":2026,"authors":["Jan Østergaard"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2406.02001","fulltext_endpoint":"/api/document/arxiv-2406.02001/fulltext","references_endpoint":null},{"id":"arxiv-2507.10395","title":"Fault-Tolerant Quantum Error Correction for Constant-Excitation Stabilizer Codes under Coherent Noise","year":2026,"authors":["Ching-Yi Lai","Pei-Hao Liou","Yingkai Ouyang"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2507.10395","fulltext_endpoint":"/api/document/arxiv-2507.10395/fulltext","references_endpoint":null},{"id":"arxiv-2507.02181","title":"Extended Differential Cryptanalysis of Kuznyechik","year":2026,"authors":["Pantelimon Stanica","Ranit Dutta","Bimal Mandal"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["cybersecurity","information-theory"],"keywords":["cs.CR","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2507.02181","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2602.20908","title":"Topology-Aware Integrated Communication, Sensing, and Power Transfer for Multi-User SAGIN","year":2026,"authors":["Han Yu","Jiajun He","Xinping Yi"],"author_count":6,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2602.20908","fulltext_endpoint":null,"references_endpoint":null},{"id":"doi-4e9d78183d6d55bf65a1","title":"Rotatable Array-Aided Hybrid Beamforming for Integrated Sensing and Communication","year":2025,"authors":["Zequan Wang","Liang Yin","Zimeng Lei"],"author_count":6,"journal":"IEEE Internet of Things Journal, vol. 13, no. 7, pp. 14364-14377, Apr. 2026","doi":"10.1109/jiot.2025.3649203","source":"arxiv","topics":["information-theory"],"keywords":["cs.ET","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/doi-4e9d78183d6d55bf65a1","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2606.27211","title":"Quantum group codes for non-Clifford logic: enhanced decoding, addressability and parallelizability","year":2026,"authors":["Jean Gasnier","Virgile Guémard"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2606.27211","fulltext_endpoint":"/api/document/arxiv-2606.27211/fulltext","references_endpoint":null},{"id":"arxiv-2608.05688","title":"Beyond transversality: structure of Clifford circuits for CSS codes","year":2026,"authors":["Victor V. Albert"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.CO","math.GR","math.IT","math.RT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2608.05688","fulltext_endpoint":"/api/document/arxiv-2608.05688/fulltext","references_endpoint":null},{"id":"arxiv-2608.19094","title":"Realizing Logical Diagonal Gates via Transversal Physical $Z$-Rotations in CSS Codes","year":2026,"authors":["K. Sai Mineesh Reddy","Navin Kashyap"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2608.19094","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.23869","title":"Envelopes of upper bounds for nonbinary constant-weight and constant-composition codes","year":2026,"authors":["Artur Akhiiarov","Peter Boyvalenkov","Danila Cherkashin"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.CO","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.23869","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.02219","title":"Existence of an infinite family of substrates satisfying all the postulates of integrated information theory, exclusion included, with arbitrarily large integrated information","year":2026,"authors":["A. Mayeux"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["q-bio.NC","cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.02219","fulltext_endpoint":"/api/document/arxiv-2610.02219/fulltext","references_endpoint":null},{"id":"arxiv-2610.00142","title":"The kernel-block rank profiles of the $\\mathbb{Z}_2\\mathbb{Z}_4$-linear and the $\\mathbb{Z}_{2^s}$-linear Hadamard codes, and a complete classification of the $\\mathbb{Z}_2\\mathbb{Z}_4\\mathbb{Z}_8$-linear Hadamard codes","year":2026,"authors":["Dipak K. Bhunia"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.00142","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.02258","title":"Parameter-Free Interval-Dynamic Regret under Heavy-Tailed Noise","year":2026,"authors":["Vaneet Aggarwal"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.LG","cs.IT","math.IT","math.OC"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.02258","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.02302","title":"Intent-Hiding Jailbreaks: An Information-Theoretic Framework for Compositional Attacks","year":2026,"authors":["Fengwei Tian","Ravi Tandon"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["cybersecurity","information-theory"],"keywords":["cs.CR","cs.IT","cs.LG","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.02302","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.02334","title":"Joint Movement and Compression Ratio Design for Mobile Embodied AI Networks (MEAN)","year":2026,"authors":["Yahao Ding","Jiaxiang Wang","Zhouxiang Zhao"],"author_count":6,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","cs.LG","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.02334","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.02392","title":"Singer-Difference-Set Qudit Stabilizer Codes from Non-Degenerate Quadrics in PG(d,q)PG(d,q): Construction, Structural Theorems, and Monte-Carlo Performance","year":2026,"authors":["Michel Kulhandjian","Lajos Hanzo"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory","quantum-computing"],"keywords":["quant-ph","cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.02392","fulltext_endpoint":"/api/document/arxiv-2610.02392/fulltext","references_endpoint":null},{"id":"arxiv-2610.02414","title":"Unifying Privacy Accounting: Information Equivalence and Information Loss","year":2026,"authors":["Buxin Su","Qiaoshi Yang","Yiding Su"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["cybersecurity","information-theory"],"keywords":["cs.CR","cs.IT","math.IT","math.ST","stat.TH"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.02414","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.02457","title":"Topology-Aware Integrated Sensing, Communication, Charging in Massive Low-Altitude Wireless Network","year":2026,"authors":["Han Yu","Jiajun He","Zhaofeng Liu"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["information-theory"],"keywords":["cs.IT","math.IT"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.02457","fulltext_endpoint":null,"references_endpoint":null}]}