On the public citation graph
Ternary Linear Codes and Quadrics
0 signed · 25 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.1006/jcta.1997.2864openalex-snapshot
Divisibility of Codes Meeting the Griesmer Bound
inferredcites →https://doi.org/10.1007/11779360_8openalex-snapshot
Geometric Conditions for the Extendability of Ternary Linear Codes
inferredcites →https://doi.org/10.1007/s10623-005-6400-7openalex-snapshot
Extendability of Ternary Linear Codes
inferredcites →https://doi.org/10.1016/0012-365x(93)90404-hopenalex-snapshot
A characterization of some [n,k,d;q]-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
inferredcites →https://doi.org/10.1016/j.disc.2007.12.028openalex-snapshot
(l,s) -extension of linear codes
inferredcites →https://doi.org/10.1016/j.ffa.2005.09.005openalex-snapshot
Some improvements to the extendability of ternary linear codes
inferredcites →https://doi.org/10.1201/9781315139722-7openalex-snapshot
A survey of recent results on optimal linear codes
inferredcites →https://doi.org/10.48550/arxiv.cs/0701112openalex-snapshot
(l,s)-Extension of Linear Codes
inferredcites →https://doi.org/10.55630/sjc.2008.2.331-348openalex-snapshot
Necessary and Sufficient Conditions for the Extendability of Ternary Linear Codes
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-031-17292-2_12openalex-snapshot
On a Class of Minihypers in the Geometries $$\text {PG}(r,q)$$
inferred← citeshttps://doi.org/10.1007/s00022-011-0088-9openalex-snapshot
Extension theorems for linear codes over finite fields
inferred← citeshttps://doi.org/10.1007/s10623-011-9593-yopenalex-snapshot
On the minimum length of ternary linear codes
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112363openalex-snapshot
Badges and rainbow matchings
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112572openalex-snapshot
Nonexistence of some ternary linear codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2015.04.004openalex-snapshot
On the l-extendability of quaternary linear codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2018.04.002openalex-snapshot
On the 3-extendability of quaternary linear codes
inferred← citeshttps://doi.org/10.1142/s1793042118500100openalex-snapshot
Telescoping method and congruences for double sums
inferred← citeshttps://doi.org/10.14403/jcms.2013.26.1.147openalex-snapshot
DETERMINATION OF MINIMUM LENGTH OF SOME LINEAR CODES
inferred← citeshttps://doi.org/10.3934/amc.2011.5.505openalex-snapshot
On optimal ternary linear codes of dimension 6
inferred← citeshttps://doi.org/10.3934/amc.2021052openalex-snapshot
Nonexistence of some ternary linear codes with minimum weight -2 modulo 9
inferred← citeshttps://doi.org/10.55630/sjc.2011.5.117-128openalex-snapshot
The Nonexistence of [132, 6, 86]3 Codes and [135, 6, 88]3 Codes
inferred← citeshttps://doi.org/10.60063/gsu.fmi.109.91-98openalex-snapshot
Characterization of some minihypers in PG(4,3)
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.