论文信息 - Gröbner bases of certain zero-dimensional ideals arising in coding theory

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

The combinatorics of reduced Grobner bases of certain zero-dimensional ideals, which arise when Grobner basis technique is applied to the soft-decision maximum likelihood decoding of binary linear block codes, will be studied.

Takayuki Hibi | Hidefumi Ohsugi | Daisuke Ikegami | Tomonori Kitamura

[1] Carlo Traverso,et al. Buchberger Algorithm and Integer Programming , 1991, AAECC.

[2] David A. Cox,et al. Using Algebraic Geometry , 1998 .

[3] Yuichi Kaji,et al. Maximum likelihood decoding for linear block codes using Grobner bases , 2003 .

[4] David A. Cox,et al. Ideals, Varieties, and Algorithms , 1997 .