On the public citation graph
MacWilliams Identities and Matroid Polynomials
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.1002/j.1538-7305.1963.tb04003.xopenalex-snapshot
A Theorem on the Distribution of Weights in a Systematic Code†
inferredcites →https://doi.org/10.1002/sapm1976552119openalex-snapshot
Weight Enumeration and the Geometry of Linear Codes
inferredcites →https://doi.org/10.1006/aama.2001.0747openalex-snapshot
Permutations with Restricted Patterns and Dyck Paths
inferredcites →https://doi.org/10.1006/eujc.1996.0044openalex-snapshot
Classification of Forbidden Subsequences of Length 4
inferredcites →https://doi.org/10.1006/jcta.1997.2800openalex-snapshot
Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps
inferredcites →https://doi.org/10.1006/jcta.2000.3110openalex-snapshot
The Umbral Transfer-Matrix Method. I. Foundations
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_21openalex-snapshot
Longest Increasing and Decreasing Subsequences
inferredcites →https://doi.org/10.1007/978-3-0348-8211-8_3openalex-snapshot
Counting Walks in the Quarter Plane
inferredcites →https://doi.org/10.1007/pl00001290openalex-snapshot
Dichromatic Polynomials and Potts Models Summed Over Rooted Maps
inferredcites →https://doi.org/10.1007/pl00001297openalex-snapshot
Vexillary Involutions are Enumerated by Motzkin Numbers
inferredcites →https://doi.org/10.1007/s002000050060openalex-snapshot
The Matroid of Supports of A Linear Code
inferredcites →https://doi.org/10.1016/0012-365x(92)90559-xopenalex-snapshot
Support weight distribution of linear codes
inferredcites →https://doi.org/10.1016/0021-8693(88)90166-4openalex-snapshot
The diagonal of a D-finite power series is D-finite
inferredcites →https://doi.org/10.1016/0024-3795(88)90244-3openalex-snapshot
On the MacWilliams identities for linear codes
inferredcites →https://doi.org/10.1016/0024-3795(93)00106-aopenalex-snapshot
MacWilliams identities and coordinate partitions
inferredcites →https://doi.org/10.1016/0097-3165(78)90068-7openalex-snapshot
The number of baxter permutations
inferredcites →https://doi.org/10.1016/0097-3165(79)90034-7openalex-snapshot
Baxter permutations rise again
inferredcites →https://doi.org/10.1016/0097-3165(90)90060-aopenalex-snapshot
Symmetric functions and P-recursiveness
inferredcites →https://doi.org/10.1016/s0012-365x(00)00035-2openalex-snapshot
Series and parallel reductions for the Tutte polynomial
inferredcites →https://doi.org/10.1016/s0012-365x(00)00139-4openalex-snapshot
Enumeration of vexillary involutions which are equal to their mirror/complement
inferredcites →https://doi.org/10.1016/s0012-365x(96)83009-3openalex-snapshot
Stack words, standard tableaux and Baxter permutations
inferredcites →https://doi.org/10.1016/s0196-8858(02)00012-xopenalex-snapshot
Counting occurrences of a pattern of type (1,2) or (2,1) in permutations
inferredcites →https://doi.org/10.1016/s0304-3975(02)00007-5openalex-snapshot
Basic analytic combinatorics of directed lattice paths
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1023/a:1008330510348openalex-snapshot
The Weight Enumerator of Linear Codes over GF q m) Having Generator Matrix over GF q
inferredcites →https://doi.org/10.1023/a:1015016625432openalex-snapshot
A New Class of Wilf-Equivalent Permutations
inferredcites →https://doi.org/10.1090/s0002-9947-1972-0309764-6openalex-snapshot
A Decomposition for Combinatorial Geometries
inferredcites →https://doi.org/10.1109/18.133259openalex-snapshot
Generalized Hamming weights for linear codes
inferredcites →https://doi.org/10.1515/crll.1893.111.87openalex-snapshot
Ueber eine Anzahlbestimmung und eine damit zusammenhängende Reihe.
inferredcites →https://doi.org/10.37236/1340openalex-snapshot
Lattice walks in $Z^d$ and permutations with no long ascending subsequences
inferredcites →https://doi.org/10.5860/choice.33-2176openalex-snapshot
The encyclopedia of integer sequences
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11535218_20openalex-snapshot
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-21518-6_20openalex-snapshot
Determining Parameters of Key Predistribution Schemes via Linear Codes in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/s10623-008-9222-6openalex-snapshot
Generalized MacWilliams identities and their applications to perfect binary codes
inferred← citeshttps://doi.org/10.1007/s10623-013-9895-3openalex-snapshot
Demi-matroids from codes over finite Frobenius rings
inferred← citeshttps://doi.org/10.1007/s10623-019-00683-0openalex-snapshot
Linear codes over signed graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2005.10.002openalex-snapshot
Extensions of the Critical Theorem
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.064openalex-snapshot
A MacWilliams type identity for matroids
inferred← citeshttps://doi.org/10.1017/9780511982170openalex-snapshot
Codes, Cryptology and Curves with Computer Algebra
inferred← citeshttps://doi.org/10.1109/tit.2008.921692openalex-snapshot
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
inferred← citeshttps://doi.org/10.1109/tit.2010.2054654openalex-snapshot
Code Enumerators and Tutte Polynomials
inferred← citeshttps://doi.org/10.1109/tit.2025.3550982openalex-snapshot
On the MacWilliams Theorem Over Codes and Lattices
inferred← citeshttps://doi.org/10.1137/120876356openalex-snapshot
MacWilliams Identities for $m$-tuple Weight Enumerators
inferred← citeshttps://doi.org/10.1142/9789812388841_0001openalex-snapshot
EXTREMAL PROBLEMS OF CODING THEORY
inferred← citeshttps://doi.org/10.1142/9789814335768_0006openalex-snapshot
Codes, Arrangements and Matroids
inferred← citeshttps://doi.org/10.1515/9783110999365-005openalex-snapshot
133Graph rings and ideals: Wolmer Vasconcelos’ contributions
inferred← citeshttps://doi.org/10.3934/amc.2017035openalex-snapshot
Parity check systems of nonlinear codes over finite commutative Frobenius rings
inferred← citeshttps://doi.org/10.4171/dm/447openalex-snapshot
Counting polynomials for linear codes, hyperplane arrangements, and matroids
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.