Pages that link to "Item:Q1620978"
From MaRDI portal
The following pages link to Binary subspace codes in small ambient spaces (Q1620978):
Displaying 13 items.
- Constructions and bounds for mixed-dimension subspace codes (Q326349) (← links)
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 (Q1727355) (← links)
- Geometrically uniform \(n\)-shot subspace codes (Q1743277) (← links)
- Linearity and complements in projective space (Q1932582) (← links)
- Subspace packings: constructions and bounds (Q2200513) (← links)
- On lattices, binary codes, and network codes (Q2275875) (← links)
- Johnson type bounds for mixed dimension subspace codes (Q2323816) (← links)
- Partial spreads in random network coding (Q2637329) (← links)
- Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4 (Q3187290) (← links)
- Subspace Codes (Q3654608) (← links)
- Efficient encoding for a class of subspace subcodes (Q4503412) (← links)
- Subspace code based on flats in affine space over finite fields (Q4644788) (← links)
- Locality and Availability of Array Codes Constructed From Subspaces (Q5223958) (← links)