On the Gröbner bases of some symmetric systems and their application to coding theory. (Q1426139)

The authors introduce a family of symmetric polynomials in \(n\) indeterminates that they call Gröbnerian symmetric functions. They obtain relations between these symmetric functions and the elementary symmetric functions that are similar to Newton's identities (or Newton-Girard formulas) and use these to show that the Gröbnerian symmetric functions form a Gröbner basis of the ideal of all symmetric polynomials under lexicographic ordering. The authors explain why certain Gröbnerian symmetric functions are useful in accelerating the computation of Gröbner bases of the ideals used by \textit{M. Sala} [Appl. Algebra Eng. Commun. Comput. 13, 137--162 (2002; Zbl 1034.94013)] to find the minimum distance of some cyclic codes.