On the public citation graph
A class of Sudan-decodable codes
0 signed · 27 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.1007/3-540-46796-3_26openalex-snapshot
Decoding Hermitian Codes with Sudan’s Algorithm
inferredcites →https://doi.org/10.1007/978-3-540-76878-4openalex-snapshot
Algebraic Function Fields and Codes
inferredcites →https://doi.org/10.1109/18.165455openalex-snapshot
Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes
inferredcites →https://doi.org/10.1109/18.476248openalex-snapshot
Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
inferredcites →https://doi.org/10.1109/18.782097openalex-snapshot
Improved decoding of Reed-Solomon and algebraic-geometry codes
inferredcites →https://doi.org/10.1109/9780470546345openalex-snapshot
Reed-Solomon Codes and Their Applications
inferredcites →https://doi.org/10.1109/sfcs.1998.743426openalex-snapshot
Improved decoding of Reed-Solomon and algebraic-geometric 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/s10623-006-9019-4openalex-snapshot
On universally decodable matrices for space–time coding
inferred← citeshttps://doi.org/10.1016/j.disc.2007.01.005openalex-snapshot
On Rosenbloom and Tsfasman's generalization of the Hamming space
inferred← citeshttps://doi.org/10.1016/j.disc.2013.11.001openalex-snapshot
Linear codes on posets with extension property
inferred← citeshttps://doi.org/10.1016/j.jco.2003.08.020openalex-snapshot
Noisy Chinese remaindering in the Lee norm
inferred← citeshttps://doi.org/10.1090/conm/523/10320openalex-snapshot
Near MDS poset codes and distributions
inferred← citeshttps://doi.org/10.1109/allerton.2010.5706929openalex-snapshot
Linear ordered codes, shape enumarators and parallel channels
inferred← citeshttps://doi.org/10.1109/isit.2000.866402openalex-snapshot
A class of Sudan-decodable codes
inferred← citeshttps://doi.org/10.1109/isit.2007.4557247openalex-snapshot
Bounds on ordered codes and orthogonal arrays
inferred← citeshttps://doi.org/10.1109/isit.2010.5513736openalex-snapshot
Near MDS poset codes and distributions
inferred← citeshttps://doi.org/10.1109/isit.2011.6033968openalex-snapshot
The ordered Hamming metric and ordered symmetric channels
inferred← citeshttps://doi.org/10.1109/tit.2003.822593openalex-snapshot
Reed–Solomon List Decoding From a System-Theoretic Perspective
inferred← citeshttps://doi.org/10.1109/tit.2004.839546openalex-snapshot
List Decoding of Generalized Reed–Solomon Codes Over Commutative Rings
inferred← citeshttps://doi.org/10.1109/tit.2004.840901openalex-snapshot
Improved List Decoding of Generalized Reed–Solomon and Alternant Codes Over Galois Rings
inferred← citeshttps://doi.org/10.1109/tit.2007.899482openalex-snapshot
On the Existence of Universally Decodable Matrices
inferred← citeshttps://doi.org/10.1109/tit.2016.2617312openalex-snapshot
BCH Codes for the Rosenbloom–Tsfasman Metric
inferred← citeshttps://doi.org/10.1587/transfun.e96.a.1496openalex-snapshot
MacWilliams Type Identity for M-Spotty Rosenbloom-Tsfasman Weight Enumerator of Linear Codes over Finite Ring
inferred← citeshttps://doi.org/10.17323/1609-4514-2015-15-4-679-702openalex-snapshot
On Linear Ordered Codes
inferred← citeshttps://doi.org/10.3934/amc.2014.8.257openalex-snapshot
Higher genus universally decodable matrices (UDMG)
inferred← citeshttps://doi.org/10.3934/amc.2023061openalex-snapshot
Fractional decoding and the Rosenbloom-Tsfasman metric
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702033openalex-snapshot
Bounds on ordered codes and orthogonal arrays
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.