On the public citation graph
Optimal ternary linear codes
0 signed · 95 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/bf00124211openalex-snapshot
Optimal ternary quasi-cyclic codes
inferredcites →https://doi.org/10.1016/0012-365x(81)90166-7openalex-snapshot
The smallest length of binary 7–dimensional linear codes with prescribed minimum distance
inferredcites →https://doi.org/10.1016/0012-365x(89)90353-1openalex-snapshot
A survey of recent works with respect to a characterization of an (n, k, d; q)-code meeting the Griesmer bound using a min·hyper in a finite projective geometry
inferredcites →https://doi.org/10.1016/0097-3165(83)90002-xopenalex-snapshot
The packing problem for projective geometries over GF(3) with dimension greater than five
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/s0019-9958(65)90080-xopenalex-snapshot
Algebraically punctured cyclic codes
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/tit.1973.1055009openalex-snapshot
Minimum-distance bounds for binary linear codes
inferredcites →https://doi.org/10.1109/tit.1987.1057356openalex-snapshot
An updated table of minimum-distance bounds for binary linear codes
inferredcites →https://doi.org/10.1109/tit.1987.1057363openalex-snapshot
New bounds on binary linear codes of dimension eight (Corresp.)
inferredcites →https://doi.org/10.1147/rd.45.0532openalex-snapshot
A Bound for Error-Correcting Codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/ffta.1995.1036openalex-snapshot
Construction of Some Optimal Ternary Linear Codes and the Uniqueness of [294, 6, 195; 3]-Codes Meeting the Griesmer Bound
inferred← citeshttps://doi.org/10.1006/jcta.1997.2864openalex-snapshot
Divisibility of Codes Meeting the Griesmer Bound
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/3-540-63163-1_17openalex-snapshot
Optimal linear codes of dimension 4 over GF(5)
inferred← citeshttps://doi.org/10.1007/978-3-030-52200-1_17openalex-snapshot
Classification of Linear Codes by Extending Their Residuals
inferred← citeshttps://doi.org/10.1007/bf00124211openalex-snapshot
Optimal ternary quasi-cyclic codes
inferred← citeshttps://doi.org/10.1007/bf00124514openalex-snapshot
The nonexistence of ternary [50,5,32] codes
inferred← citeshttps://doi.org/10.1007/bf00141966openalex-snapshot
On the construction of [q 4 + q 2 ? q, 5,q 4 ? q 3 + q 2 ? 2q; q]-codes meeting the Griesmer bound
inferred← citeshttps://doi.org/10.1007/bf00150863openalex-snapshot
On the non-existence of linear codes attaining the Griesmer bound
inferred← citeshttps://doi.org/10.1007/bf01220305openalex-snapshot
On complete caps in the projective geometries over $$\mathbb{F}_3 $$
inferred← citeshttps://doi.org/10.1007/bf01388456openalex-snapshot
An optimal ternary [69, 5, 45] code and related codes
inferred← citeshttps://doi.org/10.1007/s00022-010-0041-3openalex-snapshot
On the non-existence of a projective (75, 4,12, 5) set in PG(3, 7)
inferred← citeshttps://doi.org/10.1007/s10623-007-9079-0openalex-snapshot
Coprimitive sets and inextendable codes
inferred← citeshttps://doi.org/10.1007/s10623-011-9593-yopenalex-snapshot
On the minimum length of ternary linear codes
inferred← citeshttps://doi.org/10.1007/s10623-013-9914-4openalex-snapshot
On the construction of Griesmer codes of dimension 5
inferred← citeshttps://doi.org/10.1007/s10623-016-0304-6openalex-snapshot
Linearly embeddable designs
inferred← citeshttps://doi.org/10.1007/s10623-019-00673-2openalex-snapshot
Troika: a ternary cryptographic hash function
inferred← citeshttps://doi.org/10.1007/s40314-024-02653-2openalex-snapshot
On construction of ternary optimal self-orthogonal codes
inferred← citeshttps://doi.org/10.1016/0012-365x(94)90160-0openalex-snapshot
Optimal linear codes over GF(4)
inferred← citeshttps://doi.org/10.1016/0378-3758(95)00126-3openalex-snapshot
The nonexistence of [71,5,46;3]-codes
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.032openalex-snapshot
t -CIS codes over GF(p) and orthogonal arrays
inferred← citeshttps://doi.org/10.1016/j.disc.2004.06.002openalex-snapshot
The nonexistence of ternary [105,6,68] and [230,6,152] codes
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.044openalex-snapshot
On optimal non-projective ternary 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.2008.01.047openalex-snapshot
On optimal linear codes over F5
inferred← citeshttps://doi.org/10.1016/j.disc.2015.01.010openalex-snapshot
On the minimum length of linear codes over F5
inferred← citeshttps://doi.org/10.1016/j.procs.2017.03.073openalex-snapshot
Locality of Some Optimal Ternary Linear Codes
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00126-2openalex-snapshot
New minimum distance bounds for linear codes over GF(5)
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00104-5openalex-snapshot
New bounds for the minimum length of quaternary linear codes of dimension five
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00343-7openalex-snapshot
Two classes of ternary codes and their weight distributions
inferred← citeshttps://doi.org/10.1016/s0378-3758(96)00013-4openalex-snapshot
The uniqueness of [87,5,57; 3]-codes and the nonexistence of [258,6,171; 3]-codes
inferred← citeshttps://doi.org/10.1016/s0378-3758(96)00014-6openalex-snapshot
A characterization of some {3v2 + v3, 3v1 + v2; 3, 3}-minihypers and some [15, 4, 9; 3]-codes with B2 = 0
inferred← citeshttps://doi.org/10.1016/s0378-3758(96)00015-8openalex-snapshot
A characterization of some {3v1 + v3, 3v0 + v2; 3, 3}-minihypers and its applications to error-correcting codes
inferred← citeshttps://doi.org/10.1016/s0378-3758(98)00039-1openalex-snapshot
On the nonexistence of some quaternary linear codes meeting the Griesmer bound
inferred← citeshttps://doi.org/10.1023/a:1004901203236openalex-snapshot
On the Minimum Length of q-ary Linear Codes of Dimension Five
inferred← citeshttps://doi.org/10.1023/a:1005076729296openalex-snapshot
A Characterization of Some Minihypers and its Application to Linear Codes
inferred← citeshttps://doi.org/10.1023/a:1008215724132openalex-snapshot
Some New Optimal Ternary Linear Codes
inferred← citeshttps://doi.org/10.1023/a:1008278312966openalex-snapshot
The Nonexistence of Ternary [38, 6, 23] Codes
inferred← citeshttps://doi.org/10.1023/a:1008292320488openalex-snapshot
Classification of Some Optimal Ternary Linear Codes of Small Length
inferred← citeshttps://doi.org/10.1023/a:1008294128110openalex-snapshot
The Correspondence Between Projective Codes and 2-weight Codes
inferred← citeshttps://doi.org/10.1023/a:1008317124941openalex-snapshot
The Nonexistence of Some Optimal Ternary Codes of Dimension Five
inferred← citeshttps://doi.org/10.1023/a:1008319024396openalex-snapshot
An Extension Theorem for Linear Codes
inferred← citeshttps://doi.org/10.1023/a:1008356719912openalex-snapshot
The Nonexistence of a [207,4,165] Code over GF(5)
inferred← citeshttps://doi.org/10.1023/a:1013873906597openalex-snapshot
New Minimum Distance Bounds for Linear Codes over Small Fields
inferred← citeshttps://doi.org/10.1023/b:desi.0000032608.92853.95openalex-snapshot
A Sequence of Unique Quaternary Griesmer Codes
inferred← citeshttps://doi.org/10.1023/b:prit.0000024876.30498.f4openalex-snapshot
New Minimum Distance Bounds for Linear Codes over GF(9)
inferred← citeshttps://doi.org/10.1023/b:prit.0000043927.19508.8bopenalex-snapshot
The Nonexistence of Ternary [284, 6, 188] Codes
inferred← citeshttps://doi.org/10.1063/5.0328009openalex-snapshot
Computational construction of new projective linear codes of dimension 5 over GF(7)
inferred← citeshttps://doi.org/10.1080/09720529.2003.10697961openalex-snapshot
On the covering radius of Simplex codes
inferred← citeshttps://doi.org/10.1109/18.144719openalex-snapshot
Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
inferred← citeshttps://doi.org/10.1109/18.272479openalex-snapshot
Five new optimal ternary linear codes
inferred← citeshttps://doi.org/10.1109/18.370155openalex-snapshot
The nonexistence of some five-dimensional quaternary linear codes
inferred← citeshttps://doi.org/10.1109/18.382031openalex-snapshot
Four nonexistence results for ternary linear codes
inferred← citeshttps://doi.org/10.1109/18.476334openalex-snapshot
Some new results for ternary linear codes of dimension 5 and 6
inferred← citeshttps://doi.org/10.1109/18.508846openalex-snapshot
Optimal quaternary linear codes of dimension five
inferred← citeshttps://doi.org/10.1109/18.532912openalex-snapshot
New ternary and quaternary linear block codes
inferred← citeshttps://doi.org/10.1109/18.567723openalex-snapshot
Optimal linear codes of dimension 4 over F/sub 5/
inferred← citeshttps://doi.org/10.1109/18.992814openalex-snapshot
Some new results for optimal ternary linear codes
inferred← citeshttps://doi.org/10.1109/acct51235.2020.9383239openalex-snapshot
On the Formally Self-Dual Binary [30, 15, 8] Codes
inferred← citeshttps://doi.org/10.1109/isit.1994.395038openalex-snapshot
The linear programming bound for ternary linear codes
inferred← citeshttps://doi.org/10.1109/isit.1994.395047openalex-snapshot
Four non-existence results for ternary linear codes
inferred← citeshttps://doi.org/10.1109/isit.2008.4595331openalex-snapshot
Optimum distance profiles of linear block codes
inferred← citeshttps://doi.org/10.1109/itcc.2003.1197530openalex-snapshot
A note on covering radius of MacDonald codes
inferred← citeshttps://doi.org/10.1109/tit.2005.859296openalex-snapshot
Some Results for Linear Binary Codes With Minimum Distance $5$ and $6$
inferred← citeshttps://doi.org/10.1109/tit.2009.2039059openalex-snapshot
On the Optimum Distance Profiles About Linear Block Codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2612654openalex-snapshot
New Upper Bounds on Binary Linear Codes and a $ {\mathbb Z}_{4}$ -Code With a Better-Than-Linear Gray Image
inferred← citeshttps://doi.org/10.1142/s0219749917500174openalex-snapshot
Entanglement-assisted quantum codes from quaternary codes of dimension five
inferred← citeshttps://doi.org/10.1587/transfun.e100.a.2172openalex-snapshot
On Locality of Some Ternary Linear Codes of Dimension 6
inferred← citeshttps://doi.org/10.18255/1818-1015-2022-3-182-198openalex-snapshot
On the Construction of Self-Complementary Codes and their Application in the Problem of Information Hiding
inferred← citeshttps://doi.org/10.3103/s0146411623070040openalex-snapshot
On Building Self-Complementary Codes and Their Application in Information Hiding
inferred← citeshttps://doi.org/10.31642/jokmc/2018/110108openalex-snapshot
Large (k,3)-arcs in PG(2,19) and the related linear codes
inferred← citeshttps://doi.org/10.37236/521openalex-snapshot
On Optimal Linear Codes over ${\mathbb{F}}_8$
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.2016026openalex-snapshot
Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
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.7508/ijmsi.2015.01.002openalex-snapshot
Optimal Linear Codes Over GF(7) and GF(11) with Dimension 3
inferred← citeshttps://doi.org/10.7907/96k8-q767openalex-snapshot
On Divisible 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.