On the public citation graph
On defining generalized rank weights
0 signed · 34 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/0097-3165(78)90015-8openalex-snapshot
Bilinear forms over a finite field, with applications to coding theory
inferredcites →https://doi.org/10.1016/j.ffa.2010.01.002openalex-snapshot
Galois invariance, trace codes and subfield subcodes
inferredcites →https://doi.org/10.1016/j.jpaa.2015.10.009openalex-snapshot
Generalized weights: An anticode approach
inferredcites →https://doi.org/10.1090/conm/632/12622openalex-snapshot
Generalized rank weights: A duality statement
inferredcites →https://doi.org/10.1109/18.50376openalex-snapshot
On the dimension of subfield subcodes
inferredcites →https://doi.org/10.1109/allerton.2012.6483264openalex-snapshot
New parameters of linear codes expressing security performance of universal secure network coding
inferredcites →https://doi.org/10.1109/tit.2003.819322openalex-snapshot
Isometries for rank distance and permutation group of gabidulin codes
inferredcites →https://doi.org/10.1109/tit.2015.2429713openalex-snapshot
Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
inferredcites →https://doi.org/10.1109/tit.2016.2570238openalex-snapshot
On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
inferredcites →https://doi.org/10.1142/9789814335768_0006openalex-snapshot
Codes, Arrangements and Matroids
inferredcites →https://doi.org/10.1145/2768577.2768605openalex-snapshot
The extended and generalized rank weight enumerator of a code
inferredcites →https://doi.org/10.48550/arxiv.1305.4047openalex-snapshot
Rank metric and Gabidulin codes in characteristic zero
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jcd.21934openalex-snapshot
Geometric dual and sum‐rank minimal codes
inferred← citeshttps://doi.org/10.1007/s10231-022-01235-5openalex-snapshot
New MRD codes from linear cutting blocking sets
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-020-00750-xopenalex-snapshot
A geometric approach to rank metric codes and a classification of constant weight codes
inferred← citeshttps://doi.org/10.1007/s10623-020-00798-9openalex-snapshot
A polymatroid approach to generalized weights of rank metric codes
inferred← citeshttps://doi.org/10.1007/s10623-022-01181-6openalex-snapshot
Rank weight hierarchy of some classes of polynomial codes
inferred← citeshttps://doi.org/10.1007/s10801-019-00889-4openalex-snapshot
Rank-metric codes and q-polymatroids
inferred← citeshttps://doi.org/10.1007/s10801-022-01129-yopenalex-snapshot
q-polymatroids and their relation to rank-metric codes
inferred← citeshttps://doi.org/10.1007/s10801-023-01269-9openalex-snapshot
Saturating systems and the rank-metric covering radius
inferred← citeshttps://doi.org/10.1007/s10801-024-01321-2openalex-snapshot
The cyclic flats of a q-matroid
inferred← citeshttps://doi.org/10.1007/s40863-022-00314-yopenalex-snapshot
Weight spectra of Gabidulin rank-metric codes and Betti numbers
inferred← citeshttps://doi.org/10.1016/j.disc.2018.06.034openalex-snapshot
On q -Steiner systems from rank metric codes
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113301openalex-snapshot
Some matroids related to sum-rank metric codes
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113605openalex-snapshot
Evasive subspaces, generalized rank weights and near MRD codes
inferred← citeshttps://doi.org/10.1016/j.jcta.2022.105658openalex-snapshot
Linear cutting blocking sets and minimal codes in the rank metric
inferred← citeshttps://doi.org/10.1109/isit.2016.7541641openalex-snapshot
Generalized Rank Weights of Reducible Codes, Optimal Cases, and Related Properties
inferred← citeshttps://doi.org/10.1109/tit.2017.2766292openalex-snapshot
Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks
inferred← citeshttps://doi.org/10.1109/tit.2025.3585604openalex-snapshot
r-Minimal Codes With Respect to Rank Metric
inferred← citeshttps://doi.org/10.1137/23m1564067openalex-snapshot
Higher-Degree Symmetric Rank-Metric Codes
inferred← citeshttps://doi.org/10.1137/23m1584812openalex-snapshot
Maximum Weight Codewords of a Linear Rank-Metric Code
inferred← citeshttps://doi.org/10.3934/amc.2020083openalex-snapshot
Rank weights for arbitrary finite field extensions
inferred← citeshttps://doi.org/10.3934/amc.2026035openalex-snapshot
On the rank weight hierarchy of $ M $ -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.