On the public citation graph

Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes

0 signed · 29 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.1016/s0019-9958(75)90090-xopenalex-snapshot
A method for solving key equation for decoding goppa codes
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
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.1587/essfr.1.3_44openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.7907/bjd1-9j44openalex-snapshot
Bit-Serial Reed Solomon Decoders in VLSI

What points at this work

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

inferred← citeshttps://doi.org/10.1002/ecjc.4430790607openalex-snapshot
A statistical decoding of simultaneous burst and random errors beyond the BCH bound using reed‐solomon codes
inferred← citeshttps://doi.org/10.1002/sat.4600120402openalex-snapshot
On the performance and complexity of A generalized minimum distance reed–solomon decoding algorithm
inferred← citeshttps://doi.org/10.1007/bf01196623openalex-snapshot
Two new decoding algorithms for Reed-Solomon codes
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.1109/18.490539openalex-snapshot
Bounded distance+1 soft-decision Reed-Solomon decoding
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.850696openalex-snapshot
A class of Sudan-decodable codes
inferred← citeshttps://doi.org/10.1109/18.850697openalex-snapshot
On the minimal interpolation problem and decoding RS codes
inferred← citeshttps://doi.org/10.1109/18.904511openalex-snapshot
On algebraic soft-decision decoding algorithms for BCH codes
inferred← citeshttps://doi.org/10.1109/cisp-bmei68103.2025.11259391openalex-snapshot
A Fast Encoding Algorithm for Nonbinary BCH Codes via Natural Table Construction
inferred← citeshttps://doi.org/10.1109/isita.2008.4895443openalex-snapshot
The error locator polynomial for correctable (t + 1)-error of RS codes
inferred← citeshttps://doi.org/10.1109/lcomm.2009.091129openalex-snapshot
On cauchy matrices for remainder decoding of reed-solomon codes
inferred← citeshttps://doi.org/10.1109/milcom.2000.904982openalex-snapshot
Soft decision decoding of Reed-Solomon codes using the extended erasure magnitude matrix
inferred← citeshttps://doi.org/10.1109/tcomm.2009.06.080080openalex-snapshot
Simplified procedure for decoding nonsystematic reed-solomon codes over gf(2m) using euclid's algorithm and the fast fourier transform
inferred← citeshttps://doi.org/10.1109/tcomm.2011.050211.100170openalex-snapshot
A Future Simplification of Procedure for Decoding Nonsystematic Reed-Solomon Codes Using the Berlekamp-Massey Algorithm
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/tencon.2007.4428962openalex-snapshot
Simplified procedure for decoding reed-solomon codes using Euclid’s algorithm and the fast fourier transform over GF(2m)
inferred← citeshttps://doi.org/10.1109/tit.2004.825002openalex-snapshot
Generalized Rational Interpolation Over Commutative Rings and Remainder Decoding
inferred← citeshttps://doi.org/10.1109/tit.2004.839520openalex-snapshot
On the Equivalence of Two Welch–Berlekamp Key Equations and Their Error Evaluators
inferred← citeshttps://doi.org/10.1109/tit.2004.842738openalex-snapshot
A Simple Algorithm for Decoding Reed–Solomon Codes and its Relation to the Welch–Berlekamp Algorithm
inferred← citeshttps://doi.org/10.1142/9789812794017_0003openalex-snapshot
The Key Equation for One-Point Codes
inferred← citeshttps://doi.org/10.1201/b15006-22openalex-snapshot
Cryptography
inferred← citeshttps://doi.org/10.48550/arxiv.1002.1191openalex-snapshot
Unidirectional Error Correcting Codes for Memory Systems: A Comparative Study
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.