Description
A Fountain code is a code of fixed dimension and a limitless block-length. This is a new class of codes with very interesting applications. In this talk I will show how Fountain codes can be applied to the problem of reliable, robust, and speedy transmission of data over a heterogeneous network from one or multiple transmitters to one or multiple receivers. I will then talk about applications to the design of reliable end-to-end data transmission systems in unreliable unicast, multicast, or even peer-to-peer networks. In the last part of the talk I will introduce two classes of probabilistic Fountain codes that are used in commercial systems today. These codes, called LT- and Raptor codes, have very efficient encoding and decoding algorithms. I will introduce the mathematical theory of these codes and give some insights into their design.
Prochains exposés
-
CryptoVerif: a computationally-sound security protocol verifier
Orateur : Bruno Blanchet - Inria
CryptoVerif is a security protocol verifier sound in the computational model of cryptography. It produces proofs by sequences of games, like those done manually by cryptographers. It has an automatic proof strategy and can also be guided by the user. It provides a generic method for specifying security assumptions on many cryptographic primitives, and can prove secrecy, authentication, and[…]-
Cryptography
-