On the public citation graph

Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities

0 signed · 23 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.1007/978-1-84800-273-9_9openalex-snapshot
Algebraic coding theory
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.1983.1056753openalex-snapshot
Two topics on linear unequal error protection codes: Bounds on their length and cyclic code classes
inferredcites →https://doi.org/10.1109/tit.1986.1057134openalex-snapshot
On the minimum distance of cyclic codes
inferredcites →https://doi.org/10.1142/9407openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.2307/2003832openalex-snapshot
Error-Correcting 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-77224-8_39openalex-snapshot
Extended Norm-Trace Codes with Optimized Correction Capability
inferred← citeshttps://doi.org/10.1007/978-3-642-17625-8_24openalex-snapshot
A Very Low Cost BCH Decoder for High Immunity of On-Chip Memories
inferred← citeshttps://doi.org/10.1109/18.104340openalex-snapshot
Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations
inferred← citeshttps://doi.org/10.1109/18.119709openalex-snapshot
On error-and-erasure decoding of cyclic codes
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1109/18.333854openalex-snapshot
A new procedure for decoding cyclic and BCH codes up to actual minimum distance
inferred← citeshttps://doi.org/10.1109/18.333885openalex-snapshot
Use of Grobner bases to decode binary cyclic codes up to the true minimum distance
inferred← citeshttps://doi.org/10.1109/18.335964openalex-snapshot
Error-locating pairs for cyclic codes
inferred← citeshttps://doi.org/10.1109/18.57215openalex-snapshot
Error-erasure decoding of binary cyclic codes, up to a particular instance of the Hartmann-Tzeng bound
inferred← citeshttps://doi.org/10.1109/18.681342openalex-snapshot
Error control coding for the N-user mod-2 multiple-access channel
inferred← citeshttps://doi.org/10.1109/18.86974openalex-snapshot
Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm
inferred← citeshttps://doi.org/10.1109/26.192400openalex-snapshot
Decoding binary two-error correcting cyclic codes with Zech logarithms
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/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.4213/dm446openalex-snapshot
Алгоритм Берлекэмпа - Месси над конечными кольцами, модулями и бимодулями
inferred← citeshttps://doi.org/10.6100/ir399251openalex-snapshot
Decoding codes from curves and 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.