Achievable Flows on Orthogonal Information Networks
Related publications (88)
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.
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 ...
In this paper, we analyze Orthogonal Frequency-Division Multiple Access and Single-Carrier Frequency Division Multiple Access as alternative physical layer schemes for the up-link of a satellite network. Both orthogonal frequency-division multiple access a ...
We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot ...
Institute of Electrical and Electronics Engineers Inc.2013
Recent advances in data processing and communication systems have led to a continuous increase in the amount of data communicated over today’s networks. These large volumes of data pose new challenges on the current networking infrastructure that only offe ...
The demand for higher throughput and better efficiency are two important challenges for future communication networks. During the past decades, a lot of research studies have been devoted to investigating and proposing near optimal and efficient schemes an ...
Finding theoretical limits on the performance of communication systems and designing schemes to achieve them is one of the fundamental questions in information theory. While the theory of point-to-point communication is well-investigated, most problems hav ...
The classical problem in network coding theory considers communication over multicast networks. Multiple transmitters send independent messages to multiple receivers which decode the same set of messages. In this work, computation over multicast networks i ...
This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for comput- ing functions, that r ...
To increase spectrum efficiency, researchers envi- sion a device-to-device (D2D) communication system in which a closely located mobile device pair may share the same spectrum with a cellular user. By opportunistically choosing the frequency, the D2D pair ...
Determining the capacity of multi-receiver networks with arbitrary message demands is an open problem in the network coding literature. In this paper, we consider a multi-source, multi-receiver symmetric deterministic network model parameterized by channel ...