On the public citation graph

Geometric dual and sum‐rank minimal codes

0 signed · 56 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.2000.0280openalex-snapshot
Linear (q+1)-fold Blocking Sets in PG(2, q4)
inferredcites →https://doi.org/10.1007/s00493-016-3531-6openalex-snapshot
Maximum Scattered Linear Sets and Complete Caps in Galois Spaces
inferredcites →https://doi.org/10.1007/s00493-023-00030-xopenalex-snapshot
A Large Family of Maximum Scattered Linear Sets of $${{\,\mathrm{{PG}}\,}}(1,q^n)$$ and Their Associated MRD Codes
inferredcites →https://doi.org/10.1007/s10231-022-01235-5openalex-snapshot
New MRD codes from linear cutting blocking sets
inferredcites →https://doi.org/10.1007/s10623-019-00619-8openalex-snapshot
Theory of supports for linear codes endowed with the sum-rank metric
inferredcites →https://doi.org/10.1007/s10623-020-00750-xopenalex-snapshot
A geometric approach to rank metric codes and a classification of constant weight codes
inferredcites →https://doi.org/10.1007/s10623-020-00772-5openalex-snapshot
Hamming and simplex codes for the sum-rank metric
inferredcites →https://doi.org/10.1007/s10623-021-00891-7openalex-snapshot
Scattered subspaces and related codes
inferredcites →https://doi.org/10.1007/s10801-017-0762-6openalex-snapshot
Maximum scattered linear sets and MRD-codes
inferredcites →https://doi.org/10.1007/s10801-019-00930-6openalex-snapshot
Minimal linear codes arising from blocking sets
inferredcites →https://doi.org/10.1007/s10801-023-01269-9openalex-snapshot
Saturating systems and the rank-metric covering radius
inferredcites →https://doi.org/10.1016/j.disc.2009.04.007openalex-snapshot
Linear sets in finite projective spaces
inferredcites →https://doi.org/10.1016/j.disc.2023.113676openalex-snapshot
On the lower bound for the length of minimal codes
inferredcites →https://doi.org/10.1016/j.ffa.2022.102013openalex-snapshot
Sum-rank product codes and bounds on the minimum distance
inferredcites →https://doi.org/10.1016/j.ffa.2022.102045openalex-snapshot
Extending two families of maximum rank distance codes
inferredcites →https://doi.org/10.1016/j.ffa.2023.102272openalex-snapshot
Doubly and triply extended MSRD codes
inferredcites →https://doi.org/10.1016/j.jalgebra.2018.02.005openalex-snapshot
Skew and linearized Reed–Solomon codes and maximum sum rank distance codes over any division ring
inferredcites →https://doi.org/10.1016/j.jcta.2008.02.002openalex-snapshot
Translation dual of a semifield
inferredcites →https://doi.org/10.1016/j.jcta.2022.105658openalex-snapshot
Linear cutting blocking sets and minimal codes in the rank metric
inferredcites →https://doi.org/10.1016/j.jcta.2022.105703openalex-snapshot
The geometry of one-weight codes in the sum-rank metric
inferredcites →https://doi.org/10.1023/a:1005283806897openalex-snapshot
Scattered Spaces with Respect to a Spread in PG(n,q)
inferredcites →https://doi.org/10.1090/conm/632/12633openalex-snapshot
Field reduction and linear sets in finite geometry
inferredcites →https://doi.org/10.1093/oso/9780198502951.001.0001openalex-snapshot
Projective Geometries over Finite Fields
inferredcites →https://doi.org/10.1109/18.476213openalex-snapshot
Geometric approach to higher weights
inferredcites →https://doi.org/10.1109/18.705584openalex-snapshot
Minimal vectors in linear codes
inferredcites →https://doi.org/10.1109/tit.2002.806116openalex-snapshot
On the design of algebraic space-time codes for MIMO block-fading channels
inferredcites →https://doi.org/10.1109/tit.2005.846403openalex-snapshot
A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
inferredcites →https://doi.org/10.1109/tit.2021.3070377openalex-snapshot
Full Characterization of Minimal Linear Codes as Cutting Blocking Sets
inferredcites →https://doi.org/10.1109/tit.2021.3074190openalex-snapshot
Fundamental Properties of Sum-Rank-Metric Codes
inferredcites →https://doi.org/10.1109/tit.2021.3123730openalex-snapshot
Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces
inferredcites →https://doi.org/10.1109/tit.2022.3156206openalex-snapshot
Optimal Anticodes, MSRD Codes, and Generalized Weights in the Sum-Rank Metric
inferredcites →https://doi.org/10.1109/winc.2010.5507933openalex-snapshot
Multishot Codes for Network Coding Using Rank-Metric Codes
inferredcites →https://doi.org/10.1112/blms/18.2.97openalex-snapshot
The Geometry of Two-Weight Codes
inferredcites →https://doi.org/10.1112/jlms.12938openalex-snapshot
Blocking sets, minimal codes and trifferent codes
inferredcites →https://doi.org/10.1137/21m1391493openalex-snapshot
Three Combinatorial Perspectives on Minimal Codes
inferredcites →https://doi.org/10.1137/21m145032xopenalex-snapshot
Small Strong Blocking Sets by Concatenation
inferredcites →https://doi.org/10.1142/9789814719261_0012openalex-snapshot
Scattered spaces in Galois geometry
inferredcites →https://doi.org/10.1561/0100000120openalex-snapshot
Codes in the Sum-Rank Metric: Fundamentals and Applications
inferredcites →https://doi.org/10.37236/12046openalex-snapshot
Outer Strong Blocking Sets
inferredcites →https://doi.org/10.37236/4149openalex-snapshot
Lines in Higgledy-Piggledy Arrangement
inferredcites →https://doi.org/10.3934/amc.2011.5.119openalex-snapshot
Linear nonbinary covering codes and saturating sets in projective spaces
inferredcites →https://doi.org/10.3934/amc.2017014openalex-snapshot
On defining generalized rank weights
inferredcites →https://doi.org/10.4171/emss/77openalex-snapshot
On subspace designs
inferredcites →https://doi.org/10.48550/arxiv.2001.10067openalex-snapshot
Connections between scattered linear sets and MRD-codes
inferredcites →https://doi.org/10.5817/cz.muni.eurocomb23-003openalex-snapshot
Expander graphs, strong blocking sets and minimal codes

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.21972openalex-snapshot
On MSRD Codes, h‐Designs and Disjoint Maximum Scattered Linear Sets
inferred← citeshttps://doi.org/10.1007/s10623-025-01628-6openalex-snapshot
The geometry of covering codes in the sum–rank metric
inferred← citeshttps://doi.org/10.1016/j.ffa.2025.102788openalex-snapshot
One-weight codes in the sum-rank metric
inferred← citeshttps://doi.org/10.1016/j.laa.2025.07.037openalex-snapshot
Completely decomposable rank-metric codes
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619635openalex-snapshot
Two-Weight Rank-Metric Codes
inferred← citeshttps://doi.org/10.1109/tit.2023.3339808openalex-snapshot
Eigenvalue Bounds for Sum-Rank-Metric Codes
inferred← citeshttps://doi.org/10.1109/tit.2024.3488902openalex-snapshot
A Linear Programming Bound for Sum-Rank Metric Codes
inferred← citeshttps://doi.org/10.1109/tit.2025.3585604openalex-snapshot
r-Minimal Codes With Respect to Rank Metric
inferred← citeshttps://doi.org/10.1109/tit.2025.3619572openalex-snapshot
Construction and Fast Decoding of Binary Linear Sum-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.3390/math13172756openalex-snapshot
PSO-Guided Construction of MRD Codes for Rank Metrics
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.