On the public citation graph

On the Structure of Order Domains

0 signed · 97 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/ffta.2000.0283openalex-snapshot
New Codes for the Berlekamp–Massey–Sakata Algorithm
inferredcites →https://doi.org/10.1006/jabr.1999.8102openalex-snapshot
Syzygies of affine toric varieties
inferredcites →https://doi.org/10.1007/3-540-15984-3_321openalex-snapshot
Term orderings on the polynomial ring
inferredcites →https://doi.org/10.1007/978-1-4613-8431-1openalex-snapshot
Lectures on 0/1-Polytopes
inferredcites →https://doi.org/10.1007/978-1-84800-273-9_9openalex-snapshot
Algebraic coding theory
inferredcites →https://doi.org/10.1007/978-3-642-58575-3_10openalex-snapshot
Algebraic Geometry Codes
inferredcites →https://doi.org/10.1007/978-3-642-59312-3openalex-snapshot
Elements of Mathematics
inferredcites →https://doi.org/10.1007/978-3-642-61698-3openalex-snapshot
Algebra II
inferredcites →https://doi.org/10.1007/978-94-011-3810-9openalex-snapshot
Algebraic-Geometric Codes
inferredcites →https://doi.org/10.1007/bf01273309openalex-snapshot
Generators and relations of abelian semigroups and semigroup rings
inferredcites →https://doi.org/10.1016/0890-5401(90)90039-kopenalex-snapshot
Extension of the Berlekamp-Massey algorithm to N dimensions
inferredcites →https://doi.org/10.1016/c2013-0-01797-5openalex-snapshot
The Theory of Finitely Generated Commutative Semigroups
inferredcites →https://doi.org/10.1016/s0378-3758(00)00260-3openalex-snapshot
On the existence of order functions
inferredcites →https://doi.org/10.1016/s0747-7171(08)80056-9openalex-snapshot
The concept of Gröbner algebras
inferredcites →https://doi.org/10.1016/s0747-7171(86)80019-0openalex-snapshot
On the theory of graded structures
inferredcites →https://doi.org/10.1017/cbo9780511608681openalex-snapshot
Cohen-Macaulay Rings
inferredcites →https://doi.org/10.1090/gsm/003openalex-snapshot
An Introduction to Gröbner Bases
inferredcites →https://doi.org/10.1090/ulect/008openalex-snapshot
Gröbner Bases and Convex Polytopes
inferredcites →https://doi.org/10.1109/18.165441openalex-snapshot
Decoding geometric Goppa codes using an extra place
inferredcites →https://doi.org/10.1109/18.335972openalex-snapshot
A simple approach for construction of algebraic-geometric codes from affine plane curves
inferredcites →https://doi.org/10.1109/18.476214openalex-snapshot
On the decoding of algebraic-geometric codes
inferredcites →https://doi.org/10.1109/18.476244openalex-snapshot
Decoding of codes defined by a single point on a curve
inferredcites →https://doi.org/10.1109/18.476245openalex-snapshot
The minimum distance of codes in an array coming from telescopic semigroups
inferredcites →https://doi.org/10.1109/18.476246openalex-snapshot
Algebraic-geometric codes and multidimensional cyclic codes: a unified theory and algorithms for decoding using Grobner bases
inferredcites →https://doi.org/10.1109/18.720550openalex-snapshot
Algebraic-geometry codes
inferredcites →https://doi.org/10.1109/tit.1969.1054260openalex-snapshot
Shift-register synthesis and BCH decoding
inferredcites →https://doi.org/10.1142/9407openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.2307/1968575openalex-snapshot
Reduction of the Singularities of an Algebraic Surface
inferredcites →https://doi.org/10.2307/1968949openalex-snapshot
The Reduction of the Singularities of an Algebraic Surface
inferredcites →https://doi.org/10.2307/2309950openalex-snapshot
Commutative Algebra Vol I.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11617983_29openalex-snapshot
On the Feng-Rao Bound for Generalized Hamming Weights
inferred← citeshttps://doi.org/10.1007/978-3-319-56932-1_18openalex-snapshot
Geometric and Computational Approach to Classical and Quantum Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-540-77224-8_39openalex-snapshot
Extended Norm-Trace Codes with Optimized Correction Capability
inferred← citeshttps://doi.org/10.1007/978-3-540-77224-8_9openalex-snapshot
Generalized Sudan’s List Decoding for Order Domain Codes
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_7openalex-snapshot
Automorphisms and Encoding of AG and Order Domain Codes
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_8openalex-snapshot
Algebraic Geometry Codes from Order Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-40663-8_8openalex-snapshot
Generalized AG Codes as Evaluation Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-45114-0_6openalex-snapshot
Soft Constraints for Lexicographic Orders
inferred← citeshttps://doi.org/10.1007/s00200-015-0271-6openalex-snapshot
On the evaluation codes given by simple $$\delta $$ δ -sequences
inferred← citeshttps://doi.org/10.1007/s00233-015-9720-6openalex-snapshot
On semigroups, Gröbner basis and algebras admitting a complete set of near weights
inferred← citeshttps://doi.org/10.1007/s10623-006-9011-zopenalex-snapshot
Evaluation codes and plane valuations
inferred← citeshttps://doi.org/10.1007/s10623-012-9738-7openalex-snapshot
Evaluation codes defined by finite families of plane valuations at infinity
inferred← citeshttps://doi.org/10.1007/s10623-012-9793-0openalex-snapshot
Skeleton simplicial evaluation codes
inferred← citeshttps://doi.org/10.1007/s10623-014-9983-zopenalex-snapshot
An improvement of the Feng–Rao bound for primary codes
inferred← citeshttps://doi.org/10.1007/s10623-015-0165-4openalex-snapshot
Near weights on higher dimensional varieties
inferred← citeshttps://doi.org/10.1007/s10623-020-00818-8openalex-snapshot
Evaluation codes and their basic parameters
inferred← citeshttps://doi.org/10.1007/s10623-021-00872-wopenalex-snapshot
The dual of an evaluation code
inferred← citeshttps://doi.org/10.1007/s10623-024-01437-3openalex-snapshot
Indicator functions, v-numbers and Gorenstein rings in the theory of projective Reed–Muller-type codes
inferred← citeshttps://doi.org/10.1007/s10801-018-0855-xopenalex-snapshot
Generalized minimum distance functions
inferred← citeshttps://doi.org/10.1007/s40863-022-00305-zopenalex-snapshot
Relative generalized Hamming weights of evaluation codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2005.06.007openalex-snapshot
On puncturing of codes from Norm–Trace curves
inferred← citeshttps://doi.org/10.1016/j.ffa.2006.12.004openalex-snapshot
Evaluation codes from order domain theory
inferred← citeshttps://doi.org/10.1016/j.ffa.2010.03.002openalex-snapshot
Improved evaluation codes defined by plane valuations
inferred← citeshttps://doi.org/10.1016/j.ffa.2011.07.007openalex-snapshot
Generic interpolation polynomial for list decoding
inferred← citeshttps://doi.org/10.1016/j.ffa.2013.03.005openalex-snapshot
Feng–Rao decoding of primary codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.05.006openalex-snapshot
Further improvements on the Feng–Rao bound for dual codes
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2006.06.018openalex-snapshot
Computing the Feng–Rao distances for codes from order domains
inferred← citeshttps://doi.org/10.1016/j.jpaa.2007.07.006openalex-snapshot
The structure of algebras admitting well-agreeing near weights
inferred← citeshttps://doi.org/10.1016/j.jpaa.2008.11.013openalex-snapshot
Bounding the number of Fq -rational places in algebraic function fields using Weierstrass semigroups
inferred← citeshttps://doi.org/10.1016/j.jsc.2013.03.001openalex-snapshot
Generalization of the Lee–OʼSullivan list decoding for one-point AG codes
inferred← citeshttps://doi.org/10.1016/j.jsc.2013.12.007openalex-snapshot
Computational aspects of retrieving a representation of an algebraic geometry code
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.02.015openalex-snapshot
List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
inferred← citeshttps://doi.org/10.1016/s0378-3758(00)00260-3openalex-snapshot
On the existence of order functions
inferred← citeshttps://doi.org/10.1016/s1071-5797(03)00010-8openalex-snapshot
On codes from norm–trace curves
inferred← citeshttps://doi.org/10.1016/s1071-5797(03)00038-8openalex-snapshot
Integral closures and weight functions over finite fields
inferred← citeshttps://doi.org/10.1017/9780511982170openalex-snapshot
Codes, Cryptology and Curves with Computer Algebra
inferred← citeshttps://doi.org/10.1080/00927872.2018.1498864openalex-snapshot
Reversely well-ordered valuations on rational function fields in two variables
inferred← citeshttps://doi.org/10.1090/conm/642/12883openalex-snapshot
Evaluation Codes and Plane Valuations
inferred← citeshttps://doi.org/10.1090/s0002-9939-04-07456-8openalex-snapshot
The growth of valuations on rational function fields in two variables
inferred← citeshttps://doi.org/10.1109/isit.2001.936171openalex-snapshot
Codes from order domains
inferred← citeshttps://doi.org/10.1109/isit.2002.1023331openalex-snapshot
Integral closures and weight functions over finite fields
inferred← citeshttps://doi.org/10.1109/isit.2002.1023474openalex-snapshot
An algorithm for finding the roots of the polynomials over order domains
inferred← citeshttps://doi.org/10.1109/isit.2004.1365113openalex-snapshot
The missing evaluation codes from order domain theory
inferred← citeshttps://doi.org/10.1109/isit.2012.6284685openalex-snapshot
List decoding algorithms based on Gröbner bases for general one-point AG codes
inferred← citeshttps://doi.org/10.1109/itw.2014.6970808openalex-snapshot
Relative generalized Hamming weights of one-point algebraic geometric codes
inferred← citeshttps://doi.org/10.1109/tit.2004.825043openalex-snapshot
List Decoding of $q$ -ary Reed–Muller Codes
inferred← citeshttps://doi.org/10.1109/tit.2004.842765openalex-snapshot
A Root-Finding Algorithm for List Decoding of Reed–Muller Codes
inferred← citeshttps://doi.org/10.1109/tit.2007.894663openalex-snapshot
Near Orders and Codes
inferred← citeshttps://doi.org/10.1109/tit.2014.2311042openalex-snapshot
Lemma for Linear Feedback Shift Registers and DFTs Applied to Affine Variety Codes
inferred← citeshttps://doi.org/10.1109/tit.2014.2345375openalex-snapshot
Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes
inferred← citeshttps://doi.org/10.1109/tit.2018.2807478openalex-snapshot
Fast Decoding of Dual Multipoint Codes From Algebraic Curves Up to the Kirfel–Pellikaan Bound
inferred← citeshttps://doi.org/10.1109/tit.2019.2932405openalex-snapshot
Vardøhus Codes: Polar Codes Based on Castle Curves Kernels
inferred← citeshttps://doi.org/10.1112/plms/pdn042openalex-snapshot
δ-sequences and evaluation codes defined by plane valuations at infinity
inferred← citeshttps://doi.org/10.1142/9789812772022_0001openalex-snapshot
The key equation for codes from order domains
inferred← citeshttps://doi.org/10.1142/9789812794017_0004openalex-snapshot
Evaluation Codes from an Affine Variety Code Perspective
inferred← citeshttps://doi.org/10.1142/9789812794017_0007openalex-snapshot
Algebraic Geometry Codes from Higher Dimensional Varieties
inferred← citeshttps://doi.org/10.14393/ufu.di.2013.175openalex-snapshot
Códigos de avaliação a partir de uma perspectiva de códigos de variedades afins
inferred← citeshttps://doi.org/10.14393/ufu.di.2013.98openalex-snapshot
A cota de Andersen-Geil para distância mínima de códigos e aplicações
inferred← citeshttps://doi.org/10.3934/amc.2007.1.151openalex-snapshot
The ubiquity of order domains for the construction of error control codes
inferred← citeshttps://doi.org/10.3934/amc.2009.3.1openalex-snapshot
A weighted module view of integral closures of affine domains of type I
inferred← citeshttps://doi.org/10.47749/t/unicamp.2011.834728openalex-snapshot
Funções pesos fracos sobre variedades algébricas
inferred← citeshttps://doi.org/10.48550/arxiv.1212.5802openalex-snapshot
Generalized AG codes as evaluation codes
inferred← citeshttps://doi.org/10.48550/arxiv.1712.00387openalex-snapshot
Footprint and minimum distance functions
inferred← citeshttps://doi.org/10.48550/arxiv.1712.08325openalex-snapshot
Well-Ordered Valuations on Rational Function Fields in Two Variables
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0603014openalex-snapshot
Near orders and codes
inferred← citeshttps://doi.org/10.48550/arxiv.math/0303299openalex-snapshot
A key equation and the computation of error values for codes from order domains
inferred← citeshttps://doi.org/10.48550/arxiv.math/0605306openalex-snapshot
The structure of algebras admitting well agreeing near weights
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.