On the public citation graph

New good quasi-cyclic ternary and quaternary linear codes

0 signed · 45 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.1007/3-540-51083-4_44openalex-snapshot
Recent results on covering problems
inferredcites →https://doi.org/10.1007/3-540-57843-9_7openalex-snapshot
The length function: A revised table
inferredcites →https://doi.org/10.1007/bf00124211openalex-snapshot
Optimal ternary quasi-cyclic codes
inferredcites →https://doi.org/10.1007/bf00124513openalex-snapshot
New Good Rate (m-1)/pm Ternary and Quaternary Quasi-Cyclic Codes
inferredcites →https://doi.org/10.1016/0012-365x(92)90576-2openalex-snapshot
Complete k-arcs in PG(n, q), q even
inferredcites →https://doi.org/10.1016/0012-365x(94)90160-0openalex-snapshot
Optimal linear codes over GF(4)
inferredcites →https://doi.org/10.1016/s0012-365x(96)00104-5openalex-snapshot
New bounds for the minimum length of quaternary linear codes of dimension five
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.179360openalex-snapshot
Constructions for perfect mixed codes and other covering codes
inferredcites →https://doi.org/10.1109/18.21265openalex-snapshot
A new construction for covering codes
inferredcites →https://doi.org/10.1109/18.333888openalex-snapshot
Six new binary quasi-cyclic codes
inferredcites →https://doi.org/10.1109/18.61146openalex-snapshot
Linear codes with covering radius 2 and other new covering codes
inferredcites →https://doi.org/10.1109/18.86975openalex-snapshot
On (k, t)-subnormal covering codes
inferredcites →https://doi.org/10.1109/tit.1985.1057039openalex-snapshot
On the covering radius of 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/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-015-0059-5openalex-snapshot
New binary h-generator quasi-cyclic codes by augmentation and new minimum distance bounds
inferred← citeshttps://doi.org/10.1007/s11128-024-04304-1openalex-snapshot
On the algebraic structure of quasi-polycyclic codes and new quantum codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2016.12.002openalex-snapshot
A generalization of quasi-twisted codes: Multi-twisted codes
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.2013.11.019openalex-snapshot
New linear codes from constacyclic codes
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.1080/02522667.2014.961788openalex-snapshot
New quasi-twisted codes over F11— minimum distance bounds and a new database
inferred← citeshttps://doi.org/10.1090/conm/642/12886openalex-snapshot
Equivalence Classes and Structures of Constacyclic Codes Over Finite Fields
inferred← citeshttps://doi.org/10.1109/18.771246openalex-snapshot
New ternary linear codes
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/iraset52964.2022.9738244openalex-snapshot
A class of 1-generator right Quasi-polycyclic Codes
inferred← citeshttps://doi.org/10.1109/isit.2007.4557331openalex-snapshot
Some Open Problems on Quasi-Twisted and Related Code Constructions and Good Quaternary 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.2008.2006430openalex-snapshot
An Explicit Construction of $2$-Generator Quasi-Twisted Codes
inferred← citeshttps://doi.org/10.13069/jacodesmath.00000openalex-snapshot
Some new binary codes with improved minimum distances
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.404964openalex-snapshot
Some new binary codes with improved minimum distances
inferred← citeshttps://doi.org/10.13069/jacodesmath.v10i1.234openalex-snapshot
New good quasi-cyclic codes and codes with improved minimum distance
inferred← citeshttps://doi.org/10.13069/jacodesmath.v11i1.257openalex-snapshot
New results and bounds on codes over $GF(17)$
inferred← citeshttps://doi.org/10.48550/arxiv.0712.0541openalex-snapshot
New Construction of A Family of Quasi-Twisted Two-Weight Codes
inferred← citeshttps://doi.org/10.48550/arxiv.0805.4748openalex-snapshot
New Construction of 2-Generator Quasi-Twisted Codes
inferred← citeshttps://doi.org/10.56824/vujs.2019nt40openalex-snapshot
Algebraic structure of cyclic and negacyclic codes over a finite chain ring alphabet and applications
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.