Concept

Random permutation

Related publications (9)

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

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

Geomedicine: opportunities of using spatial information to move toward more precision in public health - spatial approaches and clusters: an introduction for clinicians

Stéphane Joost, Idris Guessous

In this presentation we introduce basic knowledge about the use of located health data to detect clusters of disease prevalence. Most often, geographic maps are produced to represent health data. Medical information is transmitted through thematic chorop ...

2017

Limits on Sparse Support Recovery via Linear Sketching with Random Expander Matrices

Volkan Cevher, Jonathan Mark Scarlett

Linear sketching is a powerful tool for the problem of sparse signal recovery, having numerous applications such as compressive sensing, data stream computing, graph sketching, and routing. Motivated by applications where the \emph{positions} of the non-ze ...

2016

A common theory for phase-modulated homonuclear decoupling in solid-state NMR

David Lyndon Emsley

We propose a new framework for homonuclear dipolar decoupling in solid-state NMR that provides a theoretical link between the FSLG, PMLG and DUMBO families. We show that through the use of a Legendre polynomial basis, the phase modulation of these decoupli ...

ROYAL SOC CHEMISTRY2012

Estimation of the depth of anaesthesia from interacting physiological oscillators

Kumiko Oshima

Nowadays, physiological monitoring is imperative for the safety of medical operations. However, systems which monitor the depth of anaesthesia are still far from reliable, such that still some patients may experience the trauma of remaining conscious under ...

EPFL2008

Chaum's Designated Confirmer Signature Revisited

Serge Vaudenay, Jean Monnerat

This article revisits the original designated confirmer signature scheme of Chaum. Following the same spirit we naturally extend the Chaum's construction in a more general setting and analyze its security in a formal way. We prove its security in the rando ...

2005

A Statistical Attack on RC6

Serge Vaudenay

This paper details the attack on RC6 which was announced in a report published in the proceedings of the second AES candidate conference (March 1999). Based on an observation on the RC6 statistics, we show how to distinguish RC6 from a random permutation a ...

2001

On the Lai-Massey scheme

Serge Vaudenay

Constructing a block cipher requires us to define a random permutation, which is usually performed by the Feistel scheme and its variants. In this paper we investigate the Lai-Massey scheme which was used in IDEA. We show that we cannot use it Âas isÂ in ...

1999

On extremal behaviors of Murty's least index method

In this small note, we observe some extremal behaviors of Murty's least index method for solving linear complementarity problems. In particular, we show that the expected number of steps for solving Murty's exponential example with a random permutation of ...

1994

Graph Chatbot

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.