On the public citation graph
Some new binary, quasi-cyclic codes
0 signed · 29 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.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.212301openalex-snapshot
An updated table of minimum-distance bounds for binary linear 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.1053974openalex-snapshot
Self-orthogonal quasi-cyclic codes
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.1987.1057356openalex-snapshot
An updated table of minimum-distance bounds for binary linear codes
inferredcites →https://doi.org/10.1215/s0012-7094-66-03307-2openalex-snapshot
Distribution of cyclic matrices in a finite field
inferredcites →https://doi.org/10.1515/9780691187563openalex-snapshot
Local Search in Combinatorial Optimization
inferredcites →https://doi.org/10.2307/j.ctv346t9copenalex-snapshot
Local Search in Combinatorial Optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00200-013-0207-yopenalex-snapshot
Some new binary quasi-cyclic codes from codes over the ring $$\mathbb F _2+u\mathbb F _2+v\mathbb F _2+uv\mathbb F _2$$ F 2 + u F 2 + v F 2 + u v F 2
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-014-0848-1openalex-snapshot
Binary construction of pure additive quantum codes with distance five or six
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00176-3openalex-snapshot
A Generalization of Negacyclic Codes
inferred← citeshttps://doi.org/10.1109/18.971744openalex-snapshot
Tailbiting codes: bounds and search results
inferred← citeshttps://doi.org/10.1109/isit.2000.866495openalex-snapshot
New results on binary quasi-cyclic codes
inferred← citeshttps://doi.org/10.1109/lcomm.2015.2401572openalex-snapshot
A Random Local Matroid Search Algorithm to Construct Good Rate $1/p$ Systematic Binary Quasi-Cyclic Codes
inferred← citeshttps://doi.org/10.1109/tit.2002.801475openalex-snapshot
Tailbiting codes obtained via convolutional codes with large active distance-slopes
inferred← citeshttps://doi.org/10.1109/tit.2003.819337openalex-snapshot
New binary one-generator quasi-cyclic codes
inferred← citeshttps://doi.org/10.1109/tit.2006.890727openalex-snapshot
New Quasi-Cyclic Codes From Simplex 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.1142/s1793830911001127openalex-snapshot
QUASI-CYCLIC CODES FROM CYCLIC-STRUCTURED DESIGNS WITH GOOD PROPERTIES
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/sym15010225openalex-snapshot
(β,γ)-Skew QC Codes with Derivation over a Semi-Local Ring
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.