On the public citation graph
Some improvements to the extendability of ternary linear codes
0 signed · 20 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/ffta.2001.0296openalex-snapshot
On the Extendability of Linear Codes
inferredcites →https://doi.org/10.1007/s10623-005-6400-7openalex-snapshot
Extendability of Ternary Linear Codes
inferredcites →https://doi.org/10.1016/j.ffa.2004.02.001openalex-snapshot
A new extension theorem for linear codes
inferredcites →https://doi.org/10.1016/s0012-365x(02)00820-8openalex-snapshot
Extendability of linear codes over GF(q) with minimum distance d, gcd(d,q)=1
inferredcites →https://doi.org/10.1023/a:1008292320488openalex-snapshot
Classification of Some Optimal Ternary Linear Codes of Small Length
inferredcites →https://doi.org/10.1023/a:1008319024396openalex-snapshot
An Extension Theorem for Linear Codes
inferredcites →https://doi.org/10.1093/oso/9780198502951.001.0001openalex-snapshot
Projective Geometries over Finite Fields
inferredcites →https://doi.org/10.1112/s0024609399346154openalex-snapshot
PROJECTIVE GEOMETRIES OVER FINITE FIELDS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11779360_8openalex-snapshot
Geometric Conditions for the Extendability of Ternary Linear Codes
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-009-9275-1openalex-snapshot
A new extension theorem for 3-weight modulo q linear codes over $${\mathbb{F}_q}$$
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114080openalex-snapshot
The extended codes of projective two-weight codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2007.09.001openalex-snapshot
New sufficient conditions for the extendability of quaternary linear codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2008.09.003openalex-snapshot
Extendability of 3-weight (mod q) linear codes over Fq
inferred← citeshttps://doi.org/10.1016/j.ffa.2024.102401openalex-snapshot
The extended codes of some linear codes
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.2008.2.331-348openalex-snapshot
Necessary and Sufficient Conditions for the Extendability of Ternary Linear 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.