On the public citation graph
Some results on the structure of constacyclic codes and new linear codes over GF(7) from quasi-twisted codes
0 signed · 46 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/978-3-540-37634-7_13openalex-snapshot
Searching for linear codes with large minimum distance
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/j.aml.2010.11.003openalex-snapshot
New quinary linear codes from quasi-twisted codes and their duals
inferredcites →https://doi.org/10.1016/j.jfranklin.2013.11.019openalex-snapshot
New linear codes from constacyclic codes
inferredcites →https://doi.org/10.1016/s0012-365x(03)00126-2openalex-snapshot
New minimum distance bounds for linear codes over GF(5)
inferredcites →https://doi.org/10.1016/s0893-9659(02)00050-2openalex-snapshot
New quasi-cyclic codes over 5
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1023/a:1011283523000openalex-snapshot
The Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes
inferredcites →https://doi.org/10.1023/b:prit.0000024876.30498.f4openalex-snapshot
New Minimum Distance Bounds for Linear Codes over GF(9)
inferredcites →https://doi.org/10.1080/02522667.2014.961788openalex-snapshot
New quasi-twisted codes over F11— minimum distance bounds and a new database
inferredcites →https://doi.org/10.1109/18.641542openalex-snapshot
The intractability of computing the minimum distance of a code
inferredcites →https://doi.org/10.1109/18.887874openalex-snapshot
New quasi-twisted quaternary linear codes
inferredcites →https://doi.org/10.1109/18.904549openalex-snapshot
On the covering radius of ternary negacyclic codes with length up to 26
inferredcites →https://doi.org/10.1109/isit.2004.1365491openalex-snapshot
New good linear codes by special puncturings
inferredcites →https://doi.org/10.1109/isit.2005.1523715openalex-snapshot
New codes from chains of quasi-cyclic codes
inferredcites →https://doi.org/10.1109/isit.2012.6283537openalex-snapshot
Computing extensions of linear codes using a greedy algorithm
inferredcites →https://doi.org/10.1109/tit.2003.815798openalex-snapshot
New quasi-twisted degenerate ternary linear codes
inferredcites →https://doi.org/10.1109/tit.2003.819337openalex-snapshot
New binary one-generator quasi-cyclic codes
inferredcites →https://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
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-3-031-33017-9_24openalex-snapshot
An Updated Database of $$\mathbb {Z}_4$$ Codes and an Open Problem About Quasi-cyclic Codes
inferred← citeshttps://doi.org/10.1007/s00200-021-00525-4openalex-snapshot
A new algorithm for equivalence of cyclic codes and its applications
inferred← citeshttps://doi.org/10.1007/s10623-019-00613-0openalex-snapshot
On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes
inferred← citeshttps://doi.org/10.1007/s10623-022-01038-yopenalex-snapshot
Polycyclic codes associated with trinomials: good codes and open questions
inferred← citeshttps://doi.org/10.1007/s10623-022-01124-1openalex-snapshot
A generalization of cyclic code equivalence algorithm to constacyclic codes
inferred← citeshttps://doi.org/10.1007/s10623-024-01512-9openalex-snapshot
Equivalence of constacyclic codes with shift constants of different orders
inferred← citeshttps://doi.org/10.1007/s11128-025-04828-0openalex-snapshot
An infinite class of quantum codes derived from duadic constacyclic codes
inferred← citeshttps://doi.org/10.1007/s12095-018-0333-2openalex-snapshot
New linear codes over non-prime fields
inferred← citeshttps://doi.org/10.1007/s12095-023-00645-3openalex-snapshot
Skew cyclic codes over $$\mathbb {Z}_{4}+u\mathbb {Z}_{4}+v\mathbb {Z}_{4}$$
inferred← citeshttps://doi.org/10.1007/s40314-022-01946-8openalex-snapshot
New binary and ternary quasi-cyclic codes with good properties
inferred← citeshttps://doi.org/10.1007/s40314-026-03874-3openalex-snapshot
A tight upper bound on the number of nonzero weights of a quasi-twisted code
inferred← citeshttps://doi.org/10.1007/s40840-026-02050-4openalex-snapshot
Skew Cyclic Codes Over $$\mathbb {Z}_{4}+u\mathbb {Z}_{4}+u^{2}\mathbb {Z}_{4}$$ with Derivation and New $$\mathbb {Z}_{4}$$ Codes
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113489openalex-snapshot
On the equivalence of linear cyclic and constacyclic 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.ffa.2018.01.012openalex-snapshot
Multi-twisted codes over finite fields and their dual codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2019.06.005openalex-snapshot
Skew multi-twisted codes over finite fields and their Galois duals
inferred← citeshttps://doi.org/10.1090/conm/785/15771openalex-snapshot
Good classical and quantum codes from multi-twisted codes
inferred← citeshttps://doi.org/10.1109/acct51235.2020.9383237openalex-snapshot
New Linear Codes as Quasi-Twisted Codes from Long Constacyclic Codes
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834522openalex-snapshot
A Generalization of the ASR Search Algorithm to 2-Generator Quasi-Twisted Codes
inferred← citeshttps://doi.org/10.13069/jacodesmath.508968openalex-snapshot
New linear codes over $GF(3)$, $GF(11)$, and $GF(13)$
inferred← citeshttps://doi.org/10.13069/jacodesmath.671815openalex-snapshot
$\mathbb{Z}_q(\mathbb{Z}_q+u\mathbb{Z}_q)$-linear skew constacyclic codes
inferred← citeshttps://doi.org/10.24330/ieja.1596075openalex-snapshot
Group structures of twistulant matrices over rings
inferred← citeshttps://doi.org/10.3934/amc.2026036openalex-snapshot
Linear complementary pairs of quasi-cyclic and quasi-twisted codes
inferred← citeshttps://doi.org/10.48550/arxiv.2008.07037openalex-snapshot
Good Classical and Quantum Codes from Multi-Twisted 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.