English
Related papers

Related papers: Transmission and Storage Rates for Sequential Mass…

200 papers

We investigate fully asynchronous unsourced random access (URA), and propose a high-performing scheme that employs on-off division multiple access (ODMA). In this scheme, active users distribute their data over the transmit block based on a…

Signal Processing · Electrical Eng. & Systems 2025-04-16 Mert Ozates , Mohammad Kazemi , Gianluigi Liva , Deniz Gündüz

Index coding is often studied with the assumption that a single source has all the messages requested by the receivers. We refer to this as \emph{centralized} index coding. In contrast, this paper focuses on \emph{distributed} index coding…

Information Theory · Computer Science 2015-12-21 Parastoo Sadeghi

This work considers reliable transmission of general correlated sources over the multiple-access relay channel (MARC) and the multiple-access broadcast relay channel (MABRC). In MARCs only the destination is interested in a reconstruction…

Information Theory · Computer Science 2012-07-02 Yonathan Murin , Ron Dabora , Deniz Gündüz

Rate-Splitting Multiple Access (RSMA) has been recognized as a promising multiple access technique for future wireless communication systems. Recent research demonstrates that RSMA can maintain its superiority without relying on Successive…

Information Theory · Computer Science 2025-07-16 Sibo Zhang , Bruno Clerckx , David Vargas

The enormous quality of service (QoS) demands posed by mission-critical use-cases of future 5G/6G wireless communication raise the need for resource-efficient highly reliable and low latency connectivity solutions. Multi-connectivity is…

Information Theory · Computer Science 2022-11-24 Yasemin Karacora , Aydin Sezgin

This paper investigates the massive random access for a huge amount of user devices served by a base station (BS) equipped with a massive number of antennas. We consider a grant-free unsourced random access (U-RA) scheme where all users…

Information Theory · Computer Science 2020-09-15 Xinyu Xie , Yongpeng Wu , Junyuan Gao , Wenjun Zhang

In this paper, we discuss the potential for improvement of the simple random access scheme by utilizing local information such as the received signal-to-interference-plus-noise-ratio (SINR). We propose a spatially adaptive random access…

Information Theory · Computer Science 2015-05-05 Dong Min Kim , Seong-Lyun Kim

We begin by presenting a simple lossy compressor operating at near-zero rate: The encoder merely describes the indices of the few maximal source components, while the decoder's reconstruction is a natural estimate of the source components…

Information Theory · Computer Science 2016-03-09 Albert No , Tsachy Weissman

RDMA is vital for efficient distributed training across datacenters, but millisecond-scale latencies complicate the design of its reliability layer. We show that depending on long-haul link characteristics, such as drop rate, distance and…

In this paper, we present a unified study of the limiting density in one-dimensional random sequential adsorption (RSA) processes where segment lengths are drawn from a given distribution. In addition to generic bounds, we are also able to…

Probability · Mathematics 2024-03-22 Roger Fan , Nitya Mani

This paper investigates the unsourced random access (URA) problem with a massive multiple-input multiple-output receiver that serves wireless devices in the near-field of radiation. We employ an uncoupled transmission protocol without…

Information Theory · Computer Science 2024-01-26 Xinyu Xie , Yongpeng Wu , Jianping An , Derrick Wing Kwan Ng , Chengwen Xing , Wenjun Zhang

Unsourced random access (URA) is an increasingly popular communication paradigm attuned to machine driven data transfers in \textit{Internet-of-Things} (IoT) networks. In a typical URA setting, a small subset of active devices within a very…

Information Theory · Computer Science 2021-05-06 Vamsi K. Amalladinne , Jean-Francois Chamberland , Krishna R. Narayanan

How is the limited capacity of working memory efficiently used to support human linguistic behaviors? In this paper, we propose Strategic Resource Allocation (SRA) as an efficiency principle for memory encoding in sentence processing. The…

Computation and Language · Computer Science 2025-09-01 Weijie Xu , Richard Futrell

Rate-Splitting Multiple Access (RSMA) has emerged as a powerful multiple access, interference management, and multi-user strategy for next generation communication systems. In this tutorial, we depart from the orthogonal multiple access…

Information Theory · Computer Science 2023-01-11 Bruno Clerckx , Yijie Mao , Eduard A. Jorswieck , Jinhong Yuan , David J. Love , Elza Erkip , Dusit Niyato

In this paper, coded slotted ALOHA (CSA) is introduced as a powerful random access scheme to the MAC frame. In CSA, the burst a generic user wishes to transmit in the MAC frame is first split into segments, and these segments are then…

Information Theory · Computer Science 2016-11-18 Enrico Paolini , Gianluigi Liva , Marco Chiani

The Random Sequential Adsorption (RSA) problem holds crucial theoretical and practical significance, serving as a pivotal framework for understanding and optimizing particle packing in various scientific and technological applications. Here…

Statistical Mechanics · Physics 2024-04-09 G Palacios , A M S Macêdo , Sumanta Kundu , M A F Gomes

We consider multiple transmitters aiming to communicate their source signals (e.g., images) over a multiple access channel (MAC). Conventional communication systems minimize interference by orthogonally allocating resources (time and/or…

Networking and Internet Architecture · Computer Science 2025-04-08 Selim F. Yilmaz , Can Karamanli , Deniz Gunduz

In multi-user multi-antenna communications, it is well-known in theory that Rate-Splitting Multiple Access (RSMA) can achieve a higher spectral efficiency than both Space Division Multiple Access (SDMA) and Non-Orthogonal Multiple Access…

Signal Processing · Electrical Eng. & Systems 2023-11-16 Xinze Lyu , Sundar Aditya , Junghoon Kim , Bruno Clerckx

Modern Internet services commonly replicate critical data across several geographical locations using state-machine replication (SMR). Due to their reliance on a leader replica, classical SMR protocols offer limited scalability and…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-08-07 Tuanir França Rezende , Pierre Sutra

The problem of lossless fixed-rate streaming coding of discrete memoryless sources with side information at the decoder is studied. A random time-varying tree-code is used to sequentially bin strings and a Stack Algorithm with a variable…

Information Theory · Computer Science 2007-07-13 Hari Palaiyanur , Anant Sahai