On the public citation graph

New Good Rate (m-1)/pm Ternary and Quaternary Quasi-Cyclic Codes

0 signed · 49 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/bf00124211openalex-snapshot
Optimal ternary quasi-cyclic codes
inferredcites →https://doi.org/10.1016/0012-365x(78)90002-xopenalex-snapshot
Necklaces of beads in k colors and k-ary de Bruijn sequences
inferredcites →https://doi.org/10.1016/0012-365x(92)90524-jopenalex-snapshot
Local search in coding theory
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.1049/el:19740024openalex-snapshot
Some new results on binary linear block codes
inferredcites →https://doi.org/10.1049/el:19760268openalex-snapshot
Computerised search for linear binary codes
inferredcites →https://doi.org/10.1109/18.119683openalex-snapshot
Some ternary and quaternary codes and associated sphere packings
inferredcites →https://doi.org/10.1109/18.144718openalex-snapshot
Nine good rate (m-1)/pm quasi-cyclic 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.259670openalex-snapshot
Twelve good rate (m-r)/pm quasi-cyclic codes
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.1967.1054053openalex-snapshot
Limit distribution of the minimum distance of random linear codes
inferredcites →https://doi.org/10.1109/tit.1973.1054971openalex-snapshot
The random coding bound is tight for the average code (Corresp.)
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.)

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/s00200-017-0327-xopenalex-snapshot
New binary linear codes from quasi-cyclic codes and an augmentation algorithm
inferred← citeshttps://doi.org/10.1007/s00200-019-00383-1openalex-snapshot
Some new linear codes from skew cyclic codes and computer algebra challenges
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-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/s12045-015-0213-4openalex-snapshot
Necklaces: Generalizations
inferred← citeshttps://doi.org/10.1007/s12095-018-0333-2openalex-snapshot
New linear codes over non-prime fields
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/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)00350-4openalex-snapshot
Algebraic structure of quasicyclic codes
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:1008215724132openalex-snapshot
Some New Optimal Ternary Linear Codes
inferred← citeshttps://doi.org/10.1023/a:1008355310919openalex-snapshot
Codes over $$\mathbb{F}_3 + u\mathbb{F}_3 $$ and Improvements to the Bounds on Ternary Linear Codes
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:1026513628412openalex-snapshot
Improved Bounds for Ternary Linear Codes of Dimension 8 Using Tabu Search
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.508846openalex-snapshot
Optimal quaternary linear codes of dimension five
inferred← citeshttps://doi.org/10.1109/18.556620openalex-snapshot
New optimal quaternary linear codes of dimension 5
inferred← citeshttps://doi.org/10.1109/18.605613openalex-snapshot
Improved bounds for ternary linear codes of dimension 7
inferred← citeshttps://doi.org/10.1109/18.623165openalex-snapshot
Improvements to the bounds on optimal ternary linear codes of dimension 6
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.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/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.1142/s0219749917500174openalex-snapshot
Entanglement-assisted quantum codes from quaternary codes of dimension five
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.645015openalex-snapshot
Construction of quasi-twisted codes and enumeration of defining polynomials
inferred← citeshttps://doi.org/10.2140/involve.2020.13.137openalex-snapshot
Some generalizations of the ASR search algorithm for quasitwisted codes
inferred← citeshttps://doi.org/10.3934/amc.2017016openalex-snapshot
Some results on the structure of constacyclic codes and new linear codes over GF(7) from 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.