On a Gröbner bases structure associated to linear codes

References

• Azze-Bauta , Y. 2003 . Construction and Application of Gröbner Bases Techniques in Linear Coding Theory , Santiago de Cuba : Universidad de Oriente . (in Spanish), Diploma thesis, advisor: M. Borges-Quintana
   Google Scholar
• Barg , A. 1998 . Complexity issues in coding theory . Handbook of Coding Theory, Elsevier Science , 1
   Google Scholar
• Borges-Trenard , M. A. and Borges-Quintana , M. 1998 . “ Gröbner bases property on elimination ideal in the noncommutative case ” . In Gröbner Bases and Applications , 323 – 337 . Cambridge : Cambridge University Press .
   Google Scholar
• Borges-Quintana , M. , Borges-Trenard , M. A. and Martinez-Moro , E. 2006 . “ A general framework for applying FGLM techniques to linear codes ” . In AAECC 16, Lecture Notes in Computer Science Vol. 3857 , 76 – 86 . in
   Google Scholar
• Borges-Trenard , M. A. , Borges-Quintana , M. and Mora , T. 2000 . Computing Gröbner bases by FGLM techniques in a non-commutative setting . J. Symbolic Comput. , 30 ( 4 ) : 429 – 449 .
   Google Scholar
• Borges-Quintana , M. , Borges-Trenard , M. A. and Winkler , F. 2001 . “ An application of the FGLM techniques to linear codes ” . In 4th Italian-Latin American Conference on Applied and Industrial Mathematics , Inst. Cy-bern. Math. Phys. 280 – 286 . Havana in
   Google Scholar
• Borges-Quintana , M. , Winkler , F. and Borges-Trenard , M. 2000 . FGLM techniques applied to linear codes–an algorithm for decoding linear codes , Techn. Rep. RISC-Linz, RISC-00–14 Linz , Austria : J-Kepler Univ . ftp://ftp.risc.uni-linz.ac.at/pub/techreports/2000/00–14.ps.gz
   Google Scholar
• Bruck , J. and Naor , M. 1990 . The hardness of decoding with preprocessing . IEEE Trans. Inform. Theory , 36 ( 2 ) : 381 – 385 .
   Google Scholar
• Buchberger , B. and Möller , H. M. 1982 . “ The construction of multivariate polynomials with preassigned zeros ” . In EUROCAM’82 , Lecture Notes in Computer Science Vol. 144 , 24 – 31 . Berlin Heidelberg, New York : Marseille, Springer Verlag . in
   Google Scholar
• Cox , D. , Little , J. and O’Shea , D. 1998 . Using Algebraic Geometry , New York : Springer-Verlag .
   Google Scholar
• Faugere , J. C. , Gianni , P. , Lazard , D. and Mora , T. 1993 . Efficient computation of zero-dimensional Gröbner bases by change of ordering . J. Symbolic Comput. , 16 ( 4 ) : 329 – 344 .
   Web of Science ®Google Scholar
• 2002 . GAP–Groups, Algorithms and Programming The GAP Group Version 4.3, http://www.gap-system.org
   Google Scholar
• Ikegami , D. and Kaji , Y. 2003 . Maximum likelihood decoding for linear block codes using Gröbner bases . IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences , E86-A ( 3 ) March : 643 – 651 .
   Google Scholar
• Marinari , M. G. , Moller , H. M. and Mora , T. 1993 . Gröbner bases of ideals denned by functionals with an application to ideals of projective points . Applicable Algebra in Engineering, Communication and Computing , 4 : 103 – 145 .
   Web of Science ®Google Scholar
• Mora , T. 2005 . “ Solving polynomial equation systems II: Macaulay’s paradigm and Gröbner technology ” . In Encyclopedia of Mathematics and its Applications 99 , Cambridge University Press .
   Google Scholar
• Petrank , E. and Roth , R. M. 1997 . Is code equivalence easy to decide? . IEEE Trans. Inform. Theory , 43 ( 5 ) : 1602 – 1604 .
   Google Scholar
• Sendrier , N. 2000 . Finding the permutation between equivalent linear codes: the support splitting algorithm . IEEE Trans. Inform. Theory , 46 ( 4 ) : 1193 – 1203 .
   Google Scholar
• Östegar , P. R. J. 2002 . Classifying subspaces of Hamming spaces . Designs, Codes and Cryptography , 27 : 297 – 305 .
   Google Scholar
• Peterson , W. W. and Weldon , E. J. Jr. 1972 . Error-Correcting Codes , 2nd , Cambridge, Massachusetts, London , England : MIT Press .
   Google Scholar
• Winkler , F. 1996 . Polynomial Algorithms in Computer Algebra , Viena, New York : Springer-Verlag .
   Google Scholar