On the public citation graph

On the construction of [q 4 + q 2 ? q, 5,q 4 ? q 3 + q 2 ? 2q; q]-codes meeting the Griesmer bound

0 signed · 24 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.1016/0012-365x(78)90120-6openalex-snapshot
Caps and codes
inferredcites →https://doi.org/10.1016/0012-365x(91)90214-mopenalex-snapshot
A characterization of {2vα+1 + 2vβ+1, 2vα + 2vβ; t, q}- minihypers in PG(t, q) (t ⩾ 2, q ⩾ 5 and 0 ⩽ α < β < t) and its applications to error-correcting codes
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/0097-3165(78)90027-4openalex-snapshot
On a geometrical method of construction of maximal t-linearly independent sets
inferredcites →https://doi.org/10.1016/s0019-9958(65)90080-xopenalex-snapshot
Algebraically punctured cyclic codes
inferredcites →https://doi.org/10.1016/s0195-6698(13)80039-xopenalex-snapshot
A Characterization of Some Minihypers in a Finite Projective Geometry PG(t, 4)
inferredcites →https://doi.org/10.1147/rd.45.0532openalex-snapshot
A Bound for 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.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/978-3-031-52969-6_35openalex-snapshot
Resolution of a Conjecture on the Covering Radius of Linear Codes
inferred← citeshttps://doi.org/10.1007/bf01388456openalex-snapshot
An optimal ternary [69, 5, 45] code and related codes
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00104-5openalex-snapshot
New bounds for the minimum length of quaternary linear codes of dimension five
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.1016/s0378-3758(02)00230-6openalex-snapshot
The nonexistence of ternary [97,6,63] 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.1016/s0378-3758(96)00015-8openalex-snapshot
A characterization of some {3v1 + v3, 3v0 + v2; 3, 3}-minihypers and its applications to error-correcting codes
inferred← citeshttps://doi.org/10.1016/s0378-3758(98)00039-1openalex-snapshot
On the nonexistence of some quaternary linear codes meeting the Griesmer bound
inferred← citeshttps://doi.org/10.1016/s0378-3758(98)00040-8openalex-snapshot
The nonexistence of ternary [79,6,51] codes
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: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:1008317124941openalex-snapshot
The Nonexistence of Some Optimal Ternary Codes of Dimension Five
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.