On the public citation graph

An optimal ternary [69, 5, 45] code and related codes

0 signed · 29 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/bf00124893openalex-snapshot
Optimal ternary linear codes
inferredcites →https://doi.org/10.1007/bf00141966openalex-snapshot
On the construction of [q 4 + q 2 ? q, 5,q 4 ? q 3 + q 2 ? 2q; q]-codes meeting the Griesmer bound
inferredcites →https://doi.org/10.1007/bfb0087992openalex-snapshot
On a characterization of some minihypers in PG(t,q) (q=3 or 4) and its applications to error-correcting codes
inferredcites →https://doi.org/10.1093/oso/9780198502951.001.0001openalex-snapshot
Projective Geometries over Finite Fields
inferredcites →https://doi.org/10.1112/blms/13.2.179openalex-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.1006/ffta.1995.1036openalex-snapshot
Construction of Some Optimal Ternary Linear Codes and the Uniqueness of [294, 6, 195; 3]-Codes Meeting the Griesmer Bound
inferred← citeshttps://doi.org/10.1007/s00022-010-0041-3openalex-snapshot
On the non-existence of a projective (75, 4,12, 5) set in PG(3, 7)
inferred← citeshttps://doi.org/10.1007/s10623-011-9593-yopenalex-snapshot
On the minimum length of ternary linear codes
inferred← citeshttps://doi.org/10.1016/0378-3758(95)00126-3openalex-snapshot
The nonexistence of [71,5,46;3]-codes
inferred← citeshttps://doi.org/10.1016/j.disc.2004.06.002openalex-snapshot
The nonexistence of ternary [105,6,68] and [230,6,152] codes
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.044openalex-snapshot
On optimal non-projective ternary linear codes
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112572openalex-snapshot
Nonexistence of some ternary linear codes
inferred← citeshttps://doi.org/10.1016/s0378-3758(96)00013-4openalex-snapshot
The uniqueness of [87,5,57; 3]-codes and the nonexistence of [258,6,171; 3]-codes
inferred← citeshttps://doi.org/10.1016/s0378-3758(96)00014-6openalex-snapshot
A characterization of some {3v2 + v3, 3v1 + v2; 3, 3}-minihypers and some [15, 4, 9; 3]-codes with B2 = 0
inferred← citeshttps://doi.org/10.1023/a:1008215724132openalex-snapshot
Some New Optimal Ternary Linear Codes
inferred← citeshttps://doi.org/10.1023/a:1008278312966openalex-snapshot
The Nonexistence of Ternary [38, 6, 23] Codes
inferred← citeshttps://doi.org/10.1023/a:1008288219580openalex-snapshot
inferred← citeshttps://doi.org/10.1023/a:1008292320488openalex-snapshot
Classification of Some Optimal Ternary Linear Codes of Small Length
inferred← citeshttps://doi.org/10.1023/a:1008294128110openalex-snapshot
The Correspondence Between Projective Codes and 2-weight Codes
inferred← citeshttps://doi.org/10.1023/a:1008317124941openalex-snapshot
The Nonexistence of Some Optimal Ternary Codes of Dimension Five
inferred← citeshttps://doi.org/10.1023/a:1008369924325openalex-snapshot
inferred← citeshttps://doi.org/10.1023/b:prit.0000043927.19508.8bopenalex-snapshot
The Nonexistence of Ternary [284, 6, 188] Codes
inferred← citeshttps://doi.org/10.1109/18.641576openalex-snapshot
On the [162,8,80] codes
inferred← citeshttps://doi.org/10.1109/18.992814openalex-snapshot
Some new results for optimal ternary linear codes
inferred← citeshttps://doi.org/10.1109/isit.1997.613169openalex-snapshot
Linear codes and the two-way chain condition
inferred← citeshttps://doi.org/10.13069/jacodesmath.935947openalex-snapshot
On optimal linear codes of dimension 4
inferred← citeshttps://doi.org/10.3934/amc.2011.5.505openalex-snapshot
On optimal ternary linear codes of dimension 6
inferred← citeshttps://doi.org/10.3934/amc.2021052openalex-snapshot
Nonexistence of some ternary linear codes with minimum weight -2 modulo 9
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.