On the public citation graph
On M.D.S. codes, arcs inPG(n, q) withq even, and a solution of three fundamental problems of B. Segre
0 signed · 61 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.1007/bf00147659openalex-snapshot
The solution to Beniamino Segre's problem I r,q , r=3, q=2 h
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.1007/bf02410779openalex-snapshot
Curve razionali normali ek-archi negli spazi finiti
inferredcites →https://doi.org/10.1016/0012-365x(84)90180-8openalex-snapshot
On the uniqueness of (q + 1)4-arcs of PG(4, q), q = 2h, h ⩾ 3
inferredcites →https://doi.org/10.1016/0012-365x(86)90067-1openalex-snapshot
The non-classical 10-arc of PG(4, 9)
inferredcites →https://doi.org/10.1016/0021-8693(87)90007-xopenalex-snapshot
Complete arcs and algebraic curves in PG(2, q)
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.1093/oso/9780198502951.001.0001openalex-snapshot
Projective Geometries over Finite Fields
inferredcites →https://doi.org/10.1109/tit.1964.1053661openalex-snapshot
Maximum distanceq-nary codes
inferredcites →https://doi.org/10.1109/tit.1986.1057188openalex-snapshot
On MDS extensions of generalized Reed- Solomon codes
inferredcites →https://doi.org/10.1112/blms/13.2.179openalex-snapshot
PROJECTIVE GEOMETRIES OVER FINITE FIELDS
inferredcites →https://doi.org/10.1214/aoms/1177729387openalex-snapshot
Orthogonal Arrays of Index Unity
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119582397.ch22openalex-snapshot
Reed‐Solomon and MDS Codes, and the Main Linear Coding Theory Problem (LCTP)
inferred← citeshttps://doi.org/10.1002/jgt.22042openalex-snapshot
On the Number of k‐Dominating Independent Sets
inferred← citeshttps://doi.org/10.1006/ffta.2000.0299openalex-snapshot
Hyperplane Sections of Grassmannians and the Number of MDS Linear Codes
inferred← citeshttps://doi.org/10.1007/3-540-54522-0_92openalex-snapshot
On the parameters of algebraic geometric codes
inferred← citeshttps://doi.org/10.1007/bf00147336openalex-snapshot
Arcs in PG(n, q), MDS-codes and three fundamental problems of B. Segre ? Some extensions
inferred← citeshttps://doi.org/10.1007/bfb0088004openalex-snapshot
Linear codes, strata of Grassmannians, and the problems of segre
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-009-9293-zopenalex-snapshot
On the maximality of linear codes
inferred← citeshttps://doi.org/10.1007/s10623-014-9989-6openalex-snapshot
Bent vectorial functions and linear codes from o-polynomials
inferred← citeshttps://doi.org/10.1007/s10623-021-00907-2openalex-snapshot
Diagonal groups and arcs over groups
inferred← citeshttps://doi.org/10.1007/s10623-022-01072-wopenalex-snapshot
Contributions by Aart Blokhuis to finite geometry, discrete mathematics, and combinatorics
inferred← citeshttps://doi.org/10.1007/s10801-013-0475-4openalex-snapshot
A construction for infinite families of semisymmetric graphs revealing their full automorphism group
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90576-2openalex-snapshot
Complete k-arcs in PG(n, q), q even
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90256-9openalex-snapshot
On the covering radius of Reed—Solomon codes
inferred← citeshttps://doi.org/10.1016/0097-3165(92)90035-sopenalex-snapshot
Polynomial multiplicities over finite fields and intersection sets
inferred← citeshttps://doi.org/10.1016/0097-3165(93)90076-kopenalex-snapshot
M.D.S. codes and arcs in PG(n, q) with q even: An improvement of the bounds of Bruen, Thas, and Blokhuis
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50015-4openalex-snapshot
10.1016/b978-044488002-4/50015-4
inferred← citeshttps://doi.org/10.1016/b978-044488355-1/50009-8openalex-snapshot
Projective Geometry over a Finite Field
inferred← citeshttps://doi.org/10.1016/j.endm.2017.07.053openalex-snapshot
Generalizing Erdős, Moon and Moser's result — The number of k-dominating independent sets
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.10.006openalex-snapshot
Open problems in finite projective spaces
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.1016/j.jcta.2022.105658openalex-snapshot
Linear cutting blocking sets and minimal codes in the rank metric
inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80125-4openalex-snapshot
Some Optimal Codes from Algebraic Geometry and Their Covering Radii
inferred← citeshttps://doi.org/10.1017/cbo9781316257449openalex-snapshot
Finite Geometry and Combinatorial Applications
inferred← citeshttps://doi.org/10.1017/s0305004100070146openalex-snapshot
On the uniqueness of (q + 1)-arcs of PG (5, q), q = 2h, h ≥ 4
inferred← citeshttps://doi.org/10.1080/09720529.2006.10698064openalex-snapshot
Some generalizations of Rédei’s theorem
inferred← citeshttps://doi.org/10.1093/imrn/rnad271openalex-snapshot
The Maximal Length of q -ary MDS Elliptic Codes Is Close to
inferred← citeshttps://doi.org/10.1109/tit.2019.2957354openalex-snapshot
New Lower Bounds for Permutation Codes Using Linear Block Codes
inferred← citeshttps://doi.org/10.1109/tit.2020.2977319openalex-snapshot
On the Weights of General MDS Codes
inferred← citeshttps://doi.org/10.1109/tit.2023.3346179openalex-snapshot
Generalized Singleton Type Upper Bounds
inferred← citeshttps://doi.org/10.1360/ssm-2023-0118openalex-snapshot
The deep hole 问题 of generalized Reed-Solomon codes
inferred← citeshttps://doi.org/10.3390/math13091489openalex-snapshot
Arcs, Caps and Generalisations in a Finite Projective Space
inferred← citeshttps://doi.org/10.3934/amc.2018039openalex-snapshot
On the dual codes of skew constacyclic codes
inferred← citeshttps://doi.org/10.3934/amc.2025052openalex-snapshot
Super-exponentially many NMDS codes arising from regular hyperovals
inferred← citeshttps://doi.org/10.48550/arxiv.1604.03617openalex-snapshot
A note on the duals of skew constacyclic 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.