

























We consider the problem of determining Gröbner bases of binomial ideals associated with linear error correcting codes. Computation of Gröbner bases of linear codes have become a topic of interest to many researchers in coding theory because of its several applications in decoding and error corrections. In this paper, Gröbner bases of linear codes associated to Grassmann varieties and Schubert varieties over a binary field have been obtained. We also use them to study the decoding of binary Schubert codes.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。