On the public citation graph
Comparison of Two Algorithms for Decoding Alternant Codes
0 signed · 20 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.1049/ip-e.1991.0040openalex-snapshot
VLSI design of inverse-free Berlekamp—Massey algorithm
inferredcites →https://doi.org/10.1109/tit.1969.1054260openalex-snapshot
Shift-register synthesis and BCH decoding
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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/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_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_3openalex-snapshot
The FGLM Problem and Möller’s Algorithm on Zero-dimensional Ideals
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/s40314-024-03057-yopenalex-snapshot
The impact of alternant codes over Eisenstein integers on modern technology
inferred← citeshttps://doi.org/10.1016/s0167-9260(98)00009-1openalex-snapshot
Comparison of the VLSI cost/performance properties of two Reed–Solomon decoding algorithms
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/isit.2000.866746openalex-snapshot
Grobner bases and alternant codes over Galois rings
inferred← citeshttps://doi.org/10.1109/miel.2002.1003332openalex-snapshot
Reed-Solomon codecs for optical communications
inferred← citeshttps://doi.org/10.1109/miel.2010.5490471openalex-snapshot
Comparative study of software vs. hardware implementations of shortened Reed-Solomon code for Wireless Body Area Networks
inferred← citeshttps://doi.org/10.1109/sensorcomm.2009.48openalex-snapshot
Implementation of Source and Channel Coding for Power Reduction in Medical Application Wireless Sensor Network
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.48550/arxiv.1001.1597openalex-snapshot
The Berlekamp-Massey Algorithm via Minimal Polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1108.4224openalex-snapshot
On Sequences with a Perfect Linear Complexity Profile
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.