On the public citation graph

On extendable planes, M.D.S. codes and hyperovals in PG(2, q), q=2 t

https://doi.org/10.1007/bf00147798
0 signed · 19 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/bf01214819openalex-snapshot
On the non-existence of certain M.D.S. codes and projective planes
inferredcites →https://doi.org/10.1016/0097-3165(71)90036-7openalex-snapshot
A combinatorial problem with applications to geometry
inferredcites →https://doi.org/10.1016/s0195-6698(83)80011-0openalex-snapshot
A Note on the Existence of Special Laguerre i-Structures and Optimal Codes
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1214/aoms/1177729387openalex-snapshot
Orthogonal Arrays of Index Unity
inferredcites →https://doi.org/10.4153/cjm-1960-014-0openalex-snapshot
A Metrization for Power-Sets with Applications to Combinatorial Analysis

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118033296.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9781119582397.ch23openalex-snapshot
MDS Codes, Secret Sharing, and Invariant Theory
inferred← citeshttps://doi.org/10.1002/9781119582397.refopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1006/ffta.2000.0294openalex-snapshot
Intersections of Hyperconics in Projective Planes of Even Order
inferred← citeshttps://doi.org/10.1007/bf01230354openalex-snapshot
Translation planes and derivation sets
inferred← citeshttps://doi.org/10.1007/s00026-005-0245-7openalex-snapshot
Extending MDS Codes
inferred← citeshttps://doi.org/10.1007/s00200-008-0058-0openalex-snapshot
Maximal AMDS codes
inferred← citeshttps://doi.org/10.1007/s10440-006-9051-4openalex-snapshot
Applications of Finite Fields to Combinatorics and Finite Geometries
inferred← citeshttps://doi.org/10.1007/s10623-004-5659-4openalex-snapshot
(6,3)-MDS Codes over an Alphabet of Size 4
inferred← citeshttps://doi.org/10.1007/s10623-007-9079-0openalex-snapshot
Coprimitive sets and inextendable codes
inferred← citeshttps://doi.org/10.1007/s12204-008-0491-zopenalex-snapshot
Codes from strongly regular (α, β)-reguli
inferred← citeshttps://doi.org/10.1016/j.jcta.2006.11.005openalex-snapshot
Maximum distance separable codes and arcs in projective spaces
inferred← citeshttps://doi.org/10.1080/09720529.2006.10698064openalex-snapshot
Some generalizations of Rédei’s theorem
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.