中文
相关论文

相关论文: Shannon meets Myerson: Information Extraction from…

200 篇论文

We consider a setting of non-cooperative communication where a receiver wants to recover randomly generated sequences of symbols that are observed by a strategic sender. The sender aims to maximize an average utility that may not align with…

信息论 · 计算机科学 2025-03-03 Anuj S. Vora , Ankur A. Kulkarni

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

Energy harvesting sensor nodes are gaining popularity due to their ability to improve the network life time and are becoming a preferred choice supporting 'green communication'. In this paper we focus on communicating reliably over an AWGN…

信息论 · 计算机科学 2012-12-14 Rajesh Ramachandran , Vinod Sharma , Pramod Viswanath

Semantic communication has attracted significant interest recently due to its capability to meet the fast growing demand on user-defined and human-oriented communication services such as holographic communications, eXtended reality (XR),…

信息论 · 计算机科学 2023-12-12 Jingxuan Chai , Yong Xiao , Guangming Shi , Walid Saad

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

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

信息论 · 计算机科学 2016-11-15 Zheng Wang , Jie Luo

We analyze deterministic message identification via channels with non-discrete additive white noise and with a noiseless feedback link under both average power and peak power constraints. The identification task is part of Post Shannon…

信息论 · 计算机科学 2022-02-18 Moritz Wiese , Wafa Labidi , Christian Deppe , Holger Boche

This paper analyzes the fundamental limit of the strategic semantic communication problem in which a transmitter obtains a limited number of indirect observation of an intrinsic semantic information source and can then influence the…

信息论 · 计算机科学 2022-08-09 Yong Xiao , Xu Zhang , Yingyu Li , Guangming Shi , Tamer Basar

This paper analyzes a dynamic interaction between a fully rational, privately informed sender and a boundedly rational, uninformed receiver with memory constraints. The sender controls the flow of information, while the receiver designs a…

理论经济学 · 经济学 2025-11-12 Qingmin Liu , Yuyang Miao

In this paper, a diffusion-based molecular communication channel between two nano-machines is considered. The effect of the amount of memory on performance is characterized, and a simple memory-limited decoder is proposed and its…

Shannon theory models communication as the reliable transfer of symbol sequences, with performance governed by capacity and rate-distortion limits. When both endpoints possess strong predictors -- as in modern large language models and…

信息论 · 计算机科学 2026-02-12 Ozgur Ercetin , Mohaned Chraiti

The Bayesian persuasion model studies communication between an informed sender and a receiver with a payoff-relevant action, emphasizing the ability of a sender to extract maximal surplus from his informational advantage. In this paper we…

计算机科学与博弈论 · 计算机科学 2020-06-04 Ronen Gradwohl , Niklas Hahn , Martin Hoefer , Rann Smorodinsky

This letter considers a network comprising a transmitter, which employs random linear network coding to encode a message, a legitimate receiver, which can recover the message if it gathers a sufficient number of linearly independent coded…

密码学与安全 · 计算机科学 2022-03-08 Amjad Saeed Khan , Andrea Tassi , Ioannis Chatzigeorgiou

This paper presents a tutorial for CS applications in communications networks. The Shannon's sampling theorem states that to recover a signal, the sampling rate must be as least the Nyquist rate. Compressed sensing (CS) is based on the…

网络与互联网体系结构 · 计算机科学 2014-02-07 Hong Huang , Satyajayant Misra , Wei Tang , Hajar Barani , Hussein Al-Azzawi

We explore two fundamental questions at the intersection of sampling theory and information theory: how channel capacity is affected by sampling below the channel's Nyquist rate, and what sub-Nyquist sampling strategy should be employed to…

信息论 · 计算机科学 2015-03-19 Yuxin Chen , Yonina C. Eldar , Andrea J. Goldsmith

Reliable communication imposes an upper limit on the achievable rate, namely the Shannon capacity. Wyner's wiretap coding, which ensures a security constraint also, in addition to reliability, results in decrease of the achievable rate. To…

信息论 · 计算机科学 2017-02-14 Shahid M. Shah , Vinod Sharma

Sensor nodes with energy harvesting sources are gaining popularity due to their ability to improve the network life time and are becoming a preferred choice supporting `green communication'. We study such a sensor node with an energy…

信息论 · 计算机科学 2011-02-22 R Rajesh , Vinod Sharma , Pramod Viswanath

Recently, semantic communications are envisioned as a key enabler of future 6G networks. Back to Shannon's information theory, the goal of communication has long been to guarantee the correct reception of transmitted messages irrespective…

信息论 · 计算机科学 2021-10-18 Mohamed Sana , Emilio Calvanese Strinati

In many real-world scenarios, experts must convey complex information with limited message capacity. This paper explores how the availability of messages influences an expert's persuasive ability. We develop a geometric representation of…

理论经济学 · 经济学 2024-05-09 Yunus C. Aybas , Eray Turkel

We study a Bayesian persuasion setting in which a sender wants to persuade a critical mass of receivers by revealing partial information about the state to them. The homogeneous binary-action receivers are located on a communication…

计算机科学与博弈论 · 计算机科学 2025-09-12 Toygar T. Kerman , Anastas P. Tenev , Konstantin Zabarnyi
‹ 上一页 1 2 3 10 下一页 ›