English
Related papers

Related papers: Worst-Case Per-User Error Bound for Asynchronous U…

200 papers

Several security models of multiple-access channel (MAC) are investigated. First, we study the degraded MAC with confidential messages, where two users transmit their confidential messages (no common message) to a destination, and each user…

Information Theory · Computer Science 2013-01-01 Bin Dai , A. J. Han Vinck , Zhuojun Zhuang , Yuan Luo

The reliability function of a channel is the maximum achievable exponential rate of decay of the error probability as a function of the transmission rate. In this work, we derive bounds on the reliability function of discrete memoryless…

Information Theory · Computer Science 2023-06-13 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

We study the problem of allocating multiple users to a set of wireless channels in a decentralized manner when the channel quali- ties are time-varying and unknown to the users, and accessing the same channel by multiple users leads to…

Multiagent Systems · Computer Science 2016-11-25 Cem Tekin , Mingyan Liu

We study the problem of communicating over a single-source single-terminal network in the presence of an adversary that may jam a single link of the network. If any one of the edges can be jammed, the capacity of such networks is well…

Information Theory · Computer Science 2014-10-09 Wentao Huang , Tracey Ho , Michael Langberg , Joerg Kliewer

Over-the-air computation (OAC) is a promising wireless communication method for aggregating data from many devices in dense wireless networks. The fundamental idea of OAC is to exploit signal superposition to compute functions of multiple…

Signal Processing · Electrical Eng. & Systems 2023-09-29 Henrik Hellström , Saeed Razavikia , Viktoria Fodor , Carlo Fischione

Millimeter wave (mmWave) communication systems using adaptive-resolution analog-to-digital converters (RADCs) have recently drawn considerable interests from the research community as benefit of their high energy efficiency and low…

Information Theory · Computer Science 2020-09-29 Xihan Chen , Yunlong Cai , An Liu , Lajos Hanzo

In wireless networks, communication links may be subject to random fatal impacts: for example, sensor networks under sudden power losses or cognitive radio networks with unpredictable primary user spectrum occupancy. Under such…

Information Theory · Computer Science 2016-11-15 Meng Zeng , Rui Zhang , Shuguang Cui

A unified approach to energy-efficient power control is proposed for code-division multiple access (CDMA) networks. The approach is applicable to a large family of multiuser receivers including the matched filter, the decorrelator, the…

Information Theory · Computer Science 2007-07-13 Farhad Meshkati , Dongning Guo , H. Vincent Poor , Stuart C. Schwartz

As our main result we show that, in order to achieve the randomness assisted message - and entanglement transmission capacities of a finite arbitrarily varying quantum channel it is not necessary that sender and receiver share…

Quantum Physics · Physics 2015-06-12 Holger Boche , Janis Noetzel

This paper analyzes the throughput of an unlicensed wireless network where messages decoded in outage may be retransmitted. We assume that some wireless devices such as sensors are the unlicensed users, which communicate in the licensed…

Information Theory · Computer Science 2018-03-07 Iran Ramezanipour , Pedro H. J. Nardelli , Hirley Alves , Ari Pouttu

This paper addresses the unsourced/uncoordinated random access problem in an integrated sensing and communications (ISAC) system, with a focus on uplink multiple access code design. Recent theoretical advancements highlight that an ISAC…

Information Theory · Computer Science 2025-04-25 Zhentian Zhang , Jian Dang , Kai-Kit Wong , Zaichen Zhang , Christos Masouros

This paper considers the massive connectivity problem in an asynchronous grant-free random access system, where a huge number of devices sporadically transmit data to a base station (BS) with imperfect synchronization. The goal is to design…

Information Theory · Computer Science 2021-01-05 Weifeng Zhu , Meixia Tao , Xiaojun Yuan , Yunfeng Guan

A new problem formulation is presented for the Gaussian interference channels (GIFC) with two pairs of users, which are distinguished as primary users and secondary users, respectively. The primary users employ a pair of encoder and decoder…

Information Theory · Computer Science 2016-11-17 Xiujie Huang , Xiao Ma , Lei Lin , Baoming Bai

Recently coded caching has emerged as a promising means to handle continuously increasing wireless traffic. However, coded caching requires users to cooperate in order to minimize the overall transmission rate. How users with heterogeneous…

Information Theory · Computer Science 2019-12-02 Yawei Lu , Wei Chen , H. Vincent Poor

In this paper, we investigate the signal shaping in a two-user discrete time memoryless Gaussian multiple-access channel (MAC) with computation. It is shown that by optimizing input probability distribution, the transmission rate per…

Information Theory · Computer Science 2017-01-26 Zhiyong Chen , Hui Liu

In unmanned aerial vehicle (UAV) networks, high-capacity data transmission is of utmost importance for applications such as intelligent transportation, smart cities, and forest monitoring, which rely on the mobility of UAVs to collect and…

Networking and Internet Architecture · Computer Science 2023-08-15 Yingying Zou , Zhiqing Wei , Yanpeng Cui , Xinyi Liu , Zhiyong Feng

We investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to send correlated Gaussian sources on a Gaussian broadcast channel where each…

Information Theory · Computer Science 2017-03-02 Chao Tian , Jun Chen , Suhas Diggavi , Shlomo Shamai

We consider the problem of universally communicating over an unknown and arbitrarily varying channel, using feedback. The focus of this paper is on determining the input behavior, and specifically, a prior distribution which is used to…

Information Theory · Computer Science 2012-02-03 Yuval Lomnitz , Meir Feder

The minimum energy, and, more generally, the minimum cost, to transmit one bit of information has been recently derived for bursty communication when information is available infrequently at random times at the transmitter. This result…

Information Theory · Computer Science 2013-03-25 Aslan Tchamkerten , Venkat Chandar , Giuseppe Caire

This paper investigates a channel-coded multiuser system operated with orthogonal frequency-division multiplexing (OFDM) and interleaved division multiple-access (IDMA). To realize the potential advantage of OFDM-IDMA, two challenges must…

Information Theory · Computer Science 2016-11-15 Taotao Wang , Soung Chang Liew
‹ Prev 1 8 9 10 Next ›