On the public citation graph
A strengthening of the Assmus-Mattson theorem
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/978-1-4757-2016-7openalex-snapshot
Sphere Packings, Lattices and Groups
inferredcites →https://doi.org/10.1016/0097-3165(80)90057-6openalex-snapshot
On the enumeration of self-dual codes
inferredcites →https://doi.org/10.1016/0097-3165(89)90077-0openalex-snapshot
On self-dual, doubly even codes of length 32
inferredcites →https://doi.org/10.1016/c2013-0-11509-7openalex-snapshot
A Handbook of Integer Sequences
inferredcites →https://doi.org/10.1016/s0019-9958(73)80007-5openalex-snapshot
Four fundamental parameters of a code and their combinatorial significance
inferredcites →https://doi.org/10.1016/s0019-9958(73)90273-8openalex-snapshot
An upper bound for self-dual 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.59931openalex-snapshot
A new upper bound on the minimal distance of self-dual codes
inferredcites →https://doi.org/10.1109/proc.1980.11608openalex-snapshot
The theory of error-correcting codes
inferredcites →https://doi.org/10.1137/0134012openalex-snapshot
Hahn Polynomials, Discrete Harmonics, and t -Designs
inferredcites →https://doi.org/10.1137/0406001openalex-snapshot
On Error-Correcting Codes and Invariant Linear Forms
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
inferredcites →https://doi.org/10.1515/crll.1989.398.144openalex-snapshot
Über ganzzahlige unimodulare euklidische Gitter.
inferredcites →https://doi.org/10.2307/2323992openalex-snapshot
Sphere Packings, Lattices and Groups.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-0-8176-8256-9_3openalex-snapshot
Kittens, Mathematical Blackjack, and Combinatorial Codes
inferred← citeshttps://doi.org/10.1007/s10623-007-9145-7openalex-snapshot
Designs from subcode supports of linear codes
inferred← citeshttps://doi.org/10.1007/s10623-014-0033-7openalex-snapshot
An upper bound of the value of $$t$$ t of the support $$t$$ t -designs of extremal binary doubly even self-dual codes
inferred← citeshttps://doi.org/10.1007/s10623-017-0376-yopenalex-snapshot
An Assmus–Mattson theorem for codes over commutative association schemes
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.07.018openalex-snapshot
New proofs of the Assmus–Mattson theorem based on the Terwilliger algebra
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.11.001openalex-snapshot
Commutative association schemes
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.004openalex-snapshot
The geometry of vector spaces
inferred← citeshttps://doi.org/10.1017/cbo9781316529836.006openalex-snapshot
The standard geometric codes
inferred← citeshttps://doi.org/10.1023/a:1008327726247openalex-snapshot
Jacobi Polynomials, Type II Codes, and Designs
inferred← citeshttps://doi.org/10.1023/a:1008368615935openalex-snapshot
On Harmonic Weight Enumerators of Binary Codes
inferred← citeshttps://doi.org/10.1023/a:1022494701663openalex-snapshot
The Subconstituent Algebra of an Association Scheme, (Part I)
inferred← citeshttps://doi.org/10.1090/s0002-9947-1993-1134756-0openalex-snapshot
Extending the 𝑡-design concept
inferred← citeshttps://doi.org/10.1109/18.59931openalex-snapshot
A new upper bound on the minimal distance of self-dual codes
inferred← citeshttps://doi.org/10.1109/18.720545openalex-snapshot
Association schemes and coding theory
inferred← citeshttps://doi.org/10.1109/18.720549openalex-snapshot
The art of signaling: fifty years of coding theory
inferred← citeshttps://doi.org/10.1109/18.945246openalex-snapshot
On binary linear codes supporting t-designs
inferred← citeshttps://doi.org/10.1109/tit.2019.2959764openalex-snapshot
Codes, Differentially $\delta$ -Uniform Functions, and $t$ -Designs
inferred← citeshttps://doi.org/10.1137/0406001openalex-snapshot
On Error-Correcting Codes and Invariant Linear Forms
inferred← citeshttps://doi.org/10.1137/18m119183xopenalex-snapshot
An Assmus--Mattson Theorem for Rank Metric Codes
inferred← citeshttps://doi.org/10.1142/9789812837172_0004openalex-snapshot
CODING THEORY AND ALGEBRAIC COMBINATORICS
inferred← citeshttps://doi.org/10.48550/arxiv.1311.2122openalex-snapshot
An upper bound of the value of t of the support t-designs of extremal binary doubly even self-dual 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.