On the public citation graph

On the Feng-Rao Bound for Generalized Hamming Weights

0 signed · 25 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/ffta.2001.0347openalex-snapshot
On the Structure of Order Domains
inferredcites →https://doi.org/10.1007/3-540-45624-4_17openalex-snapshot
On Hyperbolic Codes
inferredcites →https://doi.org/10.1007/3-540-63163-1_24openalex-snapshot
On generalized Hamming weights of codes constructed on affine algebraic sets
inferredcites →https://doi.org/10.1007/978-3-7091-2786-5_20openalex-snapshot
On the Efficient Decoding of Algebraic-Geometric Codes
inferredcites →https://doi.org/10.1109/18.133259openalex-snapshot
Generalized Hamming weights for linear codes
inferredcites →https://doi.org/10.1109/18.179340openalex-snapshot
Decoding algebraic-geometric codes up to the designed minimum distance
inferredcites →https://doi.org/10.1109/18.476241openalex-snapshot
Improved geometric Goppa codes. I. Basic theory
inferredcites →https://doi.org/10.1109/18.476245openalex-snapshot
The minimum distance of codes in an array coming from telescopic semigroups
inferredcites →https://doi.org/10.1109/18.651015openalex-snapshot
Generalized Hamming weights of q-ary Reed-Muller codes
inferredcites →https://doi.org/10.1109/18.720550openalex-snapshot
Algebraic-geometry codes
inferredcites →https://doi.org/10.1109/isit.1998.708683openalex-snapshot
Lower bound on generalized Hamming weights in terms of a notion of well-behaving
inferredcites →https://doi.org/10.1109/isit.2000.866464openalex-snapshot
A dual of well-behaving type designed minimum distance
inferredcites →https://doi.org/10.1109/isit.2004.1365113openalex-snapshot
The missing evaluation codes from order domain theory
inferredcites →https://doi.org/10.1137/s089548019834342xopenalex-snapshot
The Weight Hierarchy of Hermitian 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-93806-4_8openalex-snapshot
Algebraic Geometry Codes from Order Domains
inferred← citeshttps://doi.org/10.1007/s10623-014-9983-zopenalex-snapshot
An improvement of the Feng–Rao bound for primary codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2006.12.004openalex-snapshot
Evaluation codes from order domain theory
inferred← citeshttps://doi.org/10.1016/j.ffa.2013.03.005openalex-snapshot
Feng–Rao decoding of primary codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.05.006openalex-snapshot
Further improvements on the Feng–Rao bound for dual codes
inferred← citeshttps://doi.org/10.1109/itw.2014.6970808openalex-snapshot
Relative generalized Hamming weights of one-point algebraic geometric codes
inferred← citeshttps://doi.org/10.1109/tit.2014.2345375openalex-snapshot
Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes
inferred← citeshttps://doi.org/10.1142/9789812794017_0004openalex-snapshot
Evaluation Codes from an Affine Variety Code Perspective
inferred← citeshttps://doi.org/10.1142/9789812794017_0010openalex-snapshot
Generalized Hamming Weights and Trellis Complexity
inferred← citeshttps://doi.org/10.14393/ufu.di.2013.175openalex-snapshot
Códigos de avaliação a partir de uma perspectiva de códigos de variedades afins
inferred← citeshttps://doi.org/10.14393/ufu.di.2013.98openalex-snapshot
A cota de Andersen-Geil para distância mínima de códigos e aplicações
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.