On the public citation graph

On the non-existence of certain M.D.S. codes and projective planes

https://doi.org/10.1007/bf01214819
0 signed · 23 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/bf01221886openalex-snapshot
Self-orthogonal Steiner systems and projective planes
inferredcites →https://doi.org/10.1016/0021-8693(66)90024-xopenalex-snapshot
A vector-space packing problem
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/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-1949-009-2openalex-snapshot
The Nonexistence of Certain Finite Projective Planes
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.1007/978-1-4615-6654-0_13openalex-snapshot
Latin Squares, their Geometries and their Groups. A Survey
inferred← citeshttps://doi.org/10.1007/bf00147798openalex-snapshot
On extendable planes, M.D.S. codes and hyperovals in PG(2, q), q=2 t
inferred← citeshttps://doi.org/10.1007/bf01174331openalex-snapshot
Intersections in projective space I: Combinatorics
inferred← citeshttps://doi.org/10.1007/bf01393742openalex-snapshot
On M.D.S. codes, arcs inPG(n, q) withq even, and a solution of three fundamental problems of B. Segre
inferred← citeshttps://doi.org/10.1007/s00026-005-0245-7openalex-snapshot
Extending MDS Codes
inferred← citeshttps://doi.org/10.1007/s11741-009-0513-3openalex-snapshot
Note on maximal distance separable codes
inferred← citeshttps://doi.org/10.1016/0024-3795(87)90311-9openalex-snapshot
Permanents of d-dimensional matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90436-ropenalex-snapshot
Multidimensional stochastic matrices and error-correcting codes
inferred← citeshttps://doi.org/10.1016/b978-044488355-1/50009-8openalex-snapshot
Projective Geometry over a Finite Field
inferred← citeshttps://doi.org/10.1109/18.817524openalex-snapshot
MDR codes over Z/sub k/
inferred← citeshttps://doi.org/10.1109/tit.2020.2977319openalex-snapshot
On the Weights of General MDS Codes
inferred← citeshttps://doi.org/10.1201/b15006-22openalex-snapshot
Cryptography
inferred← citeshttps://doi.org/10.48550/arxiv.0904.4094openalex-snapshot
On the Upper Bounds of MDS 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.