Gröbner Bases for Schubert Codes
Arunkumar R. Patil, Nitin Darkunde · arXiv (Cornell University) · 2017
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.