On the public citation graph
On the Decoding of Cyclic Codes Using Gröbner Bases
0 signed · 40 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/3-540-51083-4_54openalex-snapshot
Some new effectivity bounds in computational geometry
inferredcites →https://doi.org/10.1007/978-0-387-35651-8openalex-snapshot
Ideals, Varieties, and Algorithms
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1023/a:1008274212057openalex-snapshot
Decoding Affine Variety Codes Using Gröbner Bases
inferredcites →https://doi.org/10.1049/el:19911294openalex-snapshot
Finding BCH error locator polynomials in one step
inferredcites →https://doi.org/10.1109/18.104340openalex-snapshot
Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations
inferredcites →https://doi.org/10.1109/18.133246openalex-snapshot
A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
inferredcites →https://doi.org/10.1109/18.30981openalex-snapshot
A generalized Euclidean algorithm for multisequence shift-register synthesis
inferredcites →https://doi.org/10.1109/18.333885openalex-snapshot
Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
inferredcites →https://doi.org/10.1109/18.508856openalex-snapshot
Some remarks on an algorithm of Fitzpatrick
inferredcites →https://doi.org/10.1109/tit.1960.1057586openalex-snapshot
Encoding and error-correction procedures for the Bose-Chaudhuri codes
inferredcites →https://doi.org/10.1109/tit.1969.1054260openalex-snapshot
Shift-register synthesis and BCH decoding
inferredcites →https://doi.org/10.31390/gradschool_disstheses.6248openalex-snapshot
Applications of Grobner Bases to Linear 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-89994-5_10openalex-snapshot
Invited Talk: Decoding Cyclic Codes: The Cooper Philosophy
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_25openalex-snapshot
Mattson Solomon Transform and Algebra Codes
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/978-3-662-03891-8_11openalex-snapshot
Gröbner Bases for Decoding
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/s00200-026-00754-5openalex-snapshot
m-adic residue codes over $$\mathbb {F}_q S$$ and CSS quantum constructions
inferred← citeshttps://doi.org/10.1007/s002000200096openalex-snapshot
Groebner Bases and Distance of Cyclic Codes
inferred← citeshttps://doi.org/10.1007/s002000200097openalex-snapshot
The Chen-Reed-Helleseth-Truong Decoding Algorithm and the Gianni-Kalkbrenner Gröbner Shape Theorem
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.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.1023/a:1008274212057openalex-snapshot
Decoding Affine Variety Codes Using Gröbner Bases
inferred← citeshttps://doi.org/10.1109/commnet.2018.8360258openalex-snapshot
New efficient decoding algorithm of the (17, 9, 5) quadratic residue code
inferred← citeshttps://doi.org/10.1109/isit.2003.1228378openalex-snapshot
Efficient decoding of (binary) cyclic codes above the correction capacity of the code using grobner bases
inferred← citeshttps://doi.org/10.1109/isit.2007.4557618openalex-snapshot
On formulas for decoding binary 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.1145/1993886.1993908openalex-snapshot
Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1910.13189openalex-snapshot
Macaulay, Lazard and the Syndrome Variety
inferred← citeshttps://doi.org/10.6688/jise.2009.25.4.20openalex-snapshot
Decoding Binary Quadratic Residue Codes Using the Euclidean Algorithm
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.