Standard Bases for Linear Codes over Prime Fields
Information Theory
2017-08-21 v1 math.IT
Abstract
It is known that a linear code can be represented by a binomial ideal. In this paper, we give standard bases for the ideals in a localization of the multivariate polynomial ring in the case of linear codes over prime fields.
Keywords
Cite
@article{arxiv.1708.05490,
title = {Standard Bases for Linear Codes over Prime Fields},
author = {Jean Jacques Ferdinand Randriamiarampanahy and Harinaivo Andriatahiny and Toussaint Joseph Rabeherimanana},
journal= {arXiv preprint arXiv:1708.05490},
year = {2017}
}