On the public citation graph
A Complete Classification of Doubly Even Self-dual Codes of Length 40
0 signed · 51 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.1007/s10623-010-9370-3openalex-snapshot
Self-dual codes with automorphism of order 3 having 8 cycles
inferredcites →https://doi.org/10.1016/0012-365x(72)90030-1openalex-snapshot
Good self dual codes exist
inferredcites →https://doi.org/10.1016/0012-365x(72)90034-9openalex-snapshot
A classification of self-orthogonal codes over GF(2)
inferredcites →https://doi.org/10.1016/0012-365x(94)00271-jopenalex-snapshot
Codes and Siegel modular forms
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/0097-3165(92)90003-dopenalex-snapshot
The binary self-dual codes of length up to 32: A revised enumeration
inferredcites →https://doi.org/10.1016/j.disc.2004.06.010openalex-snapshot
Some optimal self-orthogonal and self-dual codes
inferredcites →https://doi.org/10.1016/j.ffa.2003.08.001openalex-snapshot
Extremal self-dual [40,20,8] codes with covering radius 7
inferredcites →https://doi.org/10.1016/s0012-365x(99)00318-0openalex-snapshot
Extremal self-dual codes with the smallest covering radius
inferredcites →https://doi.org/10.1016/s0019-9958(73)90273-8openalex-snapshot
An upper bound for self-dual codes
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/18.945269openalex-snapshot
The mass of extremal doubly-even self-dual codes of length 40
inferredcites →https://doi.org/10.1109/18.979332openalex-snapshot
Jacobi polynomials for singly even self-dual codes and the covering radius problems
inferredcites →https://doi.org/10.1109/tit.1983.1056681openalex-snapshot
On the coveting radius of extremal self-dual codes
inferredcites →https://doi.org/10.1109/tit.2011.2177809openalex-snapshot
Classification of Extremal and $s$-Extremal Binary Self-Dual Codes of Length 38
inferredcites →https://doi.org/10.1109/tit.2012.2190134openalex-snapshot
An Algorithm for Classification of Binary Self-Dual Codes
inferredcites →https://doi.org/10.3934/amc.2012.6.229openalex-snapshot
Classification of self-dual codes of length 36
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jcd.21556openalex-snapshot
Self‐Dual Codes and the Nonexistence of a Quasi‐Symmetric 2‐(37,9,8) Design with Intersection Numbers 1 and 3
inferred← citeshttps://doi.org/10.1007/jhep02(2026)257openalex-snapshot
Holographic duality from Howe duality: Chern-Simons gravity as an ensemble of code CFTs
inferred← citeshttps://doi.org/10.1007/jhep04(2023)011openalex-snapshot
Narain CFTs and quantum codes at higher genus
inferred← citeshttps://doi.org/10.1007/jhep05(2022)159openalex-snapshot
Classical codes and chiral CFTs at higher genus
inferred← citeshttps://doi.org/10.1007/jhep11(2023)035openalex-snapshot
Averaging over codes and an SU(2) modular bootstrap
inferred← citeshttps://doi.org/10.1007/s00200-023-00615-5openalex-snapshot
Constructing doubly even self-dual codes and even unimodular lattices from Hadamard matrices
inferred← citeshttps://doi.org/10.1007/s00200-024-00664-4openalex-snapshot
Doubly even self-orthogonal codes from quasi-symmetric designs
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.1007/s11704-014-3469-zopenalex-snapshot
Optimal binary codes and binary construction of quantum codes
inferred← citeshttps://doi.org/10.1016/j.disc.2017.06.009openalex-snapshot
Extremal Type II Z4 -codes constructed from binary doubly even self-dual codes of length 40
inferred← citeshttps://doi.org/10.1016/j.disc.2019.04.017openalex-snapshot
A 40-dimensional extremal Type II lattice with no 4-frames
inferred← citeshttps://doi.org/10.1016/j.ffa.2012.08.002openalex-snapshot
Classification of binary self-dual [48,24,10] codes with an automorphism of odd prime order
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.ffa.2013.09.002openalex-snapshot
Optimal subcodes and optimum distance profiles of self-dual codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2017.11.004openalex-snapshot
Some new results on the self-dual [120,60,24] code
inferred← citeshttps://doi.org/10.1016/j.laa.2025.08.003openalex-snapshot
Homomorphisms from the Coxeter graph
inferred← citeshttps://doi.org/10.1109/isit.2013.6620700openalex-snapshot
Wiretap codes: Families of lattices satisfying the Belfiore-Solé secrecy function conjecture
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.1109/tit.2012.2190134openalex-snapshot
An Algorithm for Classification of Binary Self-Dual Codes
inferred← citeshttps://doi.org/10.1109/tit.2014.2368563openalex-snapshot
Extremal Type I $ \mathbb {Z}_{k}$ -Codes and $k$ -Frames of Odd Unimodular Lattices
inferred← citeshttps://doi.org/10.1109/tit.2015.2440266openalex-snapshot
Classification of Binary Self-Dual Codes of Length 40
inferred← citeshttps://doi.org/10.18297/etd/457openalex-snapshot
Self-dual codes, subcode structures, and applications.
inferred← citeshttps://doi.org/10.3390/math10050748openalex-snapshot
Extremal Binary and Ternary Codes of Length 60 with an Automorphism of Order 29 and a Generalization
inferred← citeshttps://doi.org/10.37236/5213openalex-snapshot
On the Existence of Certain Optimal Self-Dual Codes with Lengths Between 74 and 116
inferred← citeshttps://doi.org/10.3934/amc.2013.7.267openalex-snapshot
The classification of complementary information set codes of lengths $14$ and $16$
inferred← citeshttps://doi.org/10.3934/amc.2023039openalex-snapshot
Construction of extremal $ \mathbb{Z}_{4} $-codes using a neighborhood search algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1111.0228openalex-snapshot
Classification of extremal and $s$-extremal binary self-dual codes of length 38
inferred← citeshttps://doi.org/10.48550/arxiv.1201.4334openalex-snapshot
Classification of Binary Self-Dual [48,24,10] Codes with an Automorphism of Odd Prime Order
inferred← citeshttps://doi.org/10.48550/arxiv.1203.1527openalex-snapshot
Optimum Subcodes of Self-Dual Codes and Their Optimum Distance Profiles
inferred← citeshttps://doi.org/10.48550/arxiv.1301.5172openalex-snapshot
On the Existence of Frames of Some Extremal Odd Unimodular Lattices and Self-Dual Zk-Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1503.04584openalex-snapshot
Extremal Type I $\mathbb{Z}_k$-codes and $k$-frames of odd unimodular lattices
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.