Publication
Communication Versus Computation: Duality for Multiple-Access Channels and Source Coding
Publications associées (44)
On Speed and Advantage : Results in Information Velocity and Monitoring Problems
Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...
EPFL2024Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations
Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng
Algebraic network information theory is an emerging facet of network information theory, studying the achievable rates of random code ensembles that have algebraic structure, such as random linear codes. A distinguishing feature is that linear combinations ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020Polarization and Channel Ordering: Characterizations and Topological Structures
Information theory is the field in which we study the fundamental limitations of communication. Shannon proved in 1948 that there exists a maximum rate, called capacity, at which we can reliably communicate information through a given channel. However, Sha ...
EPFL2017Compute-forward multiple access (CFMA) with nested LDPC codes
Michael Christoph Gastpar, Sung Hoon Lim, Jingge Zhu, Erixhen Sula, Adriano Pastore
Inspired by the compute-and-forward scheme from Nazer and Gastpar, a novel multiple-access scheme introduced by Zhu and Gastpar makes use of nested lattice codes and sequential decoding of linear combinations of codewords to recover the individual messages ...
2017On the Duality between Multiple-Access Codes and Computation Codes
Michael Christoph Gastpar, Sung Hoon Lim, Jingge Zhu
For a two-user Gaussian multiple access channel, computation codes are designed for the scenarios where the decoder is not interested in decoding the two codewords, but only the sum of them. It has been observed that good computation codes should possess s ...
2017Approximate Decoding for Network Coded Inter-dependent Data
Pascal Frossard, Nikolaos Thomos, Hyung Gon Park
In this paper, we consider decoding of loss tolerant data encoded by network coding and transmitted over error-prone networks. Intermediate network nodes typically perform the random linear network coding in a Galois field and a Gaussian elimination is use ...
Elsevier Science Bv2016Low Complexity Scheduling and Coding for Wireless Networks
The advent of wireless communication technologies has created a paradigm shift in the accessibility of communication. With it has come an increased demand for throughput, a trend that is likely to increase further in the future. A key aspect of these chall ...
EPFL2015On Distributed Successive Refinement with Lossless Recovery
Michael Christoph Gastpar, Chien-Yi Wang
The problem of successive refinement in distributed source coding and in joint source-channel coding is considered. The emphasis is placed on the case where the sources have to be recovered losslessly in the second stage. In distributed source coding, it i ...
2014Rate allocation and optimized decoding in inter-session network coding
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 ...
EPFL2013Polar Codes for the Two-User Multiple-Access Channel
Arikan's polar coding method is extended to two-user multiple-access channels. It is shown that if the two users of the channel use Arikan's construction, the resulting channels will polarize to one of five possible extremals, on each of which uncoded tran ...
Institute of Electrical and Electronics Engineers2013