AbstractWe consider solving for a and b the congruence a≡bh mod I, where a, b and h are (multivariable) polynomials and I is a polynomial ideal. This is a generalization of the well-known problem of Padé approximation of which decoding Hensel codes is a special case. We show how Gröbner bases of modules may be used to generalize the Euclidean algorithm method of solution of the 1-variable problem
This paper shows how Gröbner basis techniques can be used in coding theory, especially in the constr...
AbstractThis paper extends the previous work of the authors on recursive Gröbner basis techniques in...
AbstractWe consider the congruencea≡∑i=1sbihimodIwhereh1,…,hsare given modulo a zero dimensional ide...
AbstractWe consider solving for a and b the congruence a≡bh mod I, where a, b and h are (multivariab...
There is much common ground between the areas of coding theory and systems theory. Fitzpatrick has s...
AbstractAn algorithm for computing a Gröbner basis of a polynomial ideal over a Euclidean domain is ...
AbstractThe recent development of Computer Algebra allows us to take up problems of classical Ideal ...
Gröbner bases are useful for analysing multivariate polynomial ideals. For different coefficient dom...
A basis for an ideal is such that every element in the ideal can be expressed as a linear combinatio...
AbstractWe develop a theory of Gröbner bases over Galois rings, following the usual formulation for ...
Abstract. It is shown how to find general multivariate Padé approximation using Gröbner basis techni...
Dissertation (MSc (Mathematics))--University of Pretoria, 2023.In this dissertation we explore the t...
In the ring of polynomials k[x1,... ,xn] every ideal has a\ud special basis known as a Gröbner basis...
AbstractIntermediate coefficient swell is a well-known difficulty with Buchberger’s algorithm for co...
Gröbner basis is a particular kind of a generating set of an ideal in the polynomial ring S = K[x1, ...
This paper shows how Gröbner basis techniques can be used in coding theory, especially in the constr...
AbstractThis paper extends the previous work of the authors on recursive Gröbner basis techniques in...
AbstractWe consider the congruencea≡∑i=1sbihimodIwhereh1,…,hsare given modulo a zero dimensional ide...
AbstractWe consider solving for a and b the congruence a≡bh mod I, where a, b and h are (multivariab...
There is much common ground between the areas of coding theory and systems theory. Fitzpatrick has s...
AbstractAn algorithm for computing a Gröbner basis of a polynomial ideal over a Euclidean domain is ...
AbstractThe recent development of Computer Algebra allows us to take up problems of classical Ideal ...
Gröbner bases are useful for analysing multivariate polynomial ideals. For different coefficient dom...
A basis for an ideal is such that every element in the ideal can be expressed as a linear combinatio...
AbstractWe develop a theory of Gröbner bases over Galois rings, following the usual formulation for ...
Abstract. It is shown how to find general multivariate Padé approximation using Gröbner basis techni...
Dissertation (MSc (Mathematics))--University of Pretoria, 2023.In this dissertation we explore the t...
In the ring of polynomials k[x1,... ,xn] every ideal has a\ud special basis known as a Gröbner basis...
AbstractIntermediate coefficient swell is a well-known difficulty with Buchberger’s algorithm for co...
Gröbner basis is a particular kind of a generating set of an ideal in the polynomial ring S = K[x1, ...
This paper shows how Gröbner basis techniques can be used in coding theory, especially in the constr...
AbstractThis paper extends the previous work of the authors on recursive Gröbner basis techniques in...
AbstractWe consider the congruencea≡∑i=1sbihimodIwhereh1,…,hsare given modulo a zero dimensional ide...
DOI
Add to ORKG