On the public citation graph
New Quasi-Cyclic Codes From Simplex Codes
0 signed · 34 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/s0019-9958(69)90497-5openalex-snapshot
Some results on quasi-cyclic codes
inferredcites →https://doi.org/10.1109/18.333889openalex-snapshot
Two new rate 2/p binary quasi-cyclic codes
inferredcites →https://doi.org/10.1109/18.705580openalex-snapshot
Some new binary, 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.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.2003.809501openalex-snapshot
Good self-dual quasi-cyclic codes exist
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-007-9113-2openalex-snapshot
A search algorithm for linear codes: progressive dimension growth
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/s10773-021-04732-0openalex-snapshot
Quantum Codes and Entanglement-Assisted Quantum Codes Derived from One-Generator Quasi-Twisted Codes
inferred← citeshttps://doi.org/10.1007/s11128-014-0848-1openalex-snapshot
Binary construction of pure additive quantum codes with distance five or six
inferred← citeshttps://doi.org/10.1007/s11704-014-3469-zopenalex-snapshot
Optimal binary codes and binary construction of quantum codes
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115235openalex-snapshot
Generator matrices of quasi-cyclic codes
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.1109/bsc57238.2023.10201835openalex-snapshot
A Novel Framework for Relating Quasi-Cyclic Codes and Quasi-Twisted Codes
inferred← citeshttps://doi.org/10.1109/isit.2007.4557332openalex-snapshot
New Constructions of a Family of 2-Generator Quasi-Cyclic Two-Weight Codes and Related Codes
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206961openalex-snapshot
A Novel Construction Technique for Some Classes of Quasi-Cyclic 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.1109/tit.2012.2184834openalex-snapshot
A matrix-theoretic approach for analyzing quasi-cyclic low-density parity-check codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2616467openalex-snapshot
Multidimensional Quasi-Cyclic and Convolutional Codes
inferred← citeshttps://doi.org/10.1109/tit.2024.3424290openalex-snapshot
Cyclic and Negacyclic Codes With Optimal and Best Known Minimum Distances
inferred← citeshttps://doi.org/10.1109/tit.2024.3476111openalex-snapshot
Explicit Cyclic and Quasi-Cyclic Codes With Optimal, Best Known Parameters, and Large Relative Minimum Distances
inferred← citeshttps://doi.org/10.1137/120865823openalex-snapshot
A Bound on the Minimum Distance of Quasi-cyclic Codes
inferred← citeshttps://doi.org/10.1137/16m1065604openalex-snapshot
Quasi-Cyclic Subcodes of Cyclic Codes
inferred← citeshttps://doi.org/10.11648/j.ajist.20261001.13openalex-snapshot
A Novel Approach to Constructing Certain Classes of Quasi-Cyclic 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.404964openalex-snapshot
Some new binary codes with improved minimum distances
inferred← citeshttps://doi.org/10.13069/jacodesmath.617232openalex-snapshot
Bijective S-boxes of different sizes obtained from quasi-cyclic codes
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.2991/icfcce-14.2014.35openalex-snapshot
Binary Generalized Quasi-Cyclic Self-orthogonal Codes and Binary Construction of Pure Quantum Codes
inferred← citeshttps://doi.org/10.3390/sym15030643openalex-snapshot
Lower Bounds for Quasi-Cyclic Codes and New Binary Quantum Codes
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
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.