Concept

Code préfixe

Publications associées (160)

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

Leakage-resilient non-malleable codes

Divesh Aggarwal

A recent trend in cryptography is to construct cryptosystems that are secure against physical attacks. Such attacks are usually divided into two classes: the \emph{leakage} attacks in which the adversary obtains some information about the internal state of ...

Springer2015

Non-malleable Reductions and Applications

Divesh Aggarwal

Non-malleable codes, introduced by Dziembowski, Pietrzak and Wichs [DPW10], provide a useful message integrity guarantee in situations where traditional error-correction (and even error-detection) is impossible; for example, when the attacker can completel ...

ACM2015

Numerical modelling of gravel unconstrained flow experiments with the DAN(3D) and RASH(3D) codes

Vincent Labiouse, Claire Sauthier

Landslide continuum dynamic models have improved considerably in the last years, but a consensus on the best method of calibrating the input resistance parameter values for predictive analyses has not yet emerged. In the present paper, numerical simulation ...

Pergamon-Elsevier Science Ltd2015

Polar Codes for Broadcast Channels

Michael Christoph Gastpar, Emmanuel Abbé, Naveen Goela

Polar codes are introduced for discrete memoryless broadcast channels. For m-user deterministic broadcast channels, polarization is applied to map uniformly random message bits from m-independent messages to one codeword while satisfying broadcast constrai ...

Institute of Electrical and Electronics Engineers2015

Re-proving Channel Polarization Theorems

Mine Alsan

The general subject considered in this thesis is a recently discovered coding technique, polar coding, which is used to construct a class of error correction codes with unique properties. In his ground-breaking work, Arikan proved that this class of codes, ...

EPFL2015

Sparse Probabilistic Models

Andrei Giurgiu

This thesis is concerned with a number of novel uses of spatial coupling, applied to a class of probabilistic graphical models. These models include error correcting codes, random constraint satisfaction problems (CSPs) and statistical physics models calle ...

EPFL2015

Code and its image: the functions of text and visualisation in a code-based design studio

Jeffrey Huang, Mark Meagher, Guillaume Labelle, Nathaniel Zuelzke, Trevor Patt

Traditionally, design learning in the architecture studio has taken place through a combination of individual work and joint projects. The introduction of code-based design practices in the design studio has altered this balance, introducing new models of ...

Routledge Journals, Taylor & Francis Ltd2015

, , , , ,

The continuing demand for higher bandwidth in serial interconnects has pushed the symbol rate of differential lanes into the high-insertion-loss region of channels. Multi-level signaling such as differential PAM-4 [1] has been used to mitigate the loss of ...

2014

Linear Programming Decoding of Spatially Coupled Codes

Rüdiger Urbanke, Badih Ghazi

For a given family of spatially coupled codes, we prove that the linear programming (LP) threshold on the binary-symmetric channel (BSC) of the tail-biting graph cover ensemble is the same as the LP threshold on the BSC of the derived spatially coupled ens ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Successive Refinement of Gaussian Projections

Michael Christoph Gastpar, Guillaume Jean Op 't Veld

Successive refinement is a technique to encode a source iteratively, improving the distortion at each step. If the code rates of all steps combined can be as efficient as coding only for the final distortion in one go, then the source is said to be success ...

2014