On the public citation graph
Bounds on the minimum support weights
0 signed · 76 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/3-540-54522-0_101openalex-snapshot
The 2-nd generalized Hamming weight of double-error correcting binary BCH codes and their dual codes
inferredcites →https://doi.org/10.1007/3-540-57843-9_28openalex-snapshot
Bounds on generalized weights
inferredcites →https://doi.org/10.1007/3-540-58265-7_6openalex-snapshot
Generalizations of the Griesmer bound
inferredcites →https://doi.org/10.1007/978-3-642-58575-3openalex-snapshot
Introduction to Coding Theory
inferredcites →https://doi.org/10.1007/978-3-662-07998-0openalex-snapshot
Introduction to coding theory
inferredcites →https://doi.org/10.1007/bf01388457openalex-snapshot
The weight hierarchies of the projective codes from nondegenerate quadrics
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.1016/0012-365x(92)90559-xopenalex-snapshot
Support weight distribution of linear codes
inferredcites →https://doi.org/10.1016/0012-365x(94)00030-mopenalex-snapshot
The weight hierarchy of the Kasami codes
inferredcites →https://doi.org/10.1016/0097-3165(95)90023-3openalex-snapshot
On the weight hierarchy of irreducible cyclic codes
inferredcites →https://doi.org/10.1109/18.133259openalex-snapshot
Generalized Hamming weights for linear codes
inferredcites →https://doi.org/10.1109/18.135653openalex-snapshot
On the generalized Hamming weights of several classes of cyclic cods
inferredcites →https://doi.org/10.1109/18.135655openalex-snapshot
Generalized Hamming weights of linear codes
inferredcites →https://doi.org/10.1109/18.212298openalex-snapshot
Minimum support weights of binary codes
inferredcites →https://doi.org/10.1109/18.259662openalex-snapshot
On the generalized Hamming weights of product codes
inferredcites →https://doi.org/10.1109/18.272476openalex-snapshot
Codes satisfying the chain condition
inferredcites →https://doi.org/10.1109/18.272498openalex-snapshot
The weight hierarchy of higher dimensional Hermitian codes
inferredcites →https://doi.org/10.1109/iccs.1992.254879openalex-snapshot
Codes, weight hierarchies, and chains
inferredcites →https://doi.org/10.1109/isit.1994.394679openalex-snapshot
Density/length profiles and trellis complexity of linear block codes and lattices
inferredcites →https://doi.org/10.1109/tit.1967.1054053openalex-snapshot
Limit distribution of the minimum distance of random linear codes
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-3-540-77224-8_40openalex-snapshot
On Generalized Hamming Weights and the Covering Radius of Linear Codes
inferred← citeshttps://doi.org/10.1007/s10623-004-1717-1openalex-snapshot
On Linear Codes over $${\mathbb{Z}}_{2^{s}}$$
inferred← citeshttps://doi.org/10.1007/s10623-004-5663-8openalex-snapshot
Higher Weights for Ternary and Quaternary Self-Dual Codes*
inferred← citeshttps://doi.org/10.1007/s10623-011-9597-7openalex-snapshot
Moments of the support weight distribution of linear codes
inferred← citeshttps://doi.org/10.1007/s10623-012-9657-7openalex-snapshot
Code constructions and existence bounds for relative generalized Hamming weight
inferred← citeshttps://doi.org/10.1007/s10623-012-9750-yopenalex-snapshot
On the relative profiles of a linear code and a subcode
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.1007/s10623-024-01553-0openalex-snapshot
The weight hierarchies of three classes of linear codes
inferred← citeshttps://doi.org/10.1007/s10623-025-01758-xopenalex-snapshot
The weight distributions and weight hierarchies of two classes of few-weight linear codes
inferred← citeshttps://doi.org/10.1007/s10623-026-01889-9openalex-snapshot
Generalized Hamming weights of additive codes and geometric counterparts
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/j.ffa.2008.08.001openalex-snapshot
Decomposable subspaces, linear sections of Grassmann varieties, and higher weights of Grassmann codes
inferred← citeshttps://doi.org/10.1016/j.laa.2005.07.008openalex-snapshot
Matrix characterization of linear codes with arbitrary Hamming weight hierarchy
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00341-3openalex-snapshot
Radon transforms and packings
inferred← citeshttps://doi.org/10.1049/iet-com.2019.0903openalex-snapshot
Bounds on relative generalised Hamming weight
inferred← citeshttps://doi.org/10.1109/18.476213openalex-snapshot
Geometric approach to higher weights
inferred← citeshttps://doi.org/10.1109/18.481787openalex-snapshot
The worst case probability of undetected error for linear codes on the local binomial channel
inferred← citeshttps://doi.org/10.1109/18.556112openalex-snapshot
On the information function of an error-correcting code
inferred← citeshttps://doi.org/10.1109/18.567718openalex-snapshot
On generalized Hamming weights of binary primitive BCH codes with minimum distance one less than a power of two
inferred← citeshttps://doi.org/10.1109/18.567719openalex-snapshot
On the generalized Hamming weights of cyclic codes
inferred← citeshttps://doi.org/10.1109/18.641546openalex-snapshot
Generalized Bezout's theorem and its applications in coding theory
inferred← citeshttps://doi.org/10.1109/18.761280openalex-snapshot
New upper bounds on generalized weights
inferred← citeshttps://doi.org/10.1109/18.782160openalex-snapshot
A characterization of certain Griesmer codes: MMD codes in a more general sense
inferred← citeshttps://doi.org/10.1109/18.796389openalex-snapshot
On binary constructions of quantum codes
inferred← citeshttps://doi.org/10.1109/allerton.2015.7447093openalex-snapshot
Weight enumerators and higher support weights of maximally recoverable codes
inferred← citeshttps://doi.org/10.1109/icct.2011.6158023openalex-snapshot
Some new bounds on relative generalized Hamming weight
inferred← citeshttps://doi.org/10.1109/isit.2012.6284028openalex-snapshot
Optimal linear codes with a local-error-correction property
inferred← citeshttps://doi.org/10.1109/isit.2014.6875176openalex-snapshot
Codes with locality for two erasures
inferred← citeshttps://doi.org/10.1109/isit.2014.6875413openalex-snapshot
New asymptotic metrics for relative generalized Hamming weight
inferred← citeshttps://doi.org/10.1109/isit.2017.8006482openalex-snapshot
Generalized column distances for convolutional codes
inferred← citeshttps://doi.org/10.1109/isit.2019.8849486openalex-snapshot
Unrestricted Generalized Column Distances: A Wider Definition
inferred← citeshttps://doi.org/10.1109/iwsda46143.2019.8966115openalex-snapshot
On Asymptotic Analysis of Relative Generalized Hamming Weight
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.2014.2371915openalex-snapshot
On List-Decodability of Random Rank Metric Codes and Subspace 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.2016.2570238openalex-snapshot
On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
inferred← citeshttps://doi.org/10.1109/tit.2018.2834924openalex-snapshot
Weak Flip Codes and their Optimality on the Binary Erasure Channel
inferred← citeshttps://doi.org/10.1109/tit.2019.2934124openalex-snapshot
Codes With Locality for Two Erasures
inferred← citeshttps://doi.org/10.1109/tit.2020.2999987openalex-snapshot
Generalized Column Distances
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.3519672openalex-snapshot
Optimal Few-SSW Linear Codes and Their Subcode Support Weight Distributions
inferred← citeshttps://doi.org/10.1109/tit.2025.3649882openalex-snapshot
The t -Designs and the Subcode Support Weight Distributions of r -GMDS Codes
inferred← citeshttps://doi.org/10.1587/transfun.e100.a.2699openalex-snapshot
On Asymptotically Good Ramp Secret Sharing Schemes
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
inferred← citeshttps://doi.org/10.47749/t/unicamp.2003.273901openalex-snapshot
Edificios de tits, aplicações a teoria dos codigos e sistemas geometricos
inferred← citeshttps://doi.org/10.48550/arxiv.0810.0567openalex-snapshot
Reed-Solomon Subcodes with Nontrivial Traces: Distance Properties and Soft-Decision Decoding
inferred← citeshttps://doi.org/10.48550/arxiv.1401.2693openalex-snapshot
On List-decodability of Random Rank Metric Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1505.07278openalex-snapshot
Higher weight distribution of linearized Reed-Solomon codes
inferred← citeshttps://doi.org/10.48550/arxiv.1806.04474openalex-snapshot
Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions
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.