On the public citation graph
The Matroid of Supports of A Linear Code
0 signed · 41 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.1016/0012-365x(92)90559-xopenalex-snapshot
Support weight distribution of linear codes
inferredcites →https://doi.org/10.1017/s0305004100068936openalex-snapshot
On the computational complexity of the Jones and Tutte polynomials
inferredcites →https://doi.org/10.1109/18.476213openalex-snapshot
Geometric approach to higher weights
inferredcites →https://doi.org/10.7146/math.scand.a-10759openalex-snapshot
Linear Recurring Sequences over Finite Fields.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/eujc.1998.0275openalex-snapshot
An Interpretation for the Tutte Polynomial
inferred← citeshttps://doi.org/10.1007/3-540-44828-4_24openalex-snapshot
On g-th MDS Codes and Matroids
inferred← citeshttps://doi.org/10.1007/978-3-540-24633-6_9openalex-snapshot
Combinatorics of the Two-Variable Zeta Function
inferred← citeshttps://doi.org/10.1007/s10623-012-9715-1openalex-snapshot
Constructing rate 1/p systematic binary quasi-cyclic codes based on the matroid theory
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-018-0576-0openalex-snapshot
Codes with the rank metric and matroids
inferred← citeshttps://doi.org/10.1007/s10623-019-00619-8openalex-snapshot
Theory of supports for linear codes endowed with the sum-rank metric
inferred← citeshttps://doi.org/10.1016/j.disc.2005.10.002openalex-snapshot
Extensions of the Critical Theorem
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.06.002openalex-snapshot
Dual complementary polynomials of graphs and combinatorial–geometric interpretation on the values of Tutte polynomial at positive integers
inferred← citeshttps://doi.org/10.1017/9780511982170openalex-snapshot
Codes, Cryptology and Curves with Computer Algebra
inferred← citeshttps://doi.org/10.1023/a:1008382528138openalex-snapshot
Binomial Moments of the Distance Distribution and the Probability of Undetected Error
inferred← citeshttps://doi.org/10.1023/a:1026162531539openalex-snapshot
Extended Binomial Moments of a Linear Code and the Undetected Error Probability
inferred← citeshttps://doi.org/10.1049/iet-com.2013.0671openalex-snapshot
Use of matroid theory to construct a class of good binary linear codes
inferred← citeshttps://doi.org/10.1109/18.748994openalex-snapshot
Binomial moments of the distance distribution: bounds and applications
inferred← citeshttps://doi.org/10.1109/18.761280openalex-snapshot
New upper bounds on generalized weights
inferred← citeshttps://doi.org/10.1109/allerton.2010.5706929openalex-snapshot
Linear ordered codes, shape enumarators and parallel channels
inferred← citeshttps://doi.org/10.1109/isit.1997.613301openalex-snapshot
Remarks on the MacWilliams identities for higher weights
inferred← citeshttps://doi.org/10.1109/jsait.2023.3300901openalex-snapshot
Capacity of Locally Recoverable Codes
inferred← citeshttps://doi.org/10.1109/tit.2008.924700openalex-snapshot
A Decomposition Theory for Binary Linear Codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2054654openalex-snapshot
Code Enumerators and Tutte Polynomials
inferred← citeshttps://doi.org/10.1109/tit.2016.2555813openalex-snapshot
Optimal Locally Repairable Codes and Connections to Matroid Theory
inferred← citeshttps://doi.org/10.1109/tit.2016.2598149openalex-snapshot
On the Combinatorics of Locally Repairable Codes via Matroid Theory
inferred← citeshttps://doi.org/10.1137/120876356openalex-snapshot
MacWilliams Identities for $m$-tuple Weight Enumerators
inferred← citeshttps://doi.org/10.1137/23m1564067openalex-snapshot
Higher-Degree Symmetric Rank-Metric Codes
inferred← citeshttps://doi.org/10.1137/s0895480199364148openalex-snapshot
On Some Polynomials Related to Weight Enumerators of Linear Codes
inferred← citeshttps://doi.org/10.1142/9789814335768_0006openalex-snapshot
Codes, Arrangements and Matroids
inferred← citeshttps://doi.org/10.17323/1609-4514-2015-15-4-679-702openalex-snapshot
On Linear Ordered Codes
inferred← citeshttps://doi.org/10.37236/1636openalex-snapshot
MacWilliams Identities and Matroid Polynomials
inferred← citeshttps://doi.org/10.47749/t/unicamp.2008.433145openalex-snapshot
Metodos de construção de codigos quanticos CSS e conexões entre codigos quanticos e matroides
inferred← citeshttps://doi.org/10.48550/arxiv.1105.2675openalex-snapshot
Dual complementary polynomials of graphs and combinatorial interpretation on the values of the Tutte polynomial at positive integers
inferred← citeshttps://doi.org/10.48550/arxiv.1803.06041openalex-snapshot
Matroids and Codes with the Rank Metric
inferred← citeshttps://doi.org/10.5070/c63261989openalex-snapshot
Generalized weights of codes over rings and invariants of monomial ideals
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.