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.
We examine routing over two classes of orthogonal information networks. The first is a relay network with orthogonal inputs. The nodes in this network do not broadcast, but communicate to the different nodes via independent inputs. There is multiple access interference at every node. The second network is the Gaussian broadcast network with no interference. The nodes in this network broadcast, but the signals from the different transmitter nodes do not interfere at any receiver node. Such models can be motivated by communication schemes which use non overlapping time/frequency slots and which selectively ignore the effect of interference. Inner bounds to the capacity region for both classes of networks are obtained using modified max-flow theorems.
Verónica del Carmen Estrada Galiñanes
Henry Markram, Felix Schürmann, Eilif Benjamin Muller, Werner Alfons Hilda Van Geit, Michael Reimann, Marwan Muhammad Ahmed Abdellah, Lida Kanari, Srikanth Ramaswamy, James Gonzalo King, Alexis Arnaudon, Ying Shi, András Ecker, Jean-Denis Georges Emile Courcol, Armando Romani, Pramod Shivaji Kumbhar, Michael Emiel Gevaert, Judit Planas Carbonell, Huanxiang Lu, Nadir Roman Guerrero, Cristina Colangelo, Juan Bautista Hernando Vieites, Mohameth François Sy, Cyrille Pierre Henri Favreau, Elvis Boci, Joni Henrikki Herttuainen, Genrich Ivaska, Vishal Sood, Anna-Kristin Kaufmann, Thomas Brice Delemontex, Fabien Petitjean, Julian Martin Budd, Mustafa Kerem Kurban, Alberto Antonietti, Davide Bella, Pranav Rai