# Canal-U

Mon compte

## 1.5. Error Correcting Capacity

Copier le code pour partager la vidéo :
<div style="position:relative;padding-bottom:56.25%;padding-top:10px;height:0;overflow:hidden;"><iframe src="https://www.canal-u.tv/video/inria/embed.1/1_5_error_correcting_capacity.32795?width=100%&amp;height=100%" style="position:absolute;top:0;left:0;width:100%;height: 100%;" width="550" height="306" frameborder="0" allowfullscreen scrolling="no"></iframe></div> Si vous souhaitez partager une séquence, indiquez le début de celle-ci , et copiez le code : h m s
Contacter la chaine
J’aime
Imprimer
partager

### 1.5. Error Correcting Capacity

This sequence will be about the error-correcting capacity of a linear code. We describe the way of considering the space Fq^n as a metric space. This metric is necessary to justify the principle of decoding that is returning the nearest codeword to the received vector. The metric principle is based on the following concept: the Hamming distance between two vectors is the number of coordinates in which they differ.
The Hamming weight of a vector is the number of non-zero coordinates. Here we give some examples.
So, the Hamming distance between these two vectors is 2, since they have two coordinates in which they differ.
The Hamming distance between these two strings is 1 because they just differ in one letter, and the Hamming weight of these vectors is 2 since it just has two elements which are non-zero. The Hamming distance is a metric on the vector space Fq^n. This means that these functions satisfy the usual properties of a distance, that is non-negativity, symmetry, the Hamming distance is invariable under permutation, and it verifies the triangle inequality. The proof of these properties is left as an exercise. A measure for the error-correcting capability of a linear code is the minimum distance, that is the least Hamming distance between two different codewords of a linear code. As we will see later, the higher the minimum distance, the more errors the code can correct. The reason is that the minimum distance determines the packing radius of a code, that is the largest integer s such that the balls of radius s centered at the codewords are all disjoint.

•
Label UNT : UNIT
•
Date de réalisation : 5 Mai 2015
Durée du programme : 9 min
Classification Dewey : Analyse numérique, Théorie de l'information, données dans les systèmes informatiques, cryptographie, Mathématiques
•
Catégorie : Vidéocours
Niveau : niveau Master (LMD), niveau Doctorat (LMD), Recherche
Disciplines : Mathématiques, Informatique, Informatique, Mathématiques et informatique
Collections : 1: Error-Correcting Codes and Cryptography
ficheLom : Voir la fiche LOM
•
Auteur(s) : MARQUEZ-CORBELLA Irene, SENDRIER Nicolas, FINIASZ Matthieu
•
Langue : Anglais
Mots-clés : algèbre linéaire, chiffrement à clé publique, cryptage des données, cryptographie
Conditions d’utilisation / Copyright : Ces ressources de cours sont, sauf mention contraire, diffusées sous Licence Creative Commons. L’utilisateur doit mentionner le nom de l’auteur, il peut exploiter l’œuvre sauf dans un contexte commercial et il ne peut apporter de modifications à l’œuvre originale.

## commentaires

Ajouter un commentaire Lire les commentaires
*Les champs suivis d’un astérisque sont obligatoires.
Aucun commentaire sur cette vidéo pour le moment (les commentaires font l’objet d’une modération)