Concept

Canal binaire symétrique

Publications associées (176)

Polarization of the Renyi Information Dimension With Applications to Compressed Sensing

In this paper, we show that the Hadamard matrix acts as an extractor over the reals of the Renyi Information Dimension (RID), in an analogous way to how it acts as an extractor of the discrete entropy over finite fields. More precisely, we prove that the R ...

Ieee-Inst Electrical Electronics Engineers Inc2017

A Characterization of the Shannon Ordering of Communication Channels

Rajai Nasser

The ordering of communication channels was first introduced by Shannon. In this paper, we aim to find a characterization of the Shannon ordering. We show that W' contains W if and only if W is the skew-composition of W' with a convex-product channel. This ...

2017

On the Input-Degradedness and Input-Equivalence Between Channels

Rajai Nasser

A channel W is said to be input-degraded from another channel W' if W can be simulated from W' by randomization at the input. We provide a necessary and sufficient condition for a channel to be input-degraded from another one. We show that any decoder that ...

2017

An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

This paper presents exact capacity characterizations for the case, when a principal, Alice, wants to securely send a message to another principal, Bob, over three network configurations: the parallel edges network, the V-network, and the triangle network. ...

Ieee-Inst Electrical Electronics Engineers Inc2016

The Bethe Free Energy Allows to Compute the Conditional Entropy of Graphical Code Instances: A Proof From the Polymer Expansion

Nicolas Macris, Marc Vuffray

The main objective of this paper is to explore the precise relationship between the Bethe free energy (or entropy) and the Shannon conditional entropy of graphical error correcting codes. The main result shows that the Bethe free energy associated with a l ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Bit-flipping LDPC under noise conditions and its application to Physically Unclonable Functions

Alexandre Schmid, Takao Marukame

A low-density parity check (LDPC) circuit and its properties as a post-processor is proposed for physically unclonable functions (PUFs) applications. PUFs can be realized using process variations or signal noises in SRAM or other PUF circuits, whereas the ...

Ieee2016

Analysis of Spatially Coupled Systems using the Potential Functional with Applications to Coding Theory

Rafah El-Khatib

For the past 70 years or so, coding theorists have been aiming at designing transmission schemes with efficient encoding and decoding algorithms that achieve the capacity of various noisy channels. It was not until the '90s that graph-based codes, such as ...

EPFL2016

Hardware Decoders for Polar Codes: An Overview

Andreas Peter Burg, Pascal Giard

Polar codes are an exciting new class of error correcting codes that achieve the symmetric capacity of memoryless channels. Many decoding algorithms were developed and implemented, addressing various application requirements: from error-correction performa ...

Ieee2016

Experiment and Investigation of Two Types of Vibrotactile Devices

Christian Enz, Huaiqi Huang, Tao Li, Jörn Justiz

Tactile displays have a wide range of applications in assistive technology, prosthetics, and rehabilitation. Vibrotactile stimulation shows potential to be integrated into wearable devices because of its small size, low power consumption, and relative fast ...

Ieee2016

Spatial Coupling as a Proof Technique and Three Applications

Rüdiger Urbanke, Nicolas Macris, Andrei Giurgiu

The aim of this paper is to show that spatial coupling can be viewed not only as a means to build better graphical models, but also as a tool to better understand uncoupled models. The starting point is the observation that some asymptotic properties of gr ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search