Use of Grobner bases to decode binary cyclic codes up to the true minimum distance

1994 ◽  
Vol 40 (5) ◽  
pp. 1654-1661 ◽  
Author(s):  
Xuemin Chen ◽  
I.S. Reed ◽  
T. Helleseth ◽  
T.K. Truong
Keyword(s):  
Minimum Distance ◽  
Cyclic Codes ◽  
Gröbner Bases ◽  
Grobner Bases

scholarly journals Gröbner Bases and Minimum Distance of Affine Varieties Codes

2012 ◽  
Vol 13 (3) ◽  
pp. 257-263
Author(s):  
Cícero Carvalho
Keyword(s):  
Minimum Distance ◽  
Gröbner Bases ◽  
Grobner Bases

Nesse trabalho apresentamos um método para estimar a distância mínima de códigos de variedades afins. Nossa técnica usa propriedades da pegada de um ideal obtido através do aumento do ideal de definição da variedade em questão. Ela também pode ser aplicada a códigos de que não são produzidos utilizando-se domínios-pesos, e o trabalho contém um exemplo desse caso.

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.

Sign in / Sign up

Export Citation Format

Share Document