中文
相关论文

相关论文: Round-Preserving Asymptotic Compression of Prior-F…

200 篇论文

Shannon's rate-distortion theory treats source symbols as unstructured labels. When the source is a knowledge base equipped with a logical proof system, a natural fidelity criterion is closure fidelity: a reconstruction is acceptable if it…

信息论 · 计算机科学 2026-04-14 Jianfeng Xu

This paper investigates an information-theoretic model of secure semantic-aware communication. For this purpose, we consider the lossy joint source-channel coding (JSCC) of a memoryless semantic source transmitted over a memoryless wiretap…

信息论 · 计算机科学 2026-05-26 Denis Kozlov , Mahtab Mirmohseni , Rahim Tafazolli

A process of preparation, transmission and subsequent projective measurement of a qubit can be simulated by a classical model with only two bits of communication and some amount of shared randomness. However no model for n qubits with a…

量子物理 · 物理学 2011-12-30 Alberto Montina

Self-stabilization is a general paradigm to provide forward recovery capabilities to distributed systems and networks. Intuitively, a protocol is self-stabilizing if it is able to recover without external intervention from any catastrophic…

数据结构与算法 · 计算机科学 2008-11-25 Stéphane Devismes , Toshimitsu Masuzawa , Sébastien Tixeuil

The first section starts with the basic definitions following mainly the notations of the book written by E. Kushilevitz and N. Nisan. At the end of the first section I examine tree-balancing. In the second section I summarize the…

计算复杂性 · 计算机科学 2010-07-13 Dömötör Pálvölgyi

Semantic communication is deemed as a revolution of Shannon's paradigm in the six-generation (6G) wireless networks. It aims at transmitting the extracted information rather than the original data, which receivers will try to recover.…

信号处理 · 电气工程与系统科学 2023-12-08 Yang Li , Xinyu Zhou , Jun Zhao

We show several results related to interactive proof modes of communication complexity. First we show lower bounds for the QMA-communication complexity of the functions Inner Product and Disjointness. We describe a general method to prove…

计算复杂性 · 计算机科学 2011-01-04 Hartmut Klauck

We prove new bounds on the quantum communication complexity of the disjointness and equality problems. For the case of exact and non-deterministic protocols we show that these complexities are all equal to n+1, the previous best lower bound…

量子物理 · 物理学 2017-01-03 Peter Hoyer , Ronald de Wolf

Information theory is introduced in this lecture note with a particular emphasis on its relevance to algebraic coding theory. The document develops the mathematical foundations for quantifying uncertainty and information transmission by…

信息论 · 计算机科学 2025-12-08 El Mahdi Mouloua , Essaid Mohamed

In many complex systems, whether biological or artificial, the thermodynamic costs of communication among their components are large. These systems also tend to split information transmitted between any two components across multiple…

统计力学 · 物理学 2024-02-12 Farita Tasnim , Nahuel Freitas , David H. Wolpert

The generalization of Shannon's theory to include messages with given autocorrelations is presented. The analytical calculation of the channel capacity is based on the transfer matrix method of the effective 1D Hamiltonian. This bridge…

统计力学 · 物理学 2007-05-23 Ido Kanter , Hanan Rosemarin

We study channel simulation under common randomness assistance in the finite-blocklength regime and identify the smooth channel max-information as a linear program one-shot converse on the minimal simulation cost for fixed error tolerance.…

信息论 · 计算机科学 2024-10-10 Michael X. Cao , Navneeth Ramakrishnan , Mario Berta , Marco Tomamichel

Shannon's secrecy system is studied in a setting, where both the legitimate decoder and the wiretapper have access to side information sequences correlated to the source, but the wiretapper receives both the coded information and the side…

信息论 · 计算机科学 2007-07-13 Neri Merhav

We consider the situation in which a transmitter attempts to communicate reliably over a discrete memoryless channel while simultaneously ensuring covertness (low probability of detection) with respect to a warden, who observes the signals…

信息论 · 计算机科学 2016-11-18 Matthieu R. Bloch

We show that $T$ rounds of interaction over the binary symmetric channel $BSC_{1/2-\epsilon}$ with feedback can be simulated with $O(\epsilon^2 T)$ rounds of interaction over a noiseless channel. We also introduce a more general "energy…

信息论 · 计算机科学 2014-09-16 Mark Braverman , Jieming Mao

We study reliable communication in uncoordinated vehicular communication from the perspective of Shannon theory. Our system model for the information transmission is that of an Arbitrarily Varying Channel (AVC): One sender-receiver pair…

信息论 · 计算机科学 2019-06-06 Christian Arendt , Janis Nötzel , Holger Boche

Hardness amplification is a central problem in the study of interactive protocols. While ``natural'' parallel repetition transformation is known to reduce the soundness error of some special cases of interactive arguments: three-message…

密码学与安全 · 计算机科学 2021-05-04 Itay Berman , Iftach Haitner , Eliad Tsfadia

Semantic communication has emerged as a promising paradigm to address the challenges of next-generation communication networks. While some progress has been made in its conceptualization, fundamental questions remain unresolved. In this…

信息论 · 计算机科学 2025-05-05 Javad Gholipour , Rafael F. Schaefer , Gerhard P. Fettweis

How much adversarial noise can protocols for interactive communication tolerate? This question was examined by Braverman and Rao (IEEE Trans. Inf. Theory, 2014) for the case of "robust" protocols, where each party sends messages only in…

数据结构与算法 · 计算机科学 2015-08-10 Shweta Agrawal , Ran Gelles , Amit Sahai

Despite the fact that Shannon and Weaver's Mathematical Theory of Communication was published over 70 years ago, all communication systems continue to operate at the first of three levels defined in this theory: the technical level. In this…

信号处理 · 电气工程与系统科学 2023-01-09 Dylan Wheeler , Erin E. Tripp , Balasubramaniam Natarajan