[ Implémentation en Java du système de codage d’informations basé sur le code de Hamming (7,4) ]
Volume 28, Issue 2, January 2020, Pages 478–486
KABEYA TSHISEBA Cedric1
1 Département de Mathématique et Informatique, Faculté de Sciences, Université Pédagogique Nationale (UPN), Ngaliema, Kinshasa, RD Congo
Original language: French
Copyright © 2020 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
The idea of linear coding is simple: by an injective linear application we send a space of binary words in a larger space, hoping that the redundancy introduced helps us to detect and correct the transmission errors. Among the so-called linear codes, we consider in the context of this article the Hamming code which is a perfect code, because for a given code length there is no other more compact code having the same capacity correction. In this sense its yield is maximum. In this work, we have proposed an algorithm based on the above characteristics of the Hamming code, which we can implement in a given programming language.
Author Keywords: Error correcting codes, linear codes, cyclic codes, Hamming codes, Hamming weight, Hamming distance.
Volume 28, Issue 2, January 2020, Pages 478–486
KABEYA TSHISEBA Cedric1
1 Département de Mathématique et Informatique, Faculté de Sciences, Université Pédagogique Nationale (UPN), Ngaliema, Kinshasa, RD Congo
Original language: French
Copyright © 2020 ISSR Journals. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract
The idea of linear coding is simple: by an injective linear application we send a space of binary words in a larger space, hoping that the redundancy introduced helps us to detect and correct the transmission errors. Among the so-called linear codes, we consider in the context of this article the Hamming code which is a perfect code, because for a given code length there is no other more compact code having the same capacity correction. In this sense its yield is maximum. In this work, we have proposed an algorithm based on the above characteristics of the Hamming code, which we can implement in a given programming language.
Author Keywords: Error correcting codes, linear codes, cyclic codes, Hamming codes, Hamming weight, Hamming distance.
Abstract: (french)
L’idée du codage linéaire est simple: par une application linéaire injective on envoie un espace de mots binaires dans un espace plus grand, en espérant que la redondance introduite nous aide à détecter et corriger les erreurs de transmission. Parmi les codes dits linéaires, nous considérons dans le cadre de cet article le code de Hamming qui en soit est un code parfait, du fait que pour une longueur de code donnée, il n'existe pas d'autre code plus compact ayant la même capacité de correction. En ce sens, son rendement est dit maximal. Dans ce travail, nous avons su proposer un algorithme basé sur les caractéristiques ci-dessus du code de Hamming, que nous avons ensuite bien pu implémenter ici en Java.
Author Keywords: Codes correcteurs d'erreurs, codes linéaires, codes cycliques, codes de Hamming, poids de Hamming, distance de Hamming.
How to Cite this Article
KABEYA TSHISEBA Cedric, “Java Implementation of Information Coding System Based on Hamming Code (7.4),” International Journal of Innovation and Applied Studies, vol. 28, no. 2, pp. 478–486, January 2020.
