On the public citation graph

On the key equation

0 signed · 122 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.1007/3-540-51082-6_72openalex-snapshot
An Iterative Euclidean Algorithm
inferredcites →https://doi.org/10.1007/978-0-387-35651-8openalex-snapshot
Ideals, Varieties, and Algorithms
inferredcites →https://doi.org/10.1007/978-1-4612-0913-3openalex-snapshot
Gröbner Bases: A Computational Approach to Commutative Algebra
inferredcites →https://doi.org/10.1007/978-1-4613-8994-1openalex-snapshot
Coding Theory and Design Theory
inferredcites →https://doi.org/10.1007/978-1-4757-2181-2openalex-snapshot
Ideals, Varieties, and Algorithms
inferredcites →https://doi.org/10.1007/978-1-84800-273-9_9openalex-snapshot
Algebraic coding theory
inferredcites →https://doi.org/10.1007/978-94-009-5225-6_6openalex-snapshot
Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory
inferredcites →https://doi.org/10.1007/b102438openalex-snapshot
Algorithms for Computer Algebra
inferredcites →https://doi.org/10.1007/bf01235722openalex-snapshot
The Berlekamp-Massey Algorithm and Linear Recurring Sequences Over a Factorial Domain
inferredcites →https://doi.org/10.1007/bfb0019862openalex-snapshot
Linear recurrence relations and an extended subresultant algorithm
inferredcites →https://doi.org/10.1016/0196-6774(80)90013-9openalex-snapshot
Fast solution of toeplitz systems of equations and computation of Padé approximants
inferredcites →https://doi.org/10.1016/s0019-9958(75)90090-xopenalex-snapshot
A method for solving key equation for decoding goppa codes
inferredcites →https://doi.org/10.1016/s0747-7171(08)80087-9openalex-snapshot
A Gröbner basis technique for Padé approximation
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1017/cbo9780511606267openalex-snapshot
The Theory of Information and Coding
inferredcites →https://doi.org/10.1049/el:19911294openalex-snapshot
Finding BCH error locator polynomials in one step
inferredcites →https://doi.org/10.1049/el:19940103openalex-snapshot
New time domain errors and erasures decoding algorithmfor BCH codes
inferredcites →https://doi.org/10.1049/ip-e.1988.0043openalex-snapshot
Simplified procedure for correcting both errors and erasures of Reed-Solomon code using Euclidean algorithm
inferredcites →https://doi.org/10.1090/s0025-5718-1975-0369276-7openalex-snapshot
Continued Fractions and Linear Recurrences
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
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.333886openalex-snapshot
General principles for the algebraic decoding of cyclic codes
inferredcites →https://doi.org/10.1109/tassp.1986.1164800openalex-snapshot
Fast algorithms for digital signal processing
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.1109/tit.1975.1055350openalex-snapshot
The algebraic decoding of Goppa codes
inferredcites →https://doi.org/10.1109/tit.1977.1055730openalex-snapshot
Decoding of alternant codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1979.1055987openalex-snapshot
Continued fractions and Berlekamp's algorithm
inferredcites →https://doi.org/10.1109/tit.1987.1057299openalex-snapshot
On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
inferredcites →https://doi.org/10.1137/0109020openalex-snapshot
A Class of Error-Correcting Codes in $p^m $ Symbols
inferredcites →https://doi.org/10.1137/0134048openalex-snapshot
A Property of Euclid’s Algorithm and an Application to Padé Approximation
inferredcites →https://doi.org/10.1142/9407openalex-snapshot
Algebraic Coding Theory

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cta.550openalex-snapshot
Error resilient data transport in sensor network applications: A generic perspective
inferred← citeshttps://doi.org/10.1006/jsco.1997.0153openalex-snapshot
Solving a Multivariable Congruence by Change of Term Order
inferred← citeshttps://doi.org/10.1006/jsco.2001.0442openalex-snapshot
Gröbner Bases over Galois Rings with an Application to Decoding Alternant Codes
inferred← citeshttps://doi.org/10.1007/3-540-45624-4_34openalex-snapshot
Lifting Decoding Schemes over a Galois Ring
inferred← citeshttps://doi.org/10.1007/3-540-45624-4_36openalex-snapshot
A Unifying System-Theoretic Framework for Errors-and-Erasures Reed-Solomon Decoding
inferred← citeshttps://doi.org/10.1007/978-0-387-35515-3_22openalex-snapshot
A Simple Algorithm for Computing Several Sequences Synthesis
inferred← citeshttps://doi.org/10.1007/978-1-4020-8391-4_8openalex-snapshot
Cyclic codes for non volatile storage
inferred← citeshttps://doi.org/10.1007/978-1-4613-0165-3_16openalex-snapshot
Recursive Construction of GrÖbner Bases for the Solution of Polynomial Congruences
inferred← citeshttps://doi.org/10.1007/978-3-0348-8970-4_16openalex-snapshot
An Algebraic Decoding Algorithm for Convolutional Codes
inferred← citeshttps://doi.org/10.1007/978-3-540-48302-1_37openalex-snapshot
FPGA Design Trade-Offs for Solving the Key Equation in Reed-Solomon Decoding
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_10openalex-snapshot
The BMS Algorithm and Decoding of AG Codes
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_12openalex-snapshot
FGLM-Like Decoding: from Fitzpatrick’s Approach to Recent Developments
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_14openalex-snapshot
Gröbner Bases over Commutative Rings and Applications to Coding Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_4openalex-snapshot
An Introduction to Linear and Cyclic Codes
inferred← citeshttps://doi.org/10.1007/bf01211856openalex-snapshot
On the scalar rational interpolation problem
inferred← citeshttps://doi.org/10.1007/s00200-007-0048-7openalex-snapshot
Gröbner basis approach to list decoding of algebraic geometry codes
inferred← citeshttps://doi.org/10.1007/s002000050084openalex-snapshot
On the Decoding of Cyclic Codes Using Gröbner Bases
inferred← citeshttps://doi.org/10.1007/s002000050103openalex-snapshot
Comparison of Two Algorithms for Decoding Alternant Codes
inferred← citeshttps://doi.org/10.1007/s002000200096openalex-snapshot
Groebner Bases and Distance of Cyclic Codes
inferred← citeshttps://doi.org/10.1007/s10623-012-9632-3openalex-snapshot
Algebraic decoding of negacyclic codes over $${\mathbb Z_4}$$
inferred← citeshttps://doi.org/10.1007/s10623-016-0226-3openalex-snapshot
An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings
inferred← citeshttps://doi.org/10.1007/s10623-023-01315-4openalex-snapshot
Fast Kötter–Nielsen–Høholdt interpolation over skew polynomial rings and its application in coding theory
inferred← citeshttps://doi.org/10.1007/s11075-011-9532-zopenalex-snapshot
The Neville-like form of the Fitzpatrick algorithm for rational interpolation
inferred← citeshttps://doi.org/10.1016/b978-0-44-313517-0.00011-1openalex-snapshot
Linear complexity of sequences
inferred← citeshttps://doi.org/10.1016/j.cam.2011.05.012openalex-snapshot
A Fitzpatrick algorithm for multivariate rational interpolation
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.jsc.2008.01.002openalex-snapshot
List decoding of Reed–Solomon codes from a Gröbner basis perspective
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.03.010openalex-snapshot
Key equations for list decoding of Reed–Solomon codes and how to solve them
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.07.026openalex-snapshot
Algorithms for simultaneous Hermite–Padé approximations
inferred← citeshttps://doi.org/10.1016/j.jsc.2022.10.007openalex-snapshot
Simultaneous Rational Function Reconstruction with errors: Handling multiplicities and poles
inferred← citeshttps://doi.org/10.1016/j.laa.2010.08.030openalex-snapshot
Minimal Gröbner bases and the predictable leading monomial property
inferred← citeshttps://doi.org/10.1016/s0024-3795(01)00509-2openalex-snapshot
Gröbner basis solutions of constrained interpolation problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00350-4openalex-snapshot
Algebraic structure of quasicyclic codes
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.1016/s1571-0653(04)00169-6openalex-snapshot
Decoding a Class of Alternant Codes for the Lee Metric
inferred← citeshttps://doi.org/10.1017/s0004972724000601openalex-snapshot
ON THE BINARY SEQUENCE $(1,1,0,1,0^3,1,0^7,1,0^{15},\ldots )$
inferred← citeshttps://doi.org/10.1023/a:1008290027201openalex-snapshot
A Generalized Rational Interpolation Problem and the Solution of the Welch–Berlekamp Key Equation
inferred← citeshttps://doi.org/10.1049/ip-com:19990129openalex-snapshot
Errors-and-erasures decoding of BCH codes
inferred← citeshttps://doi.org/10.1090/s0025-5718-05-01790-4openalex-snapshot
Gröbner bases and generalized Padé approximation
inferred← citeshttps://doi.org/10.1109/18.508856openalex-snapshot
Some remarks on an algorithm of Fitzpatrick
inferred← citeshttps://doi.org/10.1109/18.556111openalex-snapshot
Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences
inferred← citeshttps://doi.org/10.1109/18.986002openalex-snapshot
Hamming metric decoding of alternant codes over Galois rings
inferred← citeshttps://doi.org/10.1109/18.992804openalex-snapshot
Decoding a class of Lee metric codes over a Galois ring
inferred← citeshttps://doi.org/10.1109/cdc.2009.5399804openalex-snapshot
Gröbner bases and behaviors over finite rings
inferred← citeshttps://doi.org/10.1109/cosera.2016.7745687openalex-snapshot
Recursive enhancement of intrinsic soft information for complex reed-solomon codes
inferred← citeshttps://doi.org/10.1109/glocom.1998.775854openalex-snapshot
Tree decoding of BCH codes
inferred← citeshttps://doi.org/10.1109/icmel.2006.1651046openalex-snapshot
Low Power Computing for Secure and Reliable Sensor Networks
inferred← citeshttps://doi.org/10.1109/isit.1997.613252openalex-snapshot
Comparison of two algorithms for decoding BCH codes
inferred← citeshttps://doi.org/10.1109/isit.2000.866494openalex-snapshot
Algebraic structure of quasicyclic codes
inferred← citeshttps://doi.org/10.1109/isit.2000.866746openalex-snapshot
Grobner bases and alternant codes over Galois rings
inferred← citeshttps://doi.org/10.1109/isit.2006.261906openalex-snapshot
An Interpolation Algorithm using Gröbner Bases for Soft-Decision Decoding of Reed-Solomon Codes
inferred← citeshttps://doi.org/10.1109/isit.2010.5513685openalex-snapshot
The predictable leading monomial property for polynomial vectors over a ring
inferred← citeshttps://doi.org/10.1109/isit.2011.6034253openalex-snapshot
On the decoding complexity of cyclic codes up to the BCH bound
inferred← citeshttps://doi.org/10.1109/isit.2013.6620353openalex-snapshot
Generalised Multi-sequence Shift-Register synthesis using module minimisation
inferred← citeshttps://doi.org/10.1109/isit.2013.6620419openalex-snapshot
Reverse Berlekamp-Massey decoding
inferred← citeshttps://doi.org/10.1109/isit.2016.7541759openalex-snapshot
An alternative decoding method for Gabidulin codes in characteristic zero
inferred← citeshttps://doi.org/10.1109/isit.2018.8437579openalex-snapshot
Linearized Goppa Codes
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174394openalex-snapshot
Efficient Algorithm for the Linear Complexity of Sequences and Some Related Consequences
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517904openalex-snapshot
Efficient Decoding of Gabidulin Codes over Galois Rings
inferred← citeshttps://doi.org/10.1109/lsp.2009.2032494openalex-snapshot
Comments on “A Simple and Accurate Algorithm for Barycentric Rational Interpolation”
inferred← citeshttps://doi.org/10.1109/miel.2002.1003332openalex-snapshot
Reed-Solomon codecs for optical communications
inferred← citeshttps://doi.org/10.1109/smicnd.2006.283924openalex-snapshot
Coding and Cryptography for Resource Constrained Wireless Sensor Networks: A Hardware-Software Co-Design Approach
inferred← citeshttps://doi.org/10.1109/tcomm.2022.3215998openalex-snapshot
A New Decoding Method for Reed–Solomon Codes Based on FFT and Modular Approach
inferred← citeshttps://doi.org/10.1109/tit.2003.820026openalex-snapshot
Algorithm and architecture for a Galois field multiplicative arithmetic processor
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.2013.2243800openalex-snapshot
On Rational Interpolation-Based List-Decoding and List-Decoding Binary Goppa Codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2613559openalex-snapshot
Partial Inverses mod $m(x)$ and Reverse Berlekamp–Massey Decoding
inferred← citeshttps://doi.org/10.1109/tit.2019.2933520openalex-snapshot
Rank-Metric Codes Over Finite Principal Ideal Rings and Applications
inferred← citeshttps://doi.org/10.1109/tit.2022.3140678openalex-snapshot
A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed–Solomon Codes
inferred← citeshttps://doi.org/10.1109/tit.2023.3263185openalex-snapshot
Fast Syndrome-Based Chase Decoding of Binary BCH Codes Through Wu List Decoding
inferred← citeshttps://doi.org/10.1142/9789812794017_0003openalex-snapshot
The Key Equation for One-Point 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/s0219498813500345openalex-snapshot
APPLYING BUCHBERGER'S CRITERIA FOR COMPUTING GRÖBNER BASES OVER FINITE-CHAIN RINGS
inferred← citeshttps://doi.org/10.13069/jacodesmath.369863openalex-snapshot
A module minimization approach to Gabidulin decoding via interpolation
inferred← citeshttps://doi.org/10.14317/jami.2014.083openalex-snapshot
UNIQUE DECODING OF PLANE AG CODES REVISITED
inferred← citeshttps://doi.org/10.3934/amc.2010.4.485openalex-snapshot
Efficient list decoding of a class of algebraic-geometry codes
inferred← citeshttps://doi.org/10.3934/amc.2018005openalex-snapshot
Power decoding Reed-Solomon codes up to the Johnson radius
inferred← citeshttps://doi.org/10.48550/arxiv.1102.3604openalex-snapshot
Algebraic Decoding of Negacyclic Codes Over Z_4
inferred← citeshttps://doi.org/10.48550/arxiv.1103.3176openalex-snapshot
Fitzpatrick Algorithm for Multivariate Rational Interpolation
inferred← citeshttps://doi.org/10.48550/arxiv.1301.6529openalex-snapshot
Generalised Multi-sequence Shift-Register Synthesis using Module Minimisation
inferred← citeshttps://doi.org/10.48550/arxiv.1408.2303openalex-snapshot
Gabidulin Decoding via Minimal Bases of Linearized Polynomial Modules
inferred← citeshttps://doi.org/10.48550/arxiv.1505.02111openalex-snapshot
Power Decoding Reed--Solomon Codes Up to the Johnson Radius
inferred← citeshttps://doi.org/10.48550/arxiv.2008.01796openalex-snapshot
A Groebner-bases approach to syndrome-based fast Chase decoding of Reed--Solomon codes
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702118openalex-snapshot
Interpolation-based Decoding of Alternant 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.5281/zenodo.171354openalex-snapshot
FIGURE 2 in Gynocladius scalpellosus n. gen., n. sp. from Brazil (Diptera: Chironomidae: Orthocladiinae)
inferred← citeshttps://doi.org/10.70675/d8ca44b8zb45cz479az80a3zd34deb5c4454openalex-snapshot
Bases of relations in one or several variables : fast algorithms and applications
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.