On the public citation graph

NMDS codes of maximal length over F/sub q/,8≤q≤11

0 signed · 40 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/978-1-4471-6790-7openalex-snapshot
General Galois Geometries
inferredcites →https://doi.org/10.1007/bf00124590openalex-snapshot
Almost MDS Codes
inferredcites →https://doi.org/10.1007/bf01222850openalex-snapshot
On near-MDS codes
inferredcites →https://doi.org/10.1016/s0012-365x(96)00319-6openalex-snapshot
Classical arcs in PG(r, q) for 11 ⩽ q ⩽ 19
inferredcites →https://doi.org/10.1016/s0012-365x(99)00168-5openalex-snapshot
Near-MDS codes over some small fields
inferredcites →https://doi.org/10.1016/s0012-365x(99)00202-2openalex-snapshot
Maximal (n,3)-arcs in PG(2,11)
inferredcites →https://doi.org/10.1016/s0378-3758(98)00043-3openalex-snapshot
The packing problem in statistics, coding theory and finite projective spaces
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1023/a:1008247720662openalex-snapshot
Codes of Small Defect
inferredcites →https://doi.org/10.1023/a:1024763410967openalex-snapshot
Some New Results on Optimal Codes Over F5
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.1112/blms/25.2.199openalex-snapshot
General Galois Geometries
inferredcites →https://doi.org/10.1112/jlms/54.3.581openalex-snapshot
Multiple Blocking Sets and Arcs in Finite Planes
inferredcites →https://doi.org/10.1214/aoms/1177729331openalex-snapshot
Orthogonal Arrays of Strength two and three

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-72284-5_13openalex-snapshot
The Mathematical Aspects of Some Problems from Coding Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-62392-4_50openalex-snapshot
Analysis of Tweets to Find the Basis of Popularity
inferred← citeshttps://doi.org/10.1007/s10623-007-9144-8openalex-snapshot
Elliptic near-MDS codes over $${\mathbb{F}}_5$$
inferred← citeshttps://doi.org/10.1007/s10623-013-9837-0openalex-snapshot
The non-existence of some NMDS codes and the extremal sizes of complete $$(n,3)$$ ( n , 3 ) -arcs in $$PG(2,16)$$ PG ( 2 , 16 )
inferred← citeshttps://doi.org/10.1007/s10623-022-01099-zopenalex-snapshot
The minimum locality of linear codes
inferred← citeshttps://doi.org/10.1007/s10623-023-01313-6openalex-snapshot
New classes of NMDS codes with dimension 3
inferred← citeshttps://doi.org/10.1007/s10773-024-05761-1openalex-snapshot
On the Construction of Hermitian Self-Orthogonal Codes Over $$F_9$$ and Their Application
inferred← citeshttps://doi.org/10.1007/s11356-022-19556-6openalex-snapshot
Investigating the effects of environment, corrosion degree, and distribution of corrosive microbial communities on service-life of refined oil pipelines
inferred← citeshttps://doi.org/10.1007/s11356-022-23803-1openalex-snapshot
Neglected skin-associated microbial communities: a unique immune defense strategy of Bufo raddei under environmental heavy metal pollution
inferred← citeshttps://doi.org/10.1007/s11424-012-0041-5openalex-snapshot
NNMDS codes
inferred← citeshttps://doi.org/10.1016/j.disc.2004.05.021openalex-snapshot
Near-MDS codes arising from algebraic curves
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113490openalex-snapshot
Near MDS codes of non-elliptic-curve type from Reed-Solomon codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2006.09.007openalex-snapshot
On the completeness of certain n-tracks arising from elliptic curves
inferred← citeshttps://doi.org/10.1016/j.ffa.2013.05.008openalex-snapshot
Quasi-cyclic NMDS codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2023.102338openalex-snapshot
Near-MDS codes from maximal arcs in PG(2,q)
inferred← citeshttps://doi.org/10.1016/j.ffa.2024.102495openalex-snapshot
Four new families of NMDS codes with dimension 4 and their applications
inferred← citeshttps://doi.org/10.1016/j.ffa.2026.102844openalex-snapshot
The extended codes of NMDS codes
inferred← citeshttps://doi.org/10.1108/ijwis-12-2016-0069openalex-snapshot
Sentiment Extraction and Classification for the Analysis of Users Interest in Tweets
inferred← citeshttps://doi.org/10.1109/tit.2005.855607openalex-snapshot
A Family of Highly Symmetric Codes
inferred← citeshttps://doi.org/10.1109/tit.2023.3272384openalex-snapshot
Roth–Lempel NMDS Codes of Non-Elliptic-Curve Type
inferred← citeshttps://doi.org/10.1109/tit.2023.3342216openalex-snapshot
The Extended Codes of a Family of Reversible MDS Cyclic codes
inferred← citeshttps://doi.org/10.1109/tit.2023.3346179openalex-snapshot
Generalized Singleton Type Upper Bounds
inferred← citeshttps://doi.org/10.11575/cdm.v1i1.61901.g46639openalex-snapshot
Classification of linear codes exploiting an invariant
inferred← citeshttps://doi.org/10.23919/cje.2014.10851235openalex-snapshot
On l-th NMDS Codes∗
inferred← citeshttps://doi.org/10.48550/arxiv.1609.04602openalex-snapshot
New MDS or near MDS self-dual codes over finite fields
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.