Publication

Sum-Rate Capacity for Symmetric Gaussian Multiple Access Channels with Feedback

Related publications (10)

Tiers of joy? Reserve tiering and bank behavior in a negative-rate environment

Andreas Fuster

Negative interest rate regimes typically involve reserve tiering to exempt a portion of bank reserves from negative rates. We study the effects on bank behavior of a large and unanticipated change in reserve tiering by the Swiss National Bank that generate ...
2024

A Functional Perspective on Information Measures

Amedeo Roberto Esposito

Since the birth of Information Theory, researchers have defined and exploited various information measures, as well as endowed them with operational meanings. Some were born as a "solution to a problem", like Shannon's Entropy and Mutual Information. Other ...
EPFL2022

Sum-Rate Capacity for Symmetric Gaussian Multiple Access Channels With Feedback

Michael Christoph Gastpar, Erixhen Sula

The feedback sum-rate capacity is established for the symmetric JJ -user Gaussian multiple-access channel (GMAC). The main contribution is a converse bound that combines the dependence-balance argument of Hekstra and Willems (1989) with a variant of the f ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...
ASSOC COMPUTING MACHINERY2020

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...
ASSOC COMPUTING MACHINERY2018

Renormalized solutions to the continuity equation with an integrable damping term

Maria Colombo

We consider the continuity equation with a nonsmooth vector field and a damping term. In their fundamental paper, DiPerna and Lions (Invent Math 98:511-547, 1989) proved that, when the damping term is bounded in space and time, the equation is well posed i ...
2015

List-Decoding for the Arbitrarily Varying Channel Under State Constraints

Michael Christoph Gastpar

List-decoding for arbitrarily varying channels (AVCs) under state constraints is investigated. It is shown that rates within of the randomized coding capacity of AVCs with input-dependent state can be achieved under maximal error with list-decoding using l ...
2012

Linear Universal Decoder for Compound Discrete Memoryless Channels

Rethnakaran Pulikkoonattu

Shannon in his seminal work \cite{paper:shannon} formalized the framework on the problem of digital communication of information and storage. He quantified the fundamental limits of compression and transmission rates. The quantity \textit{channel capacity} ...
2009

Global continuation for ODE systems over the half-line and study of von Kármán's swirling flow problem

Gilles Evéquoz

This work is concerned with the global continuation for solutions (λ,u,ξ) ∈ R × C1{0}([0,∞), RN) × Rk of the following system of ordinary differential equations: where F: [0,∞) × RN × U × J → RN and φ: U × J → X1, for some open sets J ⊂ R and U ⊂ Rk, and w ...
EPFL2007

Potential of chaos communication over noisy channels - Channel coding using chaotic piecewise linear maps

Martin Hasler, Thomas Schimming

The paper gives an information theoretic analysis of the potential of chaos in digital communication schemes, underlining that there is no fundamental principle that speaks against the use of chaotic systems in digital communications. The channel model con ...
2002

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.