Gröbner bases of certain zero-dimensional ideals arising in coding theory

Advances in Applied Mathematics

Volumn 31, Issue 2, 2003, Pages 420-432

  Ohsugi, Hidefumi ^a   Ikegami, Daisuke ^b   Kitamura, Tomonori ^c   Hibi, Takayuki ^c  

^a RIKKYO UNIVERSITY   (Japan)

^b NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^c OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038809434     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-8858(03)00019-8     Document Type: Article

References (4)

1. P. Conti, C. Traverso, Buchberger algorithm and integer programming, in: H. Mattson, T. More, T. Rao (Eds.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, in: Lecture Notes in Comput. Sci., Vol. 539, Springer-Verlag, Berlin, 1991, pp. 130-139.
2. D. Cox, J. Little, D. O'Shea, Ideals, Varieties and Algorithms, Springer-Verlag, Berlin, 1992.
3. D. Cox, J. Little, D. O'Shea, Using Algebraic Geometry, Springer-Verlag, Berlin, 1998.
4. D. Ikegami, Y. Kaji, Maximum likelihood decoding for linear block codes using Gröbner bases, IEICE Trans. Fund. Electron. Commun. Comput. Sci. E86-A (3) (2003) 643-651.