Publications associées à Gaussian multiple-access channels under received-power constraints

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Second-Order Rate Region of Constant-Composition Codes for the Multiple-Access Channel

Jonathan Mark Scarlett, Albert Guillén i Fàbregas

This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple-access channel (MAC) with a fixed target error probability. Using constant-composition random coding, coded time-sharing, and a variant of Hoeffding's comb ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Gaussian (dirty) multiple access channels: a compute-and-forward perspective

Michael Christoph Gastpar, Jingge Zhu

Lattice codes are applied to the two-user Gaussian multiple access channel (MAC) combined with a modified compute-and-forward transmitting scheme. It is shown that non-corner points on the boundary of the capacity region can be achieved by decoding two int ...

IEEE2014

Physical-layer Network Coding on the Random-access Channel

Michael Christoph Gastpar, Jasper Goseling

We consider a physical-layer network coding strat- egy for the random-access channel, based on compute-and- forward. When packets collide, it is possible to reliably recover a linear combination of the packets at the receiver. Over many rounds of transmiss ...

2013

Exploiting Common Randomness: a Resource for Network Secrecy

Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate l ...

2013

Exploiting Common Randomness: a Resource for Network Secrecy

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

Ieee2013

Simple schedules for half-duplex networks

Christina Fragouli, Siddhartha Brahma

We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays. Deriving a simple approximation to the capacity of the network, we show that simple schedules having exactly two states and avoid ...

Ieee2012

Simple Relaying Strategies for Half-duplex Networks

Christina Fragouli, Ayfer Özgür Aydin, Siddhartha Brahma

We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays. Using simple outer bounds on the capacity of the network, we show that simple relaying strategies having exactly two states and a ...

2012

Polar coding schemes for the AWGN channel

Emmanuel Abbé

This paper investigates polar coding schemes achieving capacity for the AWGN channel. The approaches using a multiple access channel with a large number of binary-input users and a single-user channel with a large prime-cardinality input are compared with ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Polar coding: a brief tour

Emre Telatar

Arikan's 'polar coding' is a technique to achieve the symmetric capacity of binary input memoryless channels. In this talk I will attempt to describe this technique, and briefly discuss its extensions to q-ary input channels, multiple access channels and r ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Gaussian multiple-access channels under received-power constraints

Graph Chatbot

Chattez avec Graph Search

Second-Order Rate Region of Constant-Composition Codes for the Multiple-Access Channel

Gaussian (dirty) multiple access channels: a compute-and-forward perspective

Physical-layer Network Coding on the Random-access Channel

Exploiting Common Randomness: a Resource for Network Secrecy

Exploiting Common Randomness: a Resource for Network Secrecy

Simple schedules for half-duplex networks

Simple Relaying Strategies for Half-duplex Networks

Polar coding schemes for the AWGN channel

Polar Coding Theorems for Discrete Systems

Polar coding: a brief tour

Physical-layer Network Coding on the Random-access Channel

Polar Coding Theorems for Discrete Systems

Gaussian (dirty) multiple access channels: a compute-and-forward perspective

Second-Order Rate Region of Constant-Composition Codes for the Multiple-Access Channel

Polar coding: a brief tour

Simple schedules for half-duplex networks

Exploiting Common Randomness: a Resource for Network Secrecy

Polar coding schemes for the AWGN channel

Exploiting Common Randomness: a Resource for Network Secrecy

Simple Relaying Strategies for Half-duplex Networks