Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Recherche

Afficher tous les résultats pour

Accueil

Unité

Laboratoire de mécanique statistique de l'inférence pour grands systèmes

Groupe

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (32)

Page 2 sur 2

Universal Sparse Superposition Codes With Spatial Coupling and GAMP Decoding

Nicolas Macris, Jean François Emmanuel Barbier, Mohamad Baker Dia

Sparse superposition codes, or sparse regression codes, constitute a new class of codes, which was first introduced for communication over the additive white Gaussian noise (AWGN) channel. It has been shown that such codes are capacity-achieving over the A ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

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

Improved decoding of second-order Reed-Muller codes

Rüdiger Urbanke, Kirill Ivanov

In this paper, we consider low-complexity decoding of second-order Reed-Muller codes. A class of polynomial-time algorithms, based on the projections onto first-order codes, is studied. An old representative of this class, originally developed for binary s ...

IEEE2019

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

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

Statistical Physics Methods for Community Detection

Chun Lam Chan

This thesis is devoted to information-theoretic aspects of community detection. The importance of community detection is due to the massive amount of scientific data today that describes relationships between items from a network, e.g., a social network. I ...

EPFL2019

Gaussian channel transmission of images and audio files using cryptcoding

Random codes based on quasigroups (RCBQ) are cryptcodes, i.e. they are error-correcting codes, which provide information security. Cut-Decoding and 4-Sets-Cut-Decoding algorithms for these codes are defined elsewhere. Also, the performance of these codes f ...

2019

New Results On The Pseudoredundancy

Jens Markus Zumbrägel

The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding ...

2019

Deep Unfolding for Communications Systems: A Survey and Some New Directions

Alexios Konstantinos Balatsoukas Stimming, Christoph Studer

Deep unfolding is a method of growing popularity that fuses iterative optimization algorithms with tools from neural networks to efficiently solve a range of tasks in machine learning, signal and image processing, and communication systems. This survey sum ...

IEEE2019

Entropy and mutual information in models of deep neural networks

Nicolas Macris, Florent Gérard Krzakala, Lenka Zdeborová, Jean François Emmanuel Barbier, Clément Dominique Luneau

We examine a class of stochastic deep learning models with a tractable method to compute information-theoretic quantities. Our contributions are three-fold: (i) we show how entropies and mutual informations can be derived from heuristic statistical physics ...

2019

High-Dimensional Inference on Dense Graphs with Applications to Coding Theory and Machine Learning

Mohamad Baker Dia

We are living in the era of "Big Data", an era characterized by a voluminous amount of available data. Such amount is mainly due to the continuing advances in the computational capabilities for capturing, storing, transmitting and processing data. However, ...

EPFL2018

The Velocity of the Propagating Wave for Spatially Coupled Systems With Applications to LDPC Codes

Nicolas Macris, Rafah El-Khatib

We consider the dynamics of message passing for spatially coupled codes and, in particular, the set of density evolution equations that tracks the profile of decoding errors along the spatial direction of coupling. It is known that, for suitable boundary c ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018