Publications related to Wave-Like Solutions of General 1-D Spatially Coupled Systems

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

EPFL2024

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

J

-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

LDPC Coded Multiuser Shaping for the Gaussian Multiple Access Channel

Alexios Konstantinos Balatsoukas Stimming

The joint design of input constellation and low-density parity-check (LDPC) codes to approach the symmetric capacity of the two-user Gaussian multiple access channel is studied. More specifically, multilevel coding is employed at each user to construct a h ...

IEEE2019

From LDPC Block to LDPC Convolutional Codes: Capacity, Stability, and Universality

Wei Liu

In his landmark paper "A Mathematical Theory of Communication," the founding father of information theory and coding theory, Claude E. Shannon, established the largest rate at which reliable communication is possible and he revealed that the key to this re ...

EPFL2019

Compute–Forward Multiple Access (CFMA): Practical Implementations

Michael Christoph Gastpar, Sung Hoon Lim, Jingge Zhu, Erixhen Sula, Adriano Pastore

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

2019

Displacement Convexity in Spatially Coupled Scalar Recursions

Rüdiger Urbanke, Nicolas Macris, Rafah El-Khatib

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

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel

Rüdiger Urbanke, Kirill Ivanov

In this paper, we consider the problem of decoding Reed-Muller (RM) codes in binary erasure channel. We propose a novel algorithm, which exploits several techniques, such as list recursive (successive cancellation) decoding based on Plotkin decomposition, ...

IEEE2019

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

Rüdiger Urbanke, Seyed Hamed Hassani, Shrinivas Kudekar, Yury Polyanskiy

Consider a binary linear code of length N, minimum distance d(min), transmission over the binary erasure channel with parameter 0 < epsilon < 1 or the binary symmetric channel with parameter 0 < epsilon < 1/2, and block-MAP decoding. It was shown by Tillic ...

IEEE2018

Decoder Partitioning: Towards Practical List Decoding of Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Polar codes represent one of the major recent breakthroughs in coding theory and, because of their attractive features, they have been selected for the incoming SG standard. As such, a lot of attention has been devoted to the development of decoding algori ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018

Coding for Communications and Secrecy

Mani Bastaniparizi

Shannon, in his landmark 1948 paper, developed a framework for characterizing the fundamental limits of information transmission. Among other results, he showed that reliable communication over a channel is possible at any rate below its capacity. In 2008, ...

EPFL2017

Wave-Like Solutions of General 1-D Spatially Coupled Systems

Graph Chatbot

Chat with Graph Search

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

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

LDPC Coded Multiuser Shaping for the Gaussian Multiple Access Channel

From LDPC Block to LDPC Convolutional Codes: Capacity, Stability, and Universality

Compute–Forward Multiple Access (CFMA): Practical Implementations

Displacement Convexity in Spatially Coupled Scalar Recursions

Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

Decoder Partitioning: Towards Practical List Decoding of Polar Codes

Coding for Communications and Secrecy

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

Displacement Convexity in Spatially Coupled Scalar Recursions

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

LDPC Coded Multiuser Shaping for the Gaussian Multiple Access Channel

From LDPC Block to LDPC Convolutional Codes: Capacity, Stability, and Universality

Coding for Communications and Secrecy

Decoder Partitioning: Towards Practical List Decoding of Polar Codes

Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel

Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

Compute–Forward Multiple Access (CFMA): Practical Implementations