Pages that link to "Item:Q1009103"
From MaRDI portal
The following pages link to Johnson type bounds on constant dimension codes (Q1009103):
Displaying 38 items.
- Construction of optimal constant-dimension subspace codes (Q281823) (← links)
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques (Q398965) (← links)
- Galois geometries and coding theory (Q908053) (← links)
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases (Q1620975) (← links)
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 (Q1727355) (← links)
- Constructions of cyclic constant dimension codes (Q1752543) (← links)
- Constructions of optimal Ferrers diagram rank metric codes (Q1755997) (← links)
- Linearity and complements in projective space (Q1932582) (← links)
- Error-correcting codes in attenuated space over finite fields (Q2011485) (← links)
- New constructions of orbit codes based on the operations of orbit codes (Q2025223) (← links)
- A family of linear codes from constant dimension subspace codes (Q2068376) (← links)
- Bounds on the cardinality of subspace codes with non-maximum code distance (Q2068654) (← links)
- Orbit codes from forms on vector spaces over a finite field (Q2070263) (← links)
- Flag codes: distance vectors and cardinality bounds (Q2093501) (← links)
- New constant dimension subspace codes from parallel linkage construction and multilevel construction (Q2130037) (← links)
- Constructions of rank metric codes under actions of the unitary groups (Q2132523) (← links)
- Subspace code constructions (Q2147947) (← links)
- Deterministic construction of compressed sensing matrices from constant dimension codes (Q2197399) (← links)
- Subspace packings: constructions and bounds (Q2200513) (← links)
- Bounds on subspace codes based on subspaces of type \((s,0,0,0)\) in pseudo-symplectic spaces and singular pseudo-symplectic spaces (Q2243293) (← links)
- Bounds for flag codes (Q2243893) (← links)
- Johnson type bounds for mixed dimension subspace codes (Q2323816) (← links)
- Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space (Q2336478) (← links)
- Equidistant codes in the Grassmannian (Q2345600) (← links)
- Cyclic orbit codes and stabilizer subfields (Q2346710) (← links)
- Multicomponent codes with maximum code distance (Q2364473) (← links)
- Cyclic constant dimension subspace codes via the sum of Sidon spaces (Q2697471) (← links)
- Subspace code based on flats in affine space over finite fields (Q4644788) (← links)
- Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2 (Q5205027) (← links)
- A Note on Optimal Constant Dimension Codes (Q5250281) (← links)
- Bounds on subspace codes based on totally isotropic subspaces in unitary spaces (Q5298339) (← links)
- Constant dimension codes from multilevel construction based on matchings of complete hypergraphs (Q6041574) (← links)
- Almost affinely disjoint subspaces and covering Grassmannian codes (Q6063245) (← links)
- Bilateral multilevel construction of constant dimension codes (Q6112215) (← links)
- The interplay of different metrics for the construction of constant dimension codes (Q6112228) (← links)
- Combining subspace codes (Q6112253) (← links)
- Weakly resolvable block designs and nonbinary codes meeting the Johnson bound (Q6173444) (← links)
- New constructions of constant dimension subspace codes with large sizes (Q6499105) (← links)