On the public citation graph
On Error-Correcting Codes and Invariant Linear Forms
0 signed · 26 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/0024-3795(89)90462-xopenalex-snapshot
Fisher type inequalities for Euclidean t-designs
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/s0019-9958(76)90101-7openalex-snapshot
Generalized t-designs and majority decoding of linear codes
inferredcites →https://doi.org/10.1016/s0019-9958(79)90264-xopenalex-snapshot
Generalized t-designs and weighted majority decoding
inferredcites →https://doi.org/10.1017/cbo9781107325425openalex-snapshot
Graph Theory, Coding Theory and Block Designs
inferredcites →https://doi.org/10.1090/s0002-9947-1993-1134756-0openalex-snapshot
Extending the 𝑡-design concept
inferredcites →https://doi.org/10.1109/18.133244openalex-snapshot
A strengthening of the Assmus-Mattson theorem
inferredcites →https://doi.org/10.1137/0134012openalex-snapshot
Hahn Polynomials, Discrete Harmonics, and t -Designs
inferredcites →https://doi.org/10.1137/0509043openalex-snapshot
An Addition Theorem for Hahn Polynomials: The Spherical Functions
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-1-4614-7488-3_4openalex-snapshot
Weighted Generating Functions for Type II Lattices and Codes
inferred← citeshttps://doi.org/10.1007/s00200-022-00571-6openalex-snapshot
On the support t-designs of extremal Type III and IV 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.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.133244openalex-snapshot
A strengthening of the Assmus-Mattson theorem
inferred← citeshttps://doi.org/10.1109/18.945246openalex-snapshot
On binary linear codes supporting t-designs
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.