Work

A decoding algorithm for binary linear codes using Groebner bases

Year: 2018

Type: preprint

Abstract: It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear codes by utilizing the Groebner bases of the associated ideals.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1810.04536

Authors: Andriatahiny, Harinaivo, Randriamiarampanahy, Jean Jacques Ferdinand, Rabeherimanana, Toussaint Joseph

Institution: University of Antananarivo

Language: English

Topic: Coding theory and cryptography

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2898079189

Cites: 3

Cited by:

Related to: 10