English
Related papers

Related papers: Channel Codes for Relayless Networks with General …

200 papers

We consider explicit constructions of multi-level lattice codes that universally approach the capacity of the compound block-fading channel. Specifically, building on algebraic partitions of lattices, we show how to construct codes with…

Information Theory · Computer Science 2017-05-09 Antonio Campello , Ling Liu , Cong Ling

This paper considers the multi-way relay channel (MWRC) where multiple users exchange messages via a single relay. The capacity region is derived for a special class of MWRCs where (i) the uplink and the downlink are separated in the sense…

Information Theory · Computer Science 2012-09-10 Lawrence Ong , Sarah J. Johnson

The asynchronous capacity region of memoryless multiple-access channels is the union of certain polytopes. It is well-known that vertices of such polytopes may be approached via a technique called successive decoding. It is also known that…

Information Theory · Computer Science 2016-11-17 Ninoslav Marina , Bixio Rimoldi

This paper investigates the general distributed lossless/lossy source coding formulated by Jana and Blahut. Their multi-letter rate-distortion region, an alternative to the region derived by Yang and Qin, is characterized by entropy…

Information Theory · Computer Science 2024-07-08 Jun Muramatsu

We consider the capacity of memoryless finite-state multiple access channel (FS-MAC) with causal asymmetric noisy state information available at both transmitters and complete state information available at the receiver. Single letter inner…

Information Theory · Computer Science 2011-06-03 Nevroz Şen , Giacomo Como , Serdar Yüksel , Fady Alajaji

In this paper, we characterize the capacity region for the two-user linear Gaussian compound Multiple Access Channel with common message (MACC) and with intersymbol interference (ISI) under an input power constraint. The region is obtained…

Information Theory · Computer Science 2012-12-19 Mostafa Monemizadeh , Saeed Hajizadeh , Seyed Alireza Seyedin , Ghosheh Abed Hodtani

In multi user Gaussian relay networks, it is desirable to transmit private information to each user as well as common information to all of them. However, the capacity region of such networks with both kinds of information is not easy to…

Information Theory · Computer Science 2018-01-16 Mohamed S. Ibrahim , Mohammed Nafie , Yahya Mohasseb

In this paper, we present a general formula for the capacity region of a general interference channel with two pairs of users. The formula shows that the capacity region is the union of a family of rectangles, where each rectangle is…

Information Theory · Computer Science 2013-10-08 Xiao Ma , Lei Lin , Chulong Liang , Xiujie Huang , Baoming Bai

Millimeter-wave (mmWave) spectrum is expected to support data-intensive applications that require ultra-reliable low-latency communications (URLLC). However, mmWave links are highly sensitive to blockage, which may lead to disruptions in…

Information Theory · Computer Science 2024-02-13 Mine Gokce Dogan , Jaimin Shah , Martina Cardone , Christina Fragouli , Wei Mao , Hosein Nikopour , Rath Vannithamby

This paper investigates the capacity regions of two-receiver broadcast channels where each receiver (i) has both common and private-message requests, and (ii) knows part of the private message requested by the other receiver as side…

Information Theory · Computer Science 2016-11-18 Behzad Asadi , Lawrence Ong , Sarah J. Johnson

The linear shift deterministic Y-channel is studied. That is, we have three users and one relay, where each user wishes to broadcast one message to each other user via the relay, resulting in a multi-way relaying setup. The cut-set bounds…

Information Theory · Computer Science 2015-03-19 Anas Chaaban , Aydin Sezgin

In this work, we present a construction of a family of space-time block codes for a Multi-Access Amplify-and- Forward Relay channel with two users and a single half-duplex relay. It is assumed that there is no Channel Side Information at…

Information Theory · Computer Science 2008-04-10 Maya Badr , Jean-Claude Belfiore

Though network coding is traditionally performed over finite fields, recent work on nested-lattice-based network coding suggests that, by allowing network coding over certain finite rings, more efficient physical-layer network coding…

Information Theory · Computer Science 2016-11-15 Chen Feng , Roberto W. Nóbrega , Frank R. Kschischang , Danilo Silva

This paper considers the capacity gains due to unidirectional destination cooperation in cognitive radio channels. We propose a novel channel, interference channel with degraded message sets with unidirectional destination cooperation…

Information Theory · Computer Science 2010-08-06 Hsuan-Yi Chu

A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of…

Information Theory · Computer Science 2016-11-18 Jingge Zhu , Michael Gastpar

A general inner bound is given for the discrete memoryless broadcast channel with an arbitrary number of users and general message sets, a setting that accounts for the most general form of concurrent groupcasting, with messages intended…

Information Theory · Computer Science 2020-11-11 Henry Romero , Mahesh K. Varanasi

A partially cooperative relay broadcast channel (RBC) is a three-node network with one source node and two destination nodes (destinations 1 and 2) where destination 1 can act as a relay to assist destination 2. Inner and outer bounds on…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , Gerhard Kramer

A multiple input multiple output (MIMO) two-way relay channel is considered, where two sources want to exchange messages with each other using multiple relay nodes, and both the sources and relay nodes are equipped with multiple antennas.…

Information Theory · Computer Science 2008-04-07 Rahul Vaze , Robert W. Heath

In 2010, Silva, Kschischang and K\"otter studied certain classes of finite field matrix channels in order to model random linear network coding where exactly $t$ random errors are introduced. In this paper we consider a generalisation of…

Information Theory · Computer Science 2018-02-01 Simon R. Blackburn , Jessica Claridge

We analyze physical-layer security based on the premise that the coding mechanism for secrecy over noisy channels is tied to the notion of channel resolvability. Instead of considering capacity-based constructions, which associate to each…

Information Theory · Computer Science 2013-09-09 Matthieu R. Bloch , J. Nicholas Laneman