ScholarLens Back to search
2020•International journal of innovation and applied studiesRequires access

Java Implementation of Information Coding System Based on Hamming Code (7.4)

Kabeya Tshiseba Cedric

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Constant-weight code, Systematic code, Hamming code, Hamming bound, Computer science, Polynomial code, Prefix code, Variable-length code

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Java Implementation of Information Coding System Based on Hamming Code (7.4) — Research Paper | ScholarLens