A decoding algorithm for binary linear codes using Groebner bases
Information Theory
2018-10-11 v1 math.IT
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.
Cite
@article{arxiv.1810.04536,
title = {A decoding algorithm for binary linear codes using Groebner bases},
author = {Harinaivo Andriatahiny and Jean Jacques Ferdinand Randriamiarampanahy and Toussaint Joseph Rabeherimanana},
journal= {arXiv preprint arXiv:1810.04536},
year = {2018}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1808.09616