On the public citation graph
On the non-existence of linear codes attaining the Griesmer bound
0 signed · 15 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/0012-365x(93)90404-hopenalex-snapshot
A characterization of some [n,k,d;q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
inferredcites →https://doi.org/10.1016/0012-365x(94)90160-0openalex-snapshot
Optimal linear codes over GF(4)
inferredcites →https://doi.org/10.1093/oso/9780198502951.001.0001openalex-snapshot
Projective Geometries over Finite Fields
inferredcites →https://doi.org/10.1112/blms/18.2.97openalex-snapshot
The Geometry of Two-Weight 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-003-4191-2openalex-snapshot
On the Minimum Size of Some Minihypers and Related Linear Codes
inferred← citeshttps://doi.org/10.1007/s10623-004-1720-6openalex-snapshot
Nonexistence of [n, 5, d]q Codes Attaining the Griesmer Bound for q4 −2q2 −2q+1 ≤ d≤ q4−2q2 −q
inferred← citeshttps://doi.org/10.1007/s10623-018-0565-3openalex-snapshot
Linear codes close to the Griesmer bound and the related geometric structures
inferred← citeshttps://doi.org/10.1007/s12095-022-00618-yopenalex-snapshot
New upper bounds and constructions of multi-erasure locally recoverable codes
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00088-6openalex-snapshot
On the minimum length of q-ary linear codes of dimension four
inferred← citeshttps://doi.org/10.1023/a:1004901203236openalex-snapshot
On the Minimum Length of q-ary Linear Codes of Dimension Five
inferred← citeshttps://doi.org/10.1023/a:1005076729296openalex-snapshot
A Characterization of Some Minihypers and its Application to Linear Codes
inferred← citeshttps://doi.org/10.1023/a:1008317022638openalex-snapshot
On the Nonexistence of q-ary Linear Codes of Dimension Five
inferred← citeshttps://doi.org/10.1109/18.567723openalex-snapshot
Optimal linear codes of dimension 4 over F/sub 5/
inferred← citeshttps://doi.org/10.1109/tit.2016.2553142openalex-snapshot
On Optimal Nonlinear Systematic 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.