Pages that link to "Item:Q2637329"
From MaRDI portal
The following pages link to Partial spreads in random network coding (Q2637329):
Displaying 16 items.
- Construction of subspace codes through linkage (Q326332) (← links)
- The maximum size of a partial spread. II: Upper bounds (Q526224) (← links)
- Hamming and simplex codes for the sum-rank metric (Q782849) (← links)
- Optimum distance flag codes from spreads via perfect matchings in graphs (Q825551) (← links)
- Equidistant subspace codes (Q898789) (← links)
- Message encoding and retrieval for spread and cyclic orbit codes (Q1696050) (← links)
- Flag codes from planar spreads in network coding (Q1994965) (← links)
- An asymptotically optimal construction of almost affinely disjoint subspaces (Q2081335) (← links)
- Flag codes: distance vectors and cardinality bounds (Q2093501) (← links)
- Flag codes of maximum distance and constructions using Singer groups (Q2123306) (← links)
- Partition-balanced families of codes and asymptotic enumeration in coding theory (Q2299619) (← links)
- A construction of abelian non-cyclic orbit codes (Q2325288) (← links)
- The maximum size of a partial spread in a finite projective space (Q2401987) (← links)
- Subspace codes from Ferrers diagrams (Q5272572) (← links)
- Almost affinely disjoint subspaces and covering Grassmannian codes (Q6063245) (← links)
- Constructions of optimum distance full flag codes (Q6156913) (← links)
