On the public citation graph

A General Framework for Applying FGLM Techniques to Linear Codes

https://doi.org/10.1007/11617983_7
0 signed · 25 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/jsco.1993.1051openalex-snapshot
Efficient Computation of Zero-dimensional Gröbner Bases by Change of Ordering
inferredcites →https://doi.org/10.1006/jsco.1999.0415openalex-snapshot
Computing Gröbner Bases by FGLM Techniques in a Non-commutative Setting
inferredcites →https://doi.org/10.1007/3-540-11607-9_3openalex-snapshot
The construction of multivariate polynomials with preassigned zeros
inferredcites →https://doi.org/10.1007/978-3-7091-3406-1openalex-snapshot
Computer Algebra
inferredcites →https://doi.org/10.1007/bf01386834openalex-snapshot
Gr�bner bases of ideals defined by functionals with an application to ideals of projective points
inferredcites →https://doi.org/10.1007/bf01844169openalex-snapshot
Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
inferredcites →https://doi.org/10.1016/j.jsc.2004.09.001openalex-snapshot
Computing zero-dimensional schemes
inferredcites →https://doi.org/10.1017/cbo9780511565847openalex-snapshot
Gröbner Bases and Applications
inferredcites →https://doi.org/10.1017/cbo9781107340954openalex-snapshot
Solving Polynomial Equation Systems II
inferredcites →https://doi.org/10.1081/agb-120017343openalex-snapshot
The Big Mother of all Dualities: Möller Algorithm
inferredcites →https://doi.org/10.1090/gsm/003openalex-snapshot
An Introduction to Gröbner Bases
inferredcites →https://doi.org/10.1112/blms/28.6.667openalex-snapshot
AN INTRODUCTION TO GRÖBNER BASES (Graduate Studies in Mathematics 3)
inferredcites →https://doi.org/10.48550/arxiv.math/0509164openalex-snapshot
Groebner bases and combinatorics for binary codes

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_24openalex-snapshot
An Application of Möller’s Algorithm to Coding Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_3openalex-snapshot
The FGLM Problem and Möller’s Algorithm on Zero-dimensional Ideals
inferred← citeshttps://doi.org/10.1007/978-3-642-02181-7_26openalex-snapshot
Gröbner Representations of Binary Matroids
inferred← citeshttps://doi.org/10.1007/s00200-008-0080-2openalex-snapshot
Gröbner bases and combinatorics for binary codes
inferred← citeshttps://doi.org/10.1016/j.jsc.2007.12.003openalex-snapshot
Bounded distance decoding of linear error-correcting codes with Gröbner bases
inferred← citeshttps://doi.org/10.1109/cig.2010.5592830openalex-snapshot
An algebraic view to gradient descent decoding
inferred← citeshttps://doi.org/10.1142/9789812772022_0002openalex-snapshot
A Gröbner representation for linear codes
inferred← citeshttps://doi.org/10.1142/9789812837172_0013openalex-snapshot
DECODING AND FINDING THE MINIMUM DISTANCE WITH GRÖBNER BASES: HISTORY AND NEW INSIGHTS
inferred← citeshttps://doi.org/10.1142/s0219498815501285openalex-snapshot
Computing coset leaders and leader codewords of binary codes
inferred← citeshttps://doi.org/10.35376/10324/3726openalex-snapshot
A Combinatorial Commutative Algebra Approach to Complete Decoding
inferred← citeshttps://doi.org/10.3934/amc.2016003openalex-snapshot
On the ideal associated to a linear code
inferred← citeshttps://doi.org/10.48550/arxiv.1001.5074openalex-snapshot
Computing coset leaders of binary codes
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.