The following pages link to Subspace code constructions (Q2147947):
Displaying 11 items.
- New constructions of optimal subsystem codes (Q2091365) (← links)
- On the sunflower bound for \(k\)-spaces, pairwise intersecting in a point (Q2168074) (← links)
- Subspaces intersecting in at most a point (Q2302159) (← links)
- Identifying High-Dimension Subspace Subcodes of Reed–Solomon Codes (Q3547655) (← links)
- Subspace Codes (Q3654608) (← links)
- Recipes for adjoint code construction (Q3836973) (← links)
- Efficient encoding for a class of subspace subcodes (Q4503412) (← links)
- Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction (Q5123893) (← links)
- Locality and Availability of Array Codes Constructed From Subspaces (Q5223958) (← links)
- Subspace subcodes of generalized Reed-Solomon codes (Q5957984) (← links)
- Small complete caps in PG(4n+1,q)${\rm PG}(4n+1, q)$ (Q6135072) (← links)