On the public citation graph
Singly-Even Self-Dual Codes of Length 40
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/0012-365x(82)90283-7openalex-snapshot
Cycle decompositions of complete graphs
inferredcites →https://doi.org/10.1016/0012-365x(82)90284-9openalex-snapshot
On primes dividing the group order of a doubly-even (72, 36, 16) code and the group order of a quaternary (24, 12, 10) code
inferredcites →https://doi.org/10.1016/0012-365x(92)90716-sopenalex-snapshot
Extremal self-dual codes from symmetric designs
inferredcites →https://doi.org/10.1016/0097-3165(75)90042-4openalex-snapshot
On the classification and enumeration of self-dual codes
inferredcites →https://doi.org/10.1016/0378-4754(82)90042-8openalex-snapshot
Introduction to the theory of error-correcting codes
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/18.119711openalex-snapshot
Existence of certain extremal self-dual codes
inferredcites →https://doi.org/10.1109/18.165461openalex-snapshot
Existence of some extremal self-dual codes
inferredcites →https://doi.org/10.1109/18.179361openalex-snapshot
On the existence of a certain (64, 32, 12) extremal code
inferredcites →https://doi.org/10.1109/18.59931openalex-snapshot
A new upper bound on the minimal distance of self-dual codes
inferredcites →https://doi.org/10.1109/18.86979openalex-snapshot
Weight enumerators of self-dual codes
inferredcites →https://doi.org/10.1109/tit.1982.1056499openalex-snapshot
Automorphisms of codes with applications to extremal doubly even codes of length 48
inferredcites →https://doi.org/10.1109/tit.1987.1057273openalex-snapshot
A method for constructing inequivalent self-dual codes with applications to length 56
inferredcites →https://doi.org/10.1109/tit.1987.1057356openalex-snapshot
An updated table of minimum-distance bounds for binary linear codes
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-010-9370-3openalex-snapshot
Self-dual codes with automorphism of order 3 having 8 cycles
inferred← citeshttps://doi.org/10.1007/s10623-011-9534-9openalex-snapshot
The binary extremal self-dual codes of lengths 38 and 40
inferred← citeshttps://doi.org/10.1007/s10623-013-9884-6openalex-snapshot
New extremal binary self-dual codes of length 64 from $$R_3$$ R 3 -lifts of the extended binary Hamming code
inferred← citeshttps://doi.org/10.1007/s10623-016-0253-0openalex-snapshot
A projection decoding of a binary extremal self-dual code of length 40
inferred← citeshttps://doi.org/10.1016/j.disc.2004.06.010openalex-snapshot
Some optimal self-orthogonal and self-dual codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2005.05.012openalex-snapshot
On the classification and enumeration of self-dual codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2013.01.009openalex-snapshot
Some extremal self-dual codes and unimodular lattices in dimension 40
inferred← citeshttps://doi.org/10.1016/j.jcta.2003.09.003openalex-snapshot
Designs and self-dual codes with long shadows
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00373-4openalex-snapshot
Type I neighbors of extremal type II codes of length 40 derived from Hadamard matrices
inferred← citeshttps://doi.org/10.1023/a:1008289725040openalex-snapshot
On the Binary Self-Dual Codes with an Automorphism of Order 2
inferred← citeshttps://doi.org/10.1023/a:1025476619824openalex-snapshot
New Extremal Type I Codes of Lengths 40, 42, and 44
inferred← citeshttps://doi.org/10.1109/18.623159openalex-snapshot
New extremal self-dual codes of lengths 42 and 44
inferred← citeshttps://doi.org/10.1109/18.651059openalex-snapshot
Extremal self-dual codes with an automorphism of order 2
inferred← citeshttps://doi.org/10.1109/isit.2002.1023730openalex-snapshot
Some optimal self-dual codes having automorphisms of order 5
inferred← citeshttps://doi.org/10.1109/itw2.2006.323742openalex-snapshot
Constructing self-dual codes using an automorphism group
inferred← citeshttps://doi.org/10.1109/tit.2011.2177809openalex-snapshot
Classification of Extremal and $s$-Extremal Binary Self-Dual Codes of Length 38
inferred← citeshttps://doi.org/10.3934/amc.2011.5.267openalex-snapshot
On the performance of binary extremal self-dual codes
inferred← citeshttps://doi.org/10.3934/amc.2012.6.193openalex-snapshot
Double-circulant and bordered-double-circulant constructions for self-dual codes over $R_2$
inferred← citeshttps://doi.org/10.3934/amc.2013.7.57openalex-snapshot
Self-dual $\mathbb{F}_q$-linear $\mathbb{F}_{q^t}$-codes with an automorphism of prime order
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.