On the public citation graph

On the Extendability of Linear Codes

0 signed · 33 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.1002/9781118032749openalex-snapshot
Introduction to the Theory of Error‐Correcting Codes
inferredcites →https://doi.org/10.1016/0378-4754(82)90042-8openalex-snapshot
Introduction to the theory of error-correcting codes
inferredcites →https://doi.org/10.1016/s0012-365x(98)00354-9openalex-snapshot
On the minimum length of quaternary linear codes of dimension five
inferredcites →https://doi.org/10.1023/a:1008250010928openalex-snapshot
On the Achievement of the Griesmer Bound
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.1109/isit.1995.550332openalex-snapshot
Extensions of 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/11779360_8openalex-snapshot
Geometric Conditions for the Extendability of Ternary Linear Codes
inferred← citeshttps://doi.org/10.1007/978-1-4614-0709-6_15openalex-snapshot
The Use of Blocking Sets in Galois Geometries and in Related Research Areas
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-005-6400-7openalex-snapshot
Extendability of Ternary Linear Codes
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.1007/s10623-011-9497-xopenalex-snapshot
A generalized extension theorem for linear codes
inferred← citeshttps://doi.org/10.1007/s10623-015-0114-2openalex-snapshot
On the extendability of quasidivisible Griesmer arcs
inferred← citeshttps://doi.org/10.1007/s10623-026-01900-3openalex-snapshot
On the reducibility of minihypers
inferred← citeshttps://doi.org/10.1016/j.disc.2004.08.031openalex-snapshot
Extendability of quaternary linear codes
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.045openalex-snapshot
Constructing linear codes from some orbits of projectivities
inferred← citeshttps://doi.org/10.1016/j.disc.2007.12.028openalex-snapshot
(l,s) -extension of linear codes
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.2004.02.001openalex-snapshot
A new extension theorem for linear codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2005.09.005openalex-snapshot
Some improvements to the extendability of ternary linear 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.2015.04.004openalex-snapshot
On the l-extendability of quaternary linear codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2020.101711openalex-snapshot
A new extension theorem for ternary linear codes and its application
inferred← citeshttps://doi.org/10.1016/j.ffa.2024.102401openalex-snapshot
The extended codes of some linear codes
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1109/acct51235.2020.9383359openalex-snapshot
Codes related to caps and the non-existence of some Griesmer codes
inferred← citeshttps://doi.org/10.1109/tit.2025.3587759openalex-snapshot
Lower Bounds for Error Coefficients of Griesmer Optimal Linear Codes via Iteration
inferred← citeshttps://doi.org/10.1134/s0032946006040041openalex-snapshot
An extension theorem for arcs and linear codes
inferred← citeshttps://doi.org/10.1134/s0032946019030037openalex-snapshot
Divisible Arcs, Divisible Codes, and the Extension Problem for Arcs and Codes
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0701112openalex-snapshot
(l,s)-Extension of Linear Codes
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.