Grobner bases and alternant codes over Galois rings

2002 ◽  
Author(s):  
E. Byrne ◽  
P. Fitzpatrick
Keyword(s):  
Gröbner Bases ◽  
Grobner Bases ◽  
Galois Rings ◽  
Alternant Codes

APPLYING BUCHBERGER'S CRITERIA FOR COMPUTING GRÖBNER BASES OVER FINITE-CHAIN RINGS

2013 ◽  
Vol 12 (07) ◽  
pp. 1350034 ◽  
Author(s):  
AMIR HASHEMI ◽  
PARISA ALVANDI
Keyword(s):  
Cyclic Codes ◽  
Gröbner Bases ◽  
Special Kind ◽  
Grobner Bases ◽  
Discrete Mathematics ◽  
Galois Rings ◽  
Finite Chain ◽  
Chain Ring ◽  
Finite Chain Ring ◽  
Finite Chain Rings

Norton and Sălăgean [Strong Gröbner bases and cyclic codes over a finite-chain ring, in Proc. Workshop on Coding and Cryptography, Paris, Electronic Notes in Discrete Mathematics, Vol. 6 (Elsevier Science, 2001), pp. 391–401] have presented an algorithm for computing Gröbner bases over finite-chain rings. Byrne and Fitzpatrick [Gröbner bases over Galois rings with an application to decoding alternant codes, J. Symbolic Comput.31 (2001) 565–584] have simultaneously proposed a similar algorithm for computing Gröbner bases over Galois rings (a special kind of finite-chain rings). However, they have not incorporated Buchberger's criteria into their algorithms to avoid unnecessary reductions. In this paper, we propose the adapted version of these criteria for polynomials over finite-chain rings and we show how to apply them on Norton–Sălăgean algorithm. The described algorithm has been implemented in Maple and experimented with a number of examples for the Galois rings.

scholarly journals Gröbner bases for operads

2010 ◽  
Vol 153 (2) ◽  
pp. 363-396 ◽  
Author(s):  
Vladimir Dotsenko ◽  
Anton Khoroshkin
Keyword(s):  
Gröbner Bases ◽  
Grobner Bases

scholarly journals Gröbner bases over fields with valuations

2018 ◽  
Vol 88 (315) ◽  
pp. 467-483 ◽  
Author(s):  
Andrew J. Chan ◽  
Diane Maclagan
Keyword(s):  
Gröbner Bases ◽  
Grobner Bases
Sign in / Sign up

Export Citation Format

Share Document