English
Related papers

Related papers: Trade-off between Communication and Cooperation in…

200 papers

This work presents novel achievable schemes for the 2-user symmetric linear deterministic interference channel with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. The proposed achievable scheme…

Information Theory · Computer Science 2013-04-04 Parthajit Mohapatra , Chandra R. Murthy

Inner and outer bounds are established on the capacity region of two-sender, two-receiver interference channels where one transmitter knows both messages. The transmitter with extra knowledge is referred to as being cognitive. The inner…

Information Theory · Computer Science 2007-10-22 I. Maric , A. Goldsmith , G. Kramer , S. Shamai

Consider the channel coding problem where two users are interacting in order to communicate an i.i.d. source X1 from User 1 to User 2 with distortion D1 and an i.i.d. source X2 from User 2 to User 1 with distortion D2. X1 and X2 may be…

Information Theory · Computer Science 2018-05-14 Mukul Agarwal

In theory coordinated multi-point transmission (CoMP) promises vast gains in spectral efficiency. But industrial field trials show rather disappointing throughput gains, whereby the major limiting factor is proper sharing of channel state…

Information Theory · Computer Science 2016-11-18 Jan Schreck , Gerhard Wunder , Peter Jung

This paper proposes a linear interference alignment (IA) scheme which can be used for uplink channels in a general multicell multiuser MIMO cellular network. The proposed scheme aims to align interference caused by signals from a set of…

Information Theory · Computer Science 2014-08-22 Khanh Pham , Kyungchun Lee

We focus on the following instance of an index coding problem, where a set of receivers are required to decode multiple messages, whilst each knows one of the messages a priori. In particular, here we consider a generalized setting where…

Information Theory · Computer Science 2014-03-13 Lawrence Ong , Fabian Lim , Chin Keong Ho

Space-time codes leverage the availability of multiple antennas to enhance the reliability of communication over wireless channels. While space-time codes have initially been designed with a focus on open-loop systems, recent technological…

Information Theory · Computer Science 2016-11-17 Che Lin , Vasanthan Raghavan , Venu Veeravalli

An index code is said to be locally decodable if each receiver can decode its demand using its side information and by querying only a subset of the transmitted codeword symbols instead of observing the entire codeword. Local decodability…

Information Theory · Computer Science 2019-01-18 Lakshmi Natarajan , Hoang Dau , Prasad Krishnan , V. Lalitha

The optimal rate region for interference networks is characterized when encoding is restricted to random code ensembles with superposition coding and time sharing. A simple simultaneous nonunique decoding rule, under which each receiver…

Information Theory · Computer Science 2016-11-15 Bernd Bandemer , Abbas El Gamal , Young-Han Kim

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

We analyze the performance of a system composed of two interfering point-to-point links where the transmitters can exploit a common relay to improve their individual transmission rate. When the relay uses the amplify-and-forward protocol we…

Information Theory · Computer Science 2009-04-20 Brice Djeumou , Elena Veronica Belmega , Samson Lasaulce

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 study the three-user interference channel where each transmitter has local feedback of the signal from its targeted receiver. We show that in the important case where the channel coefficients are static, exact alignment can be achieved…

Information Theory · Computer Science 2012-10-02 Vasilis Ntranos , Viveck R. Cadambe , Bobak Nazer , Giuseppe Caire

This paper elaborates on the achievable schemes of interference alignment in constant channels via finite amplify-and-forward (AF) relays. Consider $K$ sources communicating with $K$ destinations without direct links besides the relay…

Information Theory · Computer Science 2012-11-20 Haichuan Zhou , Tharm Ratnarajah

We derive the capacity of the binary multi-way relay channel, in which multiple users exchange messages at a common rate through a relay. The capacity is achieved using a novel functional-decode-forward coding strategy. In the…

Information Theory · Computer Science 2015-03-14 Lawrence Ong , Sarah J. Johnson , Christopher M. Kellett

We explore 5 network communication problems where the possibility of interference alignment, and consequently the total number of degrees of freedom (DoF) with channel uncertainty at the transmitters are unknown. These problems share the…

Information Theory · Computer Science 2016-11-18 Syed A. Jafar

Integrated sensing and communication (ISAC) base stations can provide communication and wide range sensing information for vehicles via downlink (DL) transmission, thus enhancing vehicle driving safety. One major challenge for realizing…

Performance · Computer Science 2023-10-13 Wangjun Jiang , Zhiqing Wei , Fan Liu , Zhiyong Feng , Ping Zhang

Physical layer network coding (PLNC) has the potential to improve throughput of multi-hop networks. However, most of the works are focused on the simple, three-node model with two-way relaying, not taking into account the fact that there…

Information Theory · Computer Science 2016-11-18 Hironori Fukui , Hiroyuki Yomo , Petar Popovski

Strongly conflict-avoiding codes (SCACs) are employed in a slot-asynchronous multiple-access collision channel without feedback to guarantee that each active user can send at least one packet successfully in the worst case within a fixed…

Information Theory · Computer Science 2016-05-17 Yijin Zhang , Yuan-Hsun Lo , Wing Shing Wong

We consider the problem of block-coded communication, where in each block, the channel law belongs to one of two disjoint sets. The decoder is aimed to decode only messages that have undergone a channel from one of the sets, and thus has to…

Information Theory · Computer Science 2015-09-08 Nir Weinberger , Neri Merhav