English
Related papers

Related papers: Unified Error Analysis for Synchronous and Asynchr…

200 papers

We consider the problem of (almost) lossless source coding of two correlated memoryless sources using separate encoders and a joint decoder, that is, Slepian-Wolf (S-W) coding. In our setting, the encoding and decoding are asynchronous,…

Information Theory · Computer Science 2020-07-28 Neri Merhav

We consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes to reconstruct in a successive-refinement fashion. An…

Information Theory · Computer Science 2007-11-13 Chao Tian , Jun Chen , Suhas Diggavi

This paper considers a two-hop interference network, where two users transmit independent messages to their respective receivers with the help of two relay nodes. The transmitters do not have direct links to the receivers; instead, two…

Information Theory · Computer Science 2009-10-09 Yi Cao , Biao Chen

Efficient utilization of licensed spectrum in the cognitive radio network is challenging due to lack of coordination among the Secondary Users (SUs). Distributed algorithms proposed in the literature aim to maximize the network throughput…

Signal Processing · Electrical Eng. & Systems 2018-11-19 Suneet Sawant , Rohit Kumar , Manjesh K. Hanawal , Sumit J. Darak

Asynchronous random access (RA) protocols are particularly attractive for their simplicity and avoidance of tight synchronization requirements. Recent enhancements have shown that the use of successive interference cancellation (SIC) can…

Information Theory · Computer Science 2016-07-22 Federico Clazzer , Francisco Lazaro , Gianluigi Liva , Mario Marchese

It is shown that a large class of communication systems which admit a sum-product algorithm (SPA) based receiver also admit a corresponding linear-programming (LP) based receiver. The two receivers have a relationship defined by the local…

Information Theory · Computer Science 2016-11-15 Mark F. Flanagan

This paper establishes the fundamental limits of a two-user single-receiver system where communication from User 1 (but not from User 2) needs to be undetectable to an external warden. Our fundamental limits show a tradeoff between the…

Information Theory · Computer Science 2023-05-12 Abdelaziz Bounhar , Mireille Sarkiss , Michèle Wigger

Single fault sequential change point problems have become important in modeling for various phenomena in large distributed systems, such as sensor networks. But such systems in many situations present multiple interacting faults. For…

Information Theory · Computer Science 2015-03-17 Ram Rajagopal , XuanLong Nguyen , Sinem Coleri Ergen , Pravin Varaiya

The problem of decentralized sequential change detection is considered, where an abrupt change occurs in an area monitored by a number of sensors; the sensors transmit their data to a fusion center, subject to bandwidth and energy…

Statistics Theory · Mathematics 2013-11-12 Georgios Fellouris , George V. Moustakides

The problem of goal-oriented semantic filtering and timely source coding in multiuser communication systems is considered here. We study a distributed monitoring system in which multiple information sources, each observing a physical…

Information Theory · Computer Science 2024-02-16 Pouya Agheli , Nikolaos Pappas , Marios Kountouris

Although user cooperation cannot improve the capacity of Gaussian two-way channels (GTWCs) with independent noises, it can improve communication reliability. In this work, we aim to enhance and balance the communication reliability in GTWCs…

Information Theory · Computer Science 2025-04-24 Junghoon Kim , Taejoon Kim , Anindya Bijoy Das , Seyyedali Hosseinalipour , David J. Love , Christopher G. Brinton

This work considers the problem of detecting signals from multiple sequentially observed data streams, where only one stream can be observed at every time instant. The goal is to detect signals as quickly as possible while controlling the…

Methodology · Statistics 2026-04-07 Yiming Xing , Georgios Fellouris

This paper considers the problem of simultaneously communicating two messages, a high-security message and a low-security message, to a legitimate receiver, referred to as the security embedding problem. An information-theoretic formulation…

Information Theory · Computer Science 2011-02-09 Hung D. Ly , Tie Liu , Yufei Blankenship

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

This paper studies the tension between throughput and decoding delay performance of two widely-used network coding schemes: random linear network coding (RLNC) and instantly decodable network coding (IDNC). A single-hop broadcasting system…

Information Theory · Computer Science 2015-03-20 Parastoo Sadeghi , Mingchao Yu

The problem of error-control in random linear network coding is considered. A ``noncoherent'' or ``channel oblivious'' model is assumed where neither transmitter nor receiver is assumed to have knowledge of the channel transfer…

Information Theory · Computer Science 2008-03-25 Ralf Koetter , Frank Kschischang

In this paper, we consider a two-user multiple access fading channel under quality-of-service (QoS) constraints. We initially formulate the transmission rates for both transmitters, where the transmitters have arbitrarily distributed input…

Information Theory · Computer Science 2016-08-08 Marwan Hammouda , Sami Akin , Jürgen Peissig

Wireless systems are increasingly used for Machine-Type Communication (MTC), where the users sporadically send very short messages. In such a setting, the overhead imposed by channel estimation is substantial, thereby demanding noncoherent…

Information Theory · Computer Science 2016-11-18 Zoran Utkovski , Tome Eftimov , Petar Popovski

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…

Information Theory · Computer Science 2025-03-03 Anuj S. Vora , Ankur A. Kulkarni

Collisions with hidden terminals is a major cause of performance degradation in 802.11 and likewise wireless networks. Carrier sense multiple access with collision avoidance (CSMA/CA) is utilized to avoid collisions at the cost of spatial…

Networking and Internet Architecture · Computer Science 2014-01-30 Zhiyi Zhou , Dongning Guo , Michael L. Honig
‹ Prev 1 4 5 6 7 8 10 Next ›