On the public citation graph
Optimal ternary quasi-cyclic codes
0 signed · 65 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.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/s0019-9958(69)90497-5openalex-snapshot
Some results on quasi-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/18.144719openalex-snapshot
Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
inferredcites →https://doi.org/10.1109/18.79911openalex-snapshot
Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes
inferredcites →https://doi.org/10.1109/tit.1973.1054939openalex-snapshot
A note on the Griesmer bound
inferredcites →https://doi.org/10.1109/tit.1974.1055262openalex-snapshot
A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1978.1055929openalex-snapshot
On quasi-cyclic codes with rate l m (Corresp.)
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.1112/blms/18.2.97openalex-snapshot
The Geometry of Two-Weight 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-1-4757-6048-4_21openalex-snapshot
Constructions of Optimal Linear Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-25011-8_19openalex-snapshot
Quasi-Cyclic Codes over $\mathbb{F}_{13}$
inferred← citeshttps://doi.org/10.1007/bf00124513openalex-snapshot
New Good Rate (m-1)/pm Ternary and Quaternary Quasi-Cyclic Codes
inferred← citeshttps://doi.org/10.1007/s002000050117openalex-snapshot
Bounds on Minimum Distance for Linear Codes over GF(5)
inferred← citeshttps://doi.org/10.1007/s10623-014-9950-8openalex-snapshot
A new iterative computer search algorithm for good quasi-twisted codes
inferred← citeshttps://doi.org/10.1007/s10623-019-00673-2openalex-snapshot
Troika: a ternary cryptographic hash function
inferred← citeshttps://doi.org/10.1007/s11128-024-04514-7openalex-snapshot
On quantum codes derived from quasi-cyclic codes over a non-chain ring
inferred← citeshttps://doi.org/10.1007/s12190-016-1064-1openalex-snapshot
On complementary dual quasi-twisted codes
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00264-jopenalex-snapshot
Two new optimal ternary two-weight codes and strongly regular graphs
inferred← citeshttps://doi.org/10.1016/0893-9659(96)00004-3openalex-snapshot
A new two-weight code and strongly regular graph
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.jda.2012.04.006openalex-snapshot
Quasi-cyclic codes over F13 and enumeration of defining polynomials
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2011.10.020openalex-snapshot
One generator quasi-cyclic codes over F2+uF2
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2013.11.019openalex-snapshot
New linear codes from constacyclic 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/s0166-218x(00)00350-4openalex-snapshot
Algebraic structure of quasicyclic codes
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/s0893-9659(02)00050-2openalex-snapshot
New quasi-cyclic codes over 5
inferred← citeshttps://doi.org/10.1016/s0893-9659(99)00159-7openalex-snapshot
New linear codes over GF(8)
inferred← citeshttps://doi.org/10.1023/a:1011283523000openalex-snapshot
The Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes
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/a:1020094206873openalex-snapshot
New One-Generator Quasi-cyclic Codes over GF(7)
inferred← citeshttps://doi.org/10.1023/a:1025100305167openalex-snapshot
New Quasi-cyclic Degenerate Linear Codes over GF(8)
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.1080/02522667.2014.961788openalex-snapshot
New quasi-twisted codes over F11— minimum distance bounds and a new database
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.259670openalex-snapshot
Twelve good rate (m-r)/pm quasi-cyclic codes
inferred← citeshttps://doi.org/10.1109/18.391268openalex-snapshot
Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes
inferred← citeshttps://doi.org/10.1109/18.567725openalex-snapshot
New optimal binary linear codes of dimensions 9 and 10
inferred← citeshttps://doi.org/10.1109/18.623167openalex-snapshot
New good quasi-cyclic ternary and quaternary linear codes
inferred← citeshttps://doi.org/10.1109/18.749017openalex-snapshot
Codes of lengths 120 and 136 meeting the Grey-Rankin bound and quasi-symmetric designs
inferred← citeshttps://doi.org/10.1109/18.850694openalex-snapshot
New ternary quasi-cyclic codes with better minimum distances
inferred← citeshttps://doi.org/10.1109/18.887874openalex-snapshot
New quasi-twisted quaternary linear codes
inferred← citeshttps://doi.org/10.1109/isit.2000.866494openalex-snapshot
Algebraic structure of quasicyclic codes
inferred← citeshttps://doi.org/10.1109/tit.2002.1013145openalex-snapshot
Quasi-cyclic codes over Z/sub 4/ and some new binary codes
inferred← citeshttps://doi.org/10.1109/tit.2003.815798openalex-snapshot
New quasi-twisted degenerate ternary linear codes
inferred← citeshttps://doi.org/10.1109/tit.2003.819337openalex-snapshot
New binary one-generator quasi-cyclic codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2044062openalex-snapshot
On the Construction of Skew Quasi-Cyclic Codes
inferred← citeshttps://doi.org/10.1134/s0032946007020056openalex-snapshot
Some high-rate linear codes over GF(5) and GF(7)
inferred← citeshttps://doi.org/10.1142/s1793557115500850openalex-snapshot
Quasi-cyclic codes over the ring 𝔽p[u]/〈u2 − u〉
inferred← citeshttps://doi.org/10.1142/s1793830911001127openalex-snapshot
QUASI-CYCLIC CODES FROM CYCLIC-STRUCTURED DESIGNS WITH GOOD PROPERTIES
inferred← citeshttps://doi.org/10.13069/jacodesmath.327360openalex-snapshot
Some new ternary linear codes
inferred← citeshttps://doi.org/10.13069/jacodesmath.36947openalex-snapshot
A database of linear codes over $\mathbb{F}_{13}$ with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm
inferred← citeshttps://doi.org/10.13069/jacodesmath.645015openalex-snapshot
Construction of quasi-twisted codes and enumeration of defining polynomials
inferred← citeshttps://doi.org/10.13069/jacodesmath.66269openalex-snapshot
Some new quasi-twisted ternary linear codes
inferred← citeshttps://doi.org/10.7508/ijmsi.2015.01.002openalex-snapshot
Optimal Linear Codes Over GF(7) and GF(11) with Dimension 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.