On the public citation graph
�ber die Identit�t von MacWilliams f�r die Gewichtsfunktion von Codes
0 signed · 30 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/0097-3165(86)90032-4openalex-snapshot
Über den p-rang von inzidenzmatrizen
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1017/cbo9781107325425openalex-snapshot
Graph Theory, Coding Theory and Block Designs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/ffta.1998.0233openalex-snapshot
On the Hamming Weight Enumerators of Self-Dual Codes over Zk
inferred← citeshttps://doi.org/10.1007/3-540-46796-3_36openalex-snapshot
Linear Codes and Polylinear Recurrences over Finite Rings and Modules (A Survey)
inferred← citeshttps://doi.org/10.1007/3-540-63163-1_21openalex-snapshot
Formal duality of linearly presentable codes over a Galois field
inferred← citeshttps://doi.org/10.1007/978-1-4757-6048-4_27openalex-snapshot
The MacWilliams Identity for Linear Codes over Galois Rings
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_13openalex-snapshot
An Introduction to Ring-Linear Coding Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-56755-1_21openalex-snapshot
MacWilliams Identities for Linear Codes over Finite Frobenius Rings
inferred← citeshttps://doi.org/10.1007/bf01198572openalex-snapshot
Selbstduale Codes �ber dem Ring der ganzen Zahlen modulo 4
inferred← citeshttps://doi.org/10.1007/s10623-012-9725-zopenalex-snapshot
On some new m-spotty Lee weight enumerators
inferred← citeshttps://doi.org/10.1007/s10623-014-9940-xopenalex-snapshot
Fourier-reflexive partitions and MacWilliams identities for additive codes
inferred← citeshttps://doi.org/10.1007/s11424-012-9219-0openalex-snapshot
A MacWilliams type identity on Lee weight for linear codes over $$\mathbb{F}_2 + u\mathbb{F}_2^*$$
inferred← citeshttps://doi.org/10.1007/s11424-015-2246-xopenalex-snapshot
Macwilliams identities of linear codes over the ring F 2 + uF 2 + vF 2
inferred← citeshttps://doi.org/10.1016/0097-3165(93)90070-oopenalex-snapshot
Self-dual codes over the integers modulo 4
inferred← citeshttps://doi.org/10.1016/j.disc.2012.07.030openalex-snapshot
On MacWilliams type identities for r -fold joint m -spotty weight enumerators
inferred← citeshttps://doi.org/10.1016/j.disc.2013.05.014openalex-snapshot
On a g -fold joint m -spotty Lee weight enumerator
inferred← citeshttps://doi.org/10.1016/j.laa.2022.06.013openalex-snapshot
Density of free modules over finite chain rings
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00006-xopenalex-snapshot
Cyclic codes over finite rings
inferred← citeshttps://doi.org/10.1023/a:1008767703006openalex-snapshot
Singleton Bounds for Codes over Finite Rings
inferred← citeshttps://doi.org/10.1090/s0273-0979-1993-00426-9openalex-snapshot
A linear construction for certain Kerdock and Preparata codes
inferred← citeshttps://doi.org/10.1109/18.312154openalex-snapshot
The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
inferred← citeshttps://doi.org/10.1109/18.556115openalex-snapshot
Translation-invariant propelinear codes
inferred← citeshttps://doi.org/10.1109/18.737540openalex-snapshot
Double circulant self-dual codes over Z/sub 2k/
inferred← citeshttps://doi.org/10.1109/18.904543openalex-snapshot
The complete weight enumerator of Type II codes over Z/sub 2m/ and Jacobi forms
inferred← citeshttps://doi.org/10.1109/tit.2012.2189924openalex-snapshot
MacWilliams Type Identities for Some New $m$-Spotty Weight Enumerators
inferred← citeshttps://doi.org/10.1353/ajm.1999.0024openalex-snapshot
Duality for modules over finite rings and applications to coding theory
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.