On the public citation graph

New upper bounds on generalized weights

0 signed · 39 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcta.2001.3176openalex-snapshot
On the Optimum of Delsarte's Linear Program
inferredcites →https://doi.org/10.1007/3-540-57843-9_28openalex-snapshot
Bounds on generalized weights
inferredcites →https://doi.org/10.1007/3-540-60114-7_1openalex-snapshot
Supports of a code
inferredcites →https://doi.org/10.1007/bf01188748openalex-snapshot
The effective length of subcodes
inferredcites →https://doi.org/10.1007/s002000050060openalex-snapshot
The Matroid of Supports of A Linear Code
inferredcites →https://doi.org/10.1016/0012-365x(77)90078-4openalex-snapshot
The weight distribution of irreducible cyclic codes with block lengths n1((q1−1)N)
inferredcites →https://doi.org/10.1016/0012-365x(78)90114-0openalex-snapshot
The weight distribution of linear codes over GF(ql) having generator matrix over GF(q>)
inferredcites →https://doi.org/10.1023/a:1008227811117openalex-snapshot
On Generalized Hamming Weights for Galois Ring Linear Codes
inferredcites →https://doi.org/10.1109/18.133259openalex-snapshot
Generalized Hamming weights for linear codes
inferredcites →https://doi.org/10.1109/18.340462openalex-snapshot
Intersecting codes and independent families
inferredcites →https://doi.org/10.1109/18.340487openalex-snapshot
Upper bounds on generalized distances
inferredcites →https://doi.org/10.1109/18.370144openalex-snapshot
Bounds on the minimum support weights
inferredcites →https://doi.org/10.1109/18.476213openalex-snapshot
Geometric approach to higher weights
inferredcites →https://doi.org/10.1109/18.748991openalex-snapshot
New upper bounds on error exponents
inferredcites →https://doi.org/10.1109/18.748994openalex-snapshot
Binomial moments of the distance distribution: bounds and applications
inferredcites →https://doi.org/10.1109/tit.1977.1055688openalex-snapshot
New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
inferredcites →https://doi.org/10.1515/9783110811056.263openalex-snapshot
An upper bound for generalized Hamming weights

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-4757-6048-4_20openalex-snapshot
A New Upper Bound on Codes Decodable into Size-2 Lists
inferred← citeshttps://doi.org/10.1007/s10623-024-01553-0openalex-snapshot
The weight hierarchies of three classes of linear codes
inferred← citeshttps://doi.org/10.1007/s40840-022-01280-6openalex-snapshot
GHWs of Codes Arising from Cartesian Product of Graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114240openalex-snapshot
The weight hierarchies of linear codes from simplicial complexes
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00152-0openalex-snapshot
Estimates of the Distance Distribution of Codes and Designs
inferred← citeshttps://doi.org/10.1103/physreva.63.032311openalex-snapshot
Asymptotically good quantum codes
inferred← citeshttps://doi.org/10.1109/18.868471openalex-snapshot
A new upper bound on the reliability function of the Gaussian channel
inferred← citeshttps://doi.org/10.1109/18.887851openalex-snapshot
Upper bounds for constant-weight codes
inferred← citeshttps://doi.org/10.1109/18.915662openalex-snapshot
Estimates of the distance distribution of codes and designs
inferred← citeshttps://doi.org/10.1109/allerton49937.2022.9929400openalex-snapshot
Bounds on Reversible, Complement, Reversible-Complement, Constant Weight Sum Codes
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518233openalex-snapshot
The Generalized Covering Radii of Linear Codes
inferred← citeshttps://doi.org/10.1109/ita.2014.6804237openalex-snapshot
Generalized weights and bounds for error probability over erasure channels
inferred← citeshttps://doi.org/10.1109/itw44776.2019.8989391openalex-snapshot
Error Decoding of Locally Repairable and Partial MDS Codes
inferred← citeshttps://doi.org/10.1109/tit.2003.815776openalex-snapshot
List decoding from erasures: bounds and code constructions
inferred← citeshttps://doi.org/10.1109/tit.2014.2314468openalex-snapshot
Erasure List-Decodable Codes From Random and Algebraic Geometry Codes
inferred← citeshttps://doi.org/10.1109/tit.2015.2444013openalex-snapshot
Generalized Hamming Weights of Irreducible Cyclic Codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2570236openalex-snapshot
The Weight Hierarchy of Some Reducible Cyclic Codes
inferred← citeshttps://doi.org/10.1109/tit.2023.3239543openalex-snapshot
The Connections Among Hamming Metric, b -Symbol Metric, and r -th Generalized Hamming Metric
inferred← citeshttps://doi.org/10.1109/tit.2023.3277454openalex-snapshot
Generalized Hamming Weights of Linear Codes From Quadratic Forms Over Finite Fields of Even Characteristic
inferred← citeshttps://doi.org/10.1109/tit.2024.3476974openalex-snapshot
New Solutions to Delsarte’s Dual Linear Programs
inferred← citeshttps://doi.org/10.3934/amc.2010.4.547openalex-snapshot
Bounds for binary codes relative to pseudo-distances of $k$ points
inferred← citeshttps://doi.org/10.48550/arxiv.1505.07278openalex-snapshot
Higher weight distribution of linearized Reed-Solomon 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.