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

Authors:
Teo Mora;Massimiliano Sala
Affiliations:
Department of Information Theory, University of Genua, Italy;Department of Mathematics, University of Pisa, Via Buonarroti 2, 56100 Pisa, Italy
Venue:
Journal of Symbolic Computation
Year:
2003

Citing 5
Cited 1

Upper and Lower Bounds for the Degree of Groebner Bases

EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
Some Effectivity Problems in Polynomial Ideal Theory

EUROSAM '84 Proceedings of the International Symposium on Symbolic and Algebraic Computation
The intractability of computing the minimum distance of a code

IEEE Transactions on Information Theory
Spectra of long primitive binary BCH codes cannot approach the binomial distribution

IEEE Transactions on Information Theory
On the key equation

IEEE Transactions on Information Theory

Generalizing Tanisaki's ideal via ideals of truncated symmetric functions

Journal of Algebraic Combinatorics: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Gröbner bases of the ideal generated by the symmetric functions are presented. Moreover we show how they can be fruitfully applied to a problem arising from coding theory.