On the public citation graph
Bounds on the Weight Hierarchies of Extremal Non-chain Codes of Dimension 4
0 signed · 23 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.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.1109/18.133259openalex-snapshot
Generalized Hamming weights for linear codes
inferredcites →https://doi.org/10.1109/18.135655openalex-snapshot
Generalized Hamming weights of linear codes
inferredcites →https://doi.org/10.1109/18.179366openalex-snapshot
On the optimum bit orders with respect to the state complexity of trellis diagrams for binary 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.312184openalex-snapshot
Maximum-likelihood soft decision decoding of BCH codes
inferredcites →https://doi.org/10.1109/18.340452openalex-snapshot
Dimension/length profiles and trellis complexity of linear block codes
inferredcites →https://doi.org/10.1109/18.481787openalex-snapshot
The worst case probability of undetected error for linear codes on the local binomial channel
inferredcites →https://doi.org/10.1109/18.490571openalex-snapshot
The weight hierarchies of some product codes
inferredcites →https://doi.org/10.1109/18.556621openalex-snapshot
The weight hierarchies of q-ary codes of dimension 4
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45624-4_10openalex-snapshot
Duality and Greedy Weights of Linear Codes and Projective Multisets
inferred← citeshttps://doi.org/10.1007/s10114-004-0337-zopenalex-snapshot
Finite Projective Geometries and Classification of the Weight Hierarchies of Codes (I)
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00131-5openalex-snapshot
Upper bounds on weight hierarchies of extremal non-chain codes
inferred← citeshttps://doi.org/10.1080/10020070512331342920openalex-snapshot
Weight hierarchies of linear codes satisfying the Near-Chain condition
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.887876openalex-snapshot
The weight hierarchy of product codes
inferred← citeshttps://doi.org/10.1109/isit.2000.866553openalex-snapshot
Projective systems and higher weights
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.1360/03yf9015openalex-snapshot
Weight hierarchies of linear codes satisfying the almost chain condition
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.