A decoding algorithm for binary linear codes using Groebner bases

被引：0

作者：

Randriamiarampanahy, Jean Jacques Ferdinand ^{[1
]}

Andriatahiny, Harinaivo ^{[1
]}

Rabeherimanana, Toussaint Joseph ^{[1
]}

机构：

[1] Univ Antananarivo, Dept Math & Comp Sci, Fac Sci & Technol, Antananarivo, Madagascar

来源：

INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE | 2019年 / 14卷 / 02期

关键词：

Linear code; Groebner basis; decoding;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：441 / 448

页数：8