Pages that link to "Item:Q2345600"
From MaRDI portal
The following pages link to Equidistant codes in the Grassmannian (Q2345600):
Displaying 14 items.
- Optimum distance flag codes from spreads via perfect matchings in graphs (Q825551) (← links)
- A note on equidistant subspace codes (Q897616) (← links)
- Equidistant subspace codes (Q898789) (← links)
- Galois geometries and coding theory (Q908053) (← links)
- On primitive constant dimension codes and a geometrical sunflower bound (Q1691245) (← links)
- Flag codes from planar spreads in network coding (Q1994965) (← links)
- Properties of sets of subspaces with constant intersection dimension (Q2025357) (← links)
- Improvement to the sunflower bound for a class of equidistant constant dimension subspace codes (Q2035132) (← links)
- On sets of subspaces with two intersection dimensions and a geometrical junta bound (Q2168073) (← links)
- On the sunflower bound for \(k\)-spaces, pairwise intersecting in a point (Q2168074) (← links)
- Perfect LRCs and \(k\)-optimal LRCs (Q2697472) (← links)
- Two coloring problems on matrix graphs (Q2821120) (← links)
- LONELY RUNNERS IN FUNCTION FIELDS (Q5376525) (← links)
- The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds (Q6671386) (← links)
