On the public citation graph
Inclusion Matrices and the MDS Conjecture
0 signed · 27 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.1002/jcd.20091openalex-snapshot
Types of superregular matrices and the number ofn‐arcs and completen‐arcs in PG (r, q)
inferredcites →https://doi.org/10.1006/ffta.1996.0017openalex-snapshot
On the Embedding of an Arc into a Conic in a Finite Plane
inferredcites →https://doi.org/10.1007/978-1-4613-0283-4_13openalex-snapshot
The Packing Problem in Statistics, Coding Theory and Finite Projective Spaces: Update 2001
inferredcites →https://doi.org/10.1007/bf00147548openalex-snapshot
Orbits of arcs in PG(N, K) under projectivities
inferredcites →https://doi.org/10.1007/bf02410779openalex-snapshot
Curve razionali normali ek-archi negli spazi finiti
inferredcites →https://doi.org/10.1007/s10623-012-9658-6openalex-snapshot
On sets of vectors of a finite vector space in which every subset of basis size is a basis II
inferredcites →https://doi.org/10.1007/s40879-017-0193-xopenalex-snapshot
Extending small arcs to large arcs
inferredcites →https://doi.org/10.1016/0097-3165(90)90007-jopenalex-snapshot
Intersection theorems and mod p rank of inclusion matrices
inferredcites →https://doi.org/10.1016/s0195-6698(13)80046-7openalex-snapshot
A Diagonal Form for the Incidence Matrices of t-Subsets vs.k-Subsets
inferredcites →https://doi.org/10.1017/s0305004100077823openalex-snapshot
An elementary proof and an extension of Thas' theorem on k-arcs
inferredcites →https://doi.org/10.1109/isit.2006.261582openalex-snapshot
What's New and Exciting in Algebraic and Combinatorial Coding Theory?
inferredcites →https://doi.org/10.1109/tit.1986.1057188openalex-snapshot
On MDS extensions of generalized Reed- Solomon codes
inferredcites →https://doi.org/10.1214/aoms/1177729387openalex-snapshot
Orthogonal Arrays of Index Unity
inferredcites →https://doi.org/10.2307/2369364openalex-snapshot
Sur l'Analyse Indeterminee du Troisieme Degre.-Demonstration de Plusieurs Theoremes de M. Sylvester
inferredcites →https://doi.org/10.4171/jems/316openalex-snapshot
On sets of vectors of a finite vector space in which every subset of basis size is a basis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s40879-017-0193-xopenalex-snapshot
Extending small arcs to large arcs
inferred← citeshttps://doi.org/10.1080/03081087.2017.1419456openalex-snapshot
Nonstandard rank-one nonincreasing maps on symmetric matrices
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619357openalex-snapshot
Flexible Field Sizes in Secure Distributed Matrix Multiplication via Efficient Interference Cancellation
inferred← citeshttps://doi.org/10.1109/tit.2017.2671344openalex-snapshot
On Subsets of the Normal Rational Curve
inferred← citeshttps://doi.org/10.1109/tit.2019.2956144openalex-snapshot
Maximizing Multivariate Information With Error-Correcting Codes
inferred← citeshttps://doi.org/10.1134/s0032946018020011openalex-snapshot
On the Smallest Size of an Almost Complete Subset of a Conic in PG(2, q) and Extendability of Reed–Solomon Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1603.06714openalex-snapshot
On subsets of the normal rational curve
inferred← citeshttps://doi.org/10.48550/arxiv.1609.05657openalex-snapshot
On Almost Complete Subsets of a Conic in $\mathrm{PG}(2,q)$, Completeness of Normal Rational Curves and Extendability of Reed-Solomon 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.