The following pages link to Equidistant subspace codes (Q898789):
Displaying 12 items.
- Optimum distance flag codes from spreads via perfect matchings in graphs (Q825551) (← links)
- Equidistant frequency permutation arrays and related constant composition codes (Q849359) (← links)
- A note on equidistant subspace codes (Q897616) (← links)
- Flag codes from planar spreads in network coding (Q1994965) (← links)
- A stability result and a spectrum result on constant dimension codes (Q2020708) (← 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)
- A family of linear codes from constant dimension subspace codes (Q2068376) (← links)
- A construction of abelian non-cyclic orbit codes (Q2325288) (← links)
- Equidistant codes in the Grassmannian (Q2345600) (← links)
- Subspace Codes (Q3654608) (← links)
- Cross Subspace Alignment Codes for Coded Distributed Batch Computation (Q5001585) (← links)