Hilbert quasi-polynomial for order domains and application to coding theory
classification
🧮 math.AC
cs.ITmath.COmath.IT
keywords
hilbertorderapplicationdomainsquasi-polynomialsalgorithmallowingallows
read the original abstract
We present an application of Hilbert quasi-polynomials to order domains, allowing the effective check of the second order-domain condition in a direct way. We also provide an improved algorithm for the computation of the related Hilbert quasi-polynomials. This allows to identify order domain codes more easily.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.