2017/07/07 by Arunkumar R. Patil, Patil, Arunkumar R., Nitin Darkunde +1
Computer Science · #Coding theory and cryptography #Cryptography and Residue Arithmetic #FOS: Computer and information sciences #Information Theory (cs.IT) #Polynomial and algebraic computation
paper · pdf · doi:10.48550/arxiv.1707.02199
openalex publication_date 2017/07/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.