Pages that link to "Item:Q281823"
From MaRDI portal
The following pages link to Construction of optimal constant-dimension subspace codes (Q281823):
Displaying 14 items.
- Construction of subspace codes through linkage (Q326332) (← links)
- Veronese subspace codes (Q329184) (← links)
- Cores and independence numbers of Grassmann graphs (Q1696546) (← links)
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 (Q1727355) (← links)
- Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring (Q1734708) (← links)
- New constructions of optimal subsystem codes (Q2091365) (← links)
- On the \(P_3\)-hull numbers of \(q\)-Kneser graphs and Grassmann graphs (Q2096273) (← links)
- Enhancing Echelon-Ferrers construction for constant dimension code (Q2103101) (← links)
- Large constant dimension codes and lexicodes (Q2275871) (← links)
- Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4 (Q3187290) (← links)
- Efficient encoding for a class of subspace subcodes (Q4503412) (← links)
- (Q4576318) (← links)
- Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction (Q5123893) (← links)
- Locality and Availability of Array Codes Constructed From Subspaces (Q5223958) (← links)