The Interference-Multiple-Access Channel

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.

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 ...

The beginning of 21st century provided us with many answers about how to reach the channel capacity. Polarization and spatial coupling are two techniques for achieving the capacity of binary memoryless symmetric channels under low-complexity decoding algor ...

Previous works on age of information and erasure channels have dealt with specific models and computed the average age or average peak age for certain settings. In this paper, given a source that produces a letter every T-s seconds and an erasure channel t ...

Network information theory studies the communication of information in a network and considers its fundamental limits. Motivating from the extensive presence of the networks in the daily life, the thesis studies the fundamental limits of particular network ...

Over-the-air computation (AirComp) is a disruptive technique for fast wireless data aggregation in Internet of Things (IoT) networks via exploiting the waveform superposition property of multiple-access channels. However, the performance of AirComp is bott ...

In the Shannon lecture at the 2019 International Symposium on Information Theory (ISIT), Arikan proposed to employ a one-to-one convolutional transform as a pre-coding step before the polar transform. The resulting codes of this concatenation are called po ...

Sampling is classically performed by recording the amplitude of the input at given time instants; however, sampling and reconstructing a signal using multiple devices in parallel becomes a more difficult problem to solve when the devices have an unknown sh ...

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 ...

We propose a new class of efficient decoding algorithms for Reed-Muller (RM) codes over binary-input memoryless channels. The algorithms are based on projecting the code on its cosets, recursively decoding the projected codes (which are lower-order RM code ...

In this letter, we present a multi-channel in-plane-gate field effect transistor (MC-IPGFET). In the proposed device, multiple vertically stacked two-dimensional electron gases (2DEGs) are simultaneously controlled by lateral in-plane gates formed with the ...

We experimentally demonstrate Kramers-Kronig detection of four 20 Gbaud 16-quadrature-amplitude-modulated (QAM) channels after 50 km fiber transmission using two soliton Kerr combs as signal sources and local oscillators. The estimated carrier phase at the ...

An important class of modern channel codes is the capacity-achieving sequences of low-density parity-check block codes. Such sequences are usually designed for the binary erasure channel and are decoded by iterative message-passing algorithms. In this pape ...

We present a practical strategy that aims to attain rate points on the dominant face of the multiple access channel capacity using a standard low complexity decoder. This technique is built upon recent theoretical developments of Zhu and Gastpar on compute ...

In this paper we study a multi-channel network, each station of which is equipped with a network interface that has a receiver buffer of multiple packets. In this way, each station is able to receive multiple packets per time instant. We adopt a synchronou ...

We experimentally demonstrate KK detection of four 20-Gbaud 16-QAM channels after 50-km transmission using two soliton Kerr combs at transmitter and receiver. The frequency comb coherence enables a shared phase noise estimation among multiple channels. (C) ...

In any communication system, there exist two dimensions through which the information at the source becomes distorted before reaching the destination: the noisy channel and time. Messages transmitted through a noisy channel are susceptible to modification ...

Reed-Muller (RM) codes were introduced in 1954 and have long been conjectured to achieve Shannon's capacity on symmetric channels. The activity on this conjecture has recently been revived with the emergence of polar codes. RM codes and polar codes are gen ...

Given a source that produces a letter every T-s seconds and an erasure channel that can be used every T-c seconds, we ask what is the coding strategy that minimizes the time-average "age of information" that an observer of the channel output incurs. We wil ...

Computation codes in network information theory are designed for scenarios where the decoder is not interested in recovering the information sources themselves, but only a function thereof. Körner and Marton showed for distributed source coding (DSC) that ...

We introduce a technique for the analysis of general spatially coupled systems that are governed by scalar recursions. Such systems can be expressed in variational form in terms of a potential function. We show, under mild conditions, that the potential fu ...

The Interference-Multiple-Access Channel

Chat with Graph Search

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

Symmetry in design and decoding of polar-like codes

Optima Age Over Erasure Channels

Feedback and Common Information: Bounds and Capacity for Gaussian Networks

Over-the-Air Computation via Reconfigurable Intelligent Surface

Polarization-Adjusted Convolutional (PAC) Codes: Sequential Decoding vs List Decoding

Sampling and Reconstruction of Bandlimited Signals with Multi-Channel Time Encoding

Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations

Recursive Projection-Aggregation Decoding of Reed-Muller Codes

Multi-Channel AlGaN/GaN In-Plane-Gate Field-Effect Transistors

Kramers Kronig detection of four 20 Gbaud 16-QAM channels using Kerr combs for a shared phase estimation

On the Universality of Low-Density Parity-Check Block Codes

Compute–Forward Multiple Access (CFMA): Practical Implementations

Destination buffer analysis for packets rejection obliteration in multi-channel networks

Demonstration of Kramers-Kronig Detection of Four 20-Gbaud 16-QAM Channels after 50-km Transmission Using Kerr Combs to Perform Shared Phase Estimation

Bits through Time

Reed-Muller codes polarize

Optimal Age over Erasure Channels

Communication Versus Computation: Duality for Multiple-Access Channels and Source Coding

Displacement Convexity in Spatially Coupled Scalar Recursions