English
Related papers

Related papers: Three-terminal Erasure Source-Broadcast with Feedb…

200 papers

We provide tight upper and lower bounds on the noise resilience of interactive communication over noisy channels with feedback. In this setting, we show that the maximal fraction of noise that any robust protocol can resist is 1/3.…

Data Structures and Algorithms · Computer Science 2015-01-06 Klim Efremenko , Ran Gelles , Bernhard Haeupler

In this work, we examine cognitive radio networks, where secondary users may act as relays for messages sent by the primary user, hence offering performance improvement of primary transmissions, while at the same time obtaining more…

Information Theory · Computer Science 2019-08-29 Athanasios Papadopoulos , Nestor D. Chatzidiamantis , Leonidas Georgiadis

In this paper, we introduce an autoencoder (AE)-based scheme for end-to-end optimization of a multi-user molecule mixture communication system. In the proposed scheme, each transmitter leverages an encoder network that maps the user symbol…

For information transmission a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes without delay all the outputs of the forward channel via that feedback…

Information Theory · Computer Science 2010-11-10 M. V. Burnashev , H. Yamamoto

This work presents another look at an analog network coding scheme for multi-user spread-spectrum communication systems. Our proposed system combines coding and cooperation between a relay and users to boost the throughput and to exploit…

Information Theory · Computer Science 2015-12-25 Georges Kaddoum , Pascal Giard

We consider data transmission over a network where each edge is an erasure channel and where the inner nodes transmit a random linear combination of their incoming information. We distinguish two channel models in this setting, the row and…

Information Theory · Computer Science 2017-10-18 Heide Gluesing-Luerssen , Anna-Lena Horlemann-Trautmann

Maximum distance separable erasure coding has been introduced in wireless networks based on random medium access protocols in order to recover collided and erased packets. So, this help to avoid retransmission process which weaken the…

Signal Processing · Electrical Eng. & Systems 2020-10-13 Mohamed Lamine Boucenna , Malek Benslama

This paper investigates the problem of zero-delay joint source-channel coding of a vector Gauss-Markov source over a multiple-input multiple-output (MIMO) additive white Gaussian noise (AWGN) channel with feedback. In contrast to the…

Information Theory · Computer Science 2023-10-19 Barron Han , Oron Sabag , Victoria Kostina , Babak Hassibi

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

This paper provides lower bounds on the reconstruction error for transmission of two continuous correlated random vectors sent over both sum and parallel channels using the help of two causal feedback links from the decoder to the encoders…

Information Theory · Computer Science 2013-08-16 Ayşe Ünsal , Raymond Knopp

This paper addresses the optimal design of limited-feedback downlink multi-user spatial multiplexing systems. A multiple-antenna base-station is assumed to serve multiple single-antenna users, who quantize and feed back their channel state…

Information Theory · Computer Science 2011-12-30 Behrouz Khoshnevis , Wei Yu

This paper considers a degraded Gaussian broadcast channel over which Gaussian sources are to be communicated. When the sources are independent, this paper shows that hybrid coding achieves the optimal distortion region, the same as that of…

Information Theory · Computer Science 2009-06-16 Rajiv Soundararajan , Sriram Vishwanath

This paper investigates streaming codes over three-node relay networks under burst packet erasures with a delay constraint $T$. In any sliding window of $T+1$ consecutive packets, the source-to-relay and relay-to-destination channels may…

Information Theory · Computer Science 2025-09-09 Zhipeng Li , Wenjie Ma , Zhifang Zhang

A setup involving zero-delay sequential transmission of a vector Markov source over a burst erasure channel is studied. A sequence of source vectors is compressed in a causal fashion at the encoder, and the resulting output is transmitted…

Information Theory · Computer Science 2014-10-10 Farrokh Etezadi , Ashish Khisti , Mitchell Trott

While existing studies have highlighted the advantages of deep learning (DL)-based joint source-channel coding (JSCC) schemes in enhancing transmission efficiency, they often overlook the crucial aspect of resource management during the…

Information Theory · Computer Science 2024-04-01 Kaiyi Chi , Qianqian Yang , Yuanchao Shu , Zhaohui Yang , Zhiguo Shi

We present an AI-based framework for semantic transmission of multimedia data over band-limited, time-varying channels. The method targets scenarios where large content is split into multiple packets, with an unknown number potentially…

Multimedia · Computer Science 2026-01-29 Homa Esfahanizadeh , Nargis Fayaz , Jinfeng Du , Harish Viswanathan

Relay networks aid in increasing the rate of communication from source to destination. However, the capacity of even a three-terminal relay channel is an open problem. In this work, we propose a new lower bound for the capacity of the…

Information Theory · Computer Science 2016-11-17 Mayur Agrawal , David Love , Venkataramanan Balakrishnan

Achievability and converse results for the lossy transmission of correlated sources over Shannon's two-way channels (TWCs) are presented. A joint source-channel coding theorem for independent sources and TWCs for which adaptation cannot…

Information Theory · Computer Science 2018-05-08 Jian-Jia Weng , Fady Alajaji , Tamás Linder

The design of zero-delay Joint Source-Channel Coding (JSCC) schemes for the transmission of correlated information over fading Multiple Access Channels (MACs) is an interesting problem for many communication scenarios like Wireless Sensor…

Information Theory · Computer Science 2024-01-31 O. Fresnedo , P. Suárez-Casal , L. Castedo

In this paper we focus on a feedback mechanism for unsourced random access (URA) communications. We propose an algorithm to construct feedback packets broadcasted to the users by the base station (BS) as well as the feedback packet format…

Information Theory · Computer Science 2022-11-23 Murwan Bashir , Ehsan Nassaji , Dmitri Truhachev , Alireza Bayesteh , Monirosharieh Vameghestahbanati