Sakkour, Bassem (2007) Decoding of Reed-Muller codes and applications to cryptography. Thesis, ?? institution/ep ??.
Full text not available from this repository.
In this thesis, we study the Reed-Muller codes which constitute one of the classes of error correcting codes the most studied, and most used in numerical communications. Thanks to their speed of encoding and decoding, they were in particular used for the satellite transmissions. They also have a strong bond with the concepts of Boolean functions. The study of Boolean functions constitutes the heart of the realization and the safety of secret key cryptography. Since the introduction of these codes, many decoding algorithms were introduced, and even today the study of their structure! in order to build decoding algorithms constitutes an interested field of research in coding theory and in cryptography for finding good linear, quadratic etc approximations to Boolean functions used in cryptography We expose a unifying point of view to all known decoding algorithms of this codes, this point of view is that of the discrete derivative. We expose a powerful algorithm for the decoding of the codes of order two, which we analyze then. We discuss the results of simulations of the algorithms studied for the small and average lengths of code. Simulation results show that the proposed algorithm decodes in practice much further that the other algorithms.
|Item Type:||Thesis (Thesis)|
|Uncontrolled Keywords:||Maximum likelihood|
|Subjects:||Information and Communication Sciences and Technologies|
|Deposited By:||Laurence Vidament|
|Deposited On:||02 mai 2007 02:20|
|Dernière modification:||05 juin 2013 09:03|
Repository Staff Only: item control page