On the public citation graph
Weight hierarchy of a product code
0 signed · 22 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.1109/18.133259openalex-snapshot
Generalized Hamming weights for linear codes
inferredcites →https://doi.org/10.1109/18.259662openalex-snapshot
On the generalized Hamming weights of product 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-642-25541-0_37openalex-snapshot
On the Generalized Hamming Weights of Some Product Codes
inferred← citeshttps://doi.org/10.1007/s002000050075openalex-snapshot
Bounds on the Weight Hierarchies of Extremal Non-chain Codes of Dimension 4
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00449-3openalex-snapshot
A lower bound on the weight hierarchies of product codes
inferred← citeshttps://doi.org/10.1016/s0378-3758(00)00250-0openalex-snapshot
Weight hierarchies of linear codes of dimension 3
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00158-1openalex-snapshot
On Weight Hierarchies of Product Codes The Wei-Yang Conjecture and more
inferred← citeshttps://doi.org/10.1023/a:1008225524987openalex-snapshot
Weight Hierarchies of Linear Codes Satisfying the Chain Condition
inferred← citeshttps://doi.org/10.1023/b:desi.0000035465.76668.89openalex-snapshot
On the Weight Hierarchy of Product Codes
inferred← citeshttps://doi.org/10.1049/iet-com.2019.0903openalex-snapshot
Bounds on relative generalised Hamming weight
inferred← citeshttps://doi.org/10.1109/18.490571openalex-snapshot
The weight hierarchies of some product codes
inferred← citeshttps://doi.org/10.1109/18.556621openalex-snapshot
The weight hierarchies of q-ary codes of dimension 4
inferred← citeshttps://doi.org/10.1109/18.641575openalex-snapshot
Bounds on the weight hierarchies of linear codes of dimension 4
inferred← citeshttps://doi.org/10.1109/18.746811openalex-snapshot
Weight hierarchies of extremal non-chain binary codes of dimension 4
inferred← citeshttps://doi.org/10.1109/18.868495openalex-snapshot
The weight hierarchies of some product codes
inferred← citeshttps://doi.org/10.1109/18.887876openalex-snapshot
The weight hierarchy of product codes
inferred← citeshttps://doi.org/10.1109/18.887877openalex-snapshot
New rate-compatible repetition convolutional codes
inferred← citeshttps://doi.org/10.1109/iccc47050.2019.9064373openalex-snapshot
Optimal Code Pairs Satisfying Relative Chain Condition
inferred← citeshttps://doi.org/10.1109/isit.2002.1023505openalex-snapshot
Weight hierarchies of linear codes satisfying the almost chain condition
inferred← citeshttps://doi.org/10.1109/isit.2019.8849486openalex-snapshot
Unrestricted Generalized Column Distances: A Wider Definition
inferred← citeshttps://doi.org/10.1109/tit.2020.2999987openalex-snapshot
Generalized Column Distances
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
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.