On the public citation graph
The Chen-Reed-Helleseth-Truong Decoding Algorithm and the Gianni-Kalkbrenner Gröbner Shape Theorem
0 signed · 24 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.
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.
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.1007/s002000050084openalex-snapshot
On the Decoding of Cyclic Codes Using Gröbner Bases
inferredcites →https://doi.org/10.1016/s0747-7171(85)80035-3openalex-snapshot
Ideal Bases and Primary Decomposition: Case of Two Variables
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-89994-5_10openalex-snapshot
Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_5openalex-snapshot
Decoding Cyclic Codes: the Cooper Philosophy
inferred← citeshttps://doi.org/10.1007/s00200-020-00427-xopenalex-snapshot
HELP: a sparse error locator polynomial for BCH codes
inferred← citeshttps://doi.org/10.1007/s00200-022-00586-zopenalex-snapshot
Degröbnerization: a political manifesto
inferred← citeshttps://doi.org/10.1007/s002000200096openalex-snapshot
Groebner Bases and Distance of Cyclic Codes
inferred← citeshttps://doi.org/10.1007/s10623-023-01302-9openalex-snapshot
Towards a Gröbner-free approach to coding
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2008.09.037openalex-snapshot
A commutative algebra approach to linear codes
inferred← citeshttps://doi.org/10.1016/j.jpaa.2004.12.027openalex-snapshot
Correcting errors and erasures via the syndrome variety
inferred← citeshttps://doi.org/10.1016/j.jpaa.2012.01.002openalex-snapshot
Improved decoding of affine-variety 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.1016/j.jsc.2008.02.006openalex-snapshot
On the decoding of binary cyclic codes with the Newton identities
inferred← citeshttps://doi.org/10.1016/s0747-7171(02)00131-1openalex-snapshot
On the Gröbner bases of some symmetric systems and their application to coding theory
inferred← citeshttps://doi.org/10.1017/9780511982170openalex-snapshot
Codes, Cryptology and Curves with Computer Algebra
inferred← citeshttps://doi.org/10.1109/isit.2007.4557618openalex-snapshot
On formulas for decoding binary cyclic codes
inferred← citeshttps://doi.org/10.1109/tit.2006.889465openalex-snapshot
General Error Locator Polynomials for Binary Cyclic Codes With $t \le 2$ and $n < 63$
inferred← citeshttps://doi.org/10.1109/tit.2018.2875546openalex-snapshot
Radical-Locator Polynomials and Row-Echelon Partial Syndrome Matrices With Applications to Decoding Cyclic 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/s0219498807002260openalex-snapshot
GRÖBNER BASIS TECHNIQUES TO COMPUTE WEIGHT DISTRIBUTIONS OF SHORTENED CYCLIC CODES
inferred← citeshttps://doi.org/10.48550/arxiv.1910.13189openalex-snapshot
Macaulay, Lazard and the Syndrome Variety
inferred← citeshttps://doi.org/10.5281/zenodo.171354openalex-snapshot
FIGURE 2 in Gynocladius scalpellosus n. gen., n. sp. from Brazil (Diptera: Chironomidae: Orthocladiinae)
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.