English
Related papers

Related papers: An Achievability Bound for Type-Based Unsourced Mu…

200 papers

We investigate the coexistence of massive and critical Internet of Things (IoT) services in the context of the unsourced multiple access (UMA) framework introduced by Polyanskiy (2017), where all users employ a common codebook and the…

Information Theory · Computer Science 2023-10-16 Khac-Hoang Ngo , Giuseppe Durisi , Alexandre Graell i Amat , Petar Popovski , Anders E. Kalor , Beatriz Soret

Support massive connectivity is an important requirement in 5G wireless communication system. For massive Machine Type Communication (MTC) scenario, since the network is expected to accommodate a massive number of MTC devices with sparse…

Information Theory · Computer Science 2017-01-11 Yanlun Wu , Jun Fang

We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the…

Information Theory · Computer Science 2007-07-13 Ender Tekin , Aylin Yener

The integration of multicarrier modulation and multiple-input-multiple-output (MIMO) is critical for reliable transmission of wireless signals in complex environments, which significantly improve spectrum efficiency. Existing studies have…

Information Theory · Computer Science 2026-01-09 Yuhao Chi , Zhiyuan Peng , Lei Liu , Ying Li , Yao Ge , Chau Yuen

In this paper, we use the linear deterministic approximation model to study a two user multiple access channel mutually interfering with a point to point link, which represents a basic setup of a cellular system. We derive outer bounds on…

Information Theory · Computer Science 2011-05-12 Jörg Bühler , Gerhard Wunder

Leveraging recent results in finite-blocklength information theory, we investigate the problem of designing a control channel in a 5G system. The setup involves the transmission, under stringent latency and reliability constraints, of a…

Information Theory · Computer Science 2018-02-02 Guido Carlo Ferrante , Johan Östman , Giuseppe Durisi , Kittipong Kittichokechai

In this paper, we characterize the fundamental limits of a communication system with three users (i.e., three transmitters) and a single receiver where communication from two covert users must remain undetectable to an external warden. Our…

Information Theory · Computer Science 2024-04-23 Abdelaziz Bounhar , Mireille Sarkiss , Michèle Wigger

In this work, a new upper bound for average error probability of a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound can be universally obtained for all discrete memoryless MACs with given input and…

Information Theory · Computer Science 2009-01-09 Ali Nazari , Achilleas Anastasopoulos , S. Sandeep Pradhan

In this paper, the trade-off between the number of transmissions (or burstiness) $K_n=e^{n\nu}$ of a user, the asynchronism level $A_n=e^{n\alpha}$ in a slotted strongly asynchronous channel, and the ability to distinguish $M_n=e^{nR}$…

Information Theory · Computer Science 2018-07-27 Sara Shahi , Daniela Tuninetti , Natasha Devroye

We study a form of unequal error protection that we term "unequal message protection" (UMP). The message set of a UMP code is a union of $m$ disjoint message classes. Each class has its own error protection requirement, with some classes…

Information Theory · Computer Science 2014-05-06 Yanina Y. Shkel , Vincent Y. F. Tan , Stark C. Draper

We propose a method for tracking an unknown number of targets based on measurements provided by multiple sensors. Our method achieves low computational complexity and excellent scalability by running belief propagation on a suitably devised…

Data Structures and Algorithms · Computer Science 2017-05-24 Florian Meyer , Paolo Braca , Peter Willett , Franz Hlawatsch

Using ideas from Chu and Bode/Fano theories, we characterize the maximum achievable rate over the single-input single-output wireless communication channels under a restriction on the antenna size at the receiver. By employing…

Information Theory · Computer Science 2021-07-19 Volodymyr Shyianov , Mohamed Akrout , Faouzi Bellili , Amine Mezghani , Robert W. Heath

Sparse regression codes with approximate message passing (AMP) decoding have gained much attention in recent times. The concepts underlying this coding scheme extend to unsourced random access with coded compressed sensing (CCS), as first…

Information Theory · Computer Science 2020-10-12 Vamsi K. Amalladinne , Asit Kumar Pradhan , Cynthia Rush , Jean-Francois Chamberland , Krishna R. Narayanan

This paper considers the achievable rate-exponent region of integrated sensing and communication systems in the presence of variable-length coding with feedback. This scheme is fundamentally different from earlier studies, as the coding…

Information Theory · Computer Science 2025-01-27 Ioannis Papoutsidakis , George C. Alexandropoulos

We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver.…

Information Theory · Computer Science 2016-04-26 Parisa Babaheidarian , Somayeh Salimi , Panos Papadimitratos

Classical information theory typically assumes reliable receiver-side processing. We study remote inference when communication is noisy and the receiver itself is built from unreliable components under a finite redundancy budget. Under a…

Information Theory · Computer Science 2026-04-22 Zhenyu Liu , Yi Ma , Rahim Tafazolli

We consider a system of multiple sources, a single communication channel, and a single monitoring station. Each source measures a time-varying quantity with varying levels of accuracy and one of them sends its update to the monitoring…

Artificial Intelligence · Computer Science 2023-10-25 Hitesh Gudwani

In this paper, we analyze the Gaussian X channel in the mixed interference regime. In this regime, multiple access transmission to one of the receivers is shown to be close to optimal in terms of sum rate. Three upper bounds are derived for…

Information Theory · Computer Science 2015-05-26 Praneeth Kumar , Srikrishna Bhashyam

This paper investigates the unsourced random access (URA) scheme to accommodate numerous machine-type users communicating to a base station equipped with multiple antennas. Existing works adopt a slotted transmission strategy to reduce…

Information Theory · Computer Science 2022-02-17 Xinyu Xie , Yongpeng Wu , Jianping An , Junyuan Gao , Wenjun Zhang , Chengwen Xing , Kai-Kit Wong , Chengshan Xiao

Despite being the subject of a growing body of research, non-orthogonal multiple access has failed to garner sufficient support to be included in modern standards. One of the more promising approaches to non-orthogonal multiple access is…

Signal Processing · Electrical Eng. & Systems 2024-10-28 Dylan Wheeler , Erin E. Tripp , Balasubramaniam Natarajan