On the public citation graph

A Bound on the Minimum Distance of Quasi-cyclic Codes

0 signed · 38 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.1006/jsco.1996.0125openalex-snapshot
The Magma Algebra System I: The User Language
inferredcites →https://doi.org/10.1007/s00200-009-0095-3openalex-snapshot
Generalized quasi-cyclic codes: structural properties and code construction
inferredcites →https://doi.org/10.1007/s10623-005-1431-7openalex-snapshot
On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots
inferredcites →https://doi.org/10.1016/j.ffa.2003.10.002openalex-snapshot
Artin–Schreier curves and weights of two-dimensional cyclic codes
inferredcites →https://doi.org/10.1023/a:1024715527805openalex-snapshot
On the Algebraic Structure of Quasi-cyclic Codes II: Chain Rings
inferredcites →https://doi.org/10.1081/agb-120013317openalex-snapshot
A BOUND ON THE NUMBER OF RATIONAL POINTS OF CERTAIN ARTIN-SCHREIER FAMILIES
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/18.959257openalex-snapshot
On the algebraic structure of quasi-cyclic codes .I. Finite fields
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.2003.809501openalex-snapshot
Good self-dual quasi-cyclic codes exist
inferredcites →https://doi.org/10.1109/tit.2003.819337openalex-snapshot
New binary one-generator quasi-cyclic codes
inferredcites →https://doi.org/10.1109/tit.2004.831855openalex-snapshot
On Existence of Good Self-Dual Quasi-Cyclic Codes
inferredcites →https://doi.org/10.1109/tit.2005.850142openalex-snapshot
On the Algebraic Structure of Quasi-Cyclic Codes III: Generator Theory
inferredcites →https://doi.org/10.1109/tit.2006.890727openalex-snapshot
New Quasi-Cyclic Codes From Simplex Codes
inferredcites →https://doi.org/10.1109/tit.2007.907500openalex-snapshot
Self-Dual Doubly Even $2$-Quasi-Cyclic Transitive Codes Are Asymptotically Good

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s10623-024-01464-0openalex-snapshot
New distance bounds for quasi-cyclic codes
inferred← citeshttps://doi.org/10.1007/s10623-024-01532-5openalex-snapshot
A construction of optimal quasi-cyclic locally recoverable codes using constituent codes
inferred← citeshttps://doi.org/10.1007/s12190-014-0787-0openalex-snapshot
Note on quasi-twisted codes and an application
inferred← citeshttps://doi.org/10.1007/s12190-015-0885-7openalex-snapshot
Bounds on quasi-cyclic codes over finite chain rings
inferred← citeshttps://doi.org/10.1007/s12190-022-01787-yopenalex-snapshot
n-Dimensional quasi-cyclic codes over finite chain rings
inferred← citeshttps://doi.org/10.1007/s40314-023-02298-7openalex-snapshot
Quantum synchronizable codes from repeated-root quasi-cyclic codes
inferred← citeshttps://doi.org/10.1007/s40314-025-03386-6openalex-snapshot
Complete weight enumerators of quasi-2-dimensional cyclic codes
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115004openalex-snapshot
Quasi-cyclic codes of index 2
inferred← citeshttps://doi.org/10.1016/j.ffa.2016.06.004openalex-snapshot
A minimum distance bound for quasi-nD-cyclic codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2016.07.005openalex-snapshot
Quasi-cyclic complementary dual codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2018.01.008openalex-snapshot
A minimum distance bound for 2-dimension λ-quasi-twisted codes over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2020.101712openalex-snapshot
A bound on the minimum distance of generalized quasi-twisted codes
inferred← citeshttps://doi.org/10.1109/isit.2016.7541472openalex-snapshot
Spectral analysis of quasi-cyclic product codes
inferred← citeshttps://doi.org/10.1109/tit.2012.2225823openalex-snapshot
The Concatenated Structure of Quasi-Cyclic Codes and an Improvement of Jensen's Bound
inferred← citeshttps://doi.org/10.1109/tit.2016.2593451openalex-snapshot
Spectral Analysis of Quasi-Cyclic Product Codes
inferred← citeshttps://doi.org/10.1109/tit.2021.3084146openalex-snapshot
A Comparison of Distance Bounds for Quasi-Twisted Codes
inferred← citeshttps://doi.org/10.3390/e27111096openalex-snapshot
On Quasi-Cyclic Codes of Index 3
inferred← citeshttps://doi.org/10.3934/amc.2023041openalex-snapshot
Quasi-twisted codes as contractions of quasi-cyclic codes
inferred← citeshttps://doi.org/10.3934/amc.2026034openalex-snapshot
A new minimum distance bound of generalized quasi-twisted codes
inferred← citeshttps://doi.org/10.48550/arxiv.1309.1623openalex-snapshot
Quasi-Cyclic Codes Over Finite Chain Rings
inferred← citeshttps://doi.org/10.48550/arxiv.1501.03924openalex-snapshot
On cyclic codes over $\mathbb{Z}_q+u\mathbb{Z}_q$
inferred← citeshttps://doi.org/10.48550/arxiv.1501.06543openalex-snapshot
Construction of Quasi-Cyclic Product 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.