On the public citation graph
On error-and-erasure decoding of cyclic codes
0 signed · 19 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.1016/s0019-9958(72)90887-xopenalex-snapshot
Generalizations of the BCH bound
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.21263openalex-snapshot
Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities
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.57215openalex-snapshot
Error-erasure decoding of binary cyclic codes, up to a particular instance of the Hartmann-Tzeng bound
inferredcites →https://doi.org/10.1109/tcom.1976.1093307openalex-snapshot
Multisequence Linear Shift Register Synthesis and Its Application to BCH Decoding
inferredcites →https://doi.org/10.1109/tit.1974.1055178openalex-snapshot
Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf00124591openalex-snapshot
The new minimum distance bounds of Goppa codes and their decoding
inferred← citeshttps://doi.org/10.1109/18.476320openalex-snapshot
A code decomposition approach for decoding cyclic and algebraic-geometric codes
inferred← citeshttps://doi.org/10.1109/18.556690openalex-snapshot
A bounded-distance decoding algorithm for binary linear block codes achieving the minimum effective error coefficient
inferred← citeshttps://doi.org/10.1109/icassp.1992.226663openalex-snapshot
DFT, convolution and error correcting codes
inferred← citeshttps://doi.org/10.1109/isit.1991.695148openalex-snapshot
On Error-and-erasure Decoding Of Cyclic Codes Up To The Roos Bound
inferred← citeshttps://doi.org/10.1109/isit.1995.550398openalex-snapshot
Error and erasure decoding of binary cyclic code up to actual minimum distance
inferred← citeshttps://doi.org/10.1109/isit.2012.6284053openalex-snapshot
Decoding of cyclic codes over symbol-pair read channels
inferred← citeshttps://doi.org/10.1109/tcomm.2003.814212openalex-snapshot
An efficient hybrid decoding algorithm for reed-solomon codes based on bit reliability
inferred← citeshttps://doi.org/10.1109/tit.2016.2522434openalex-snapshot
Constructions and Decoding of Cyclic Codes Over $b$ -Symbol Read Channels
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
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.