Pages that link to "Item:Q2989420"

The following pages link to Codes and Designs Related to Lifted MRD Codes (Q2989420):

Displaying 47 items.

• Construction of subspace codes through linkage (Q326332) (← links)
• Constructions and bounds for mixed-dimension subspace codes (Q326349) (← links)
• Rank subcodes in multicomponent network coding (Q361696) (← links)
• On transitive parallelisms of \(\mathrm{PG}(3,4)\) (Q371236) (← links)
• On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes (Q398944) (← links)
• Classification of large partial plane spreads in \(\mathrm{PG}(6,2)\) and related combinatorial objects (Q669602) (← links)
• New parallelisms of \(\operatorname{PG}(3,5)\) with automorphisms of order 8 (Q832002) (← links)
• A note on equidistant subspace codes (Q897616) (← links)
• Galois geometries and coding theory (Q908053) (← links)
• Binary subspace codes in small ambient spaces (Q1620978) (← links)
• Constant dimension codes from Riemann-Roch spaces (Q1691237) (← links)
• Message encoding and retrieval for spread and cyclic orbit codes (Q1696050) (← links)
• Anticode-based locally repairable codes with high availability (Q1696053) (← links)
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 (Q1727355) (← links)
• Types of spreads and duality of the parallelisms of \(\mathrm{PG}(3,5)\) with automorphisms of order 13 (Q1727364) (← links)
• New parallelisms of \(\mathrm{PG}(3, 4)\) (Q1743307) (← links)
• A new approach for examining \(q\)-Steiner systems (Q1753104) (← links)
• Constructions of optimal Ferrers diagram rank metric codes (Q1755997) (← links)
• Book spreads in \(\mathrm{PG}(7,2)\) (Q2017060) (← links)
• Orbit codes from forms on vector spaces over a finite field (Q2070263) (← links)
• An asymptotically optimal construction of almost affinely disjoint subspaces (Q2081335) (← links)
• Parallel sub-code construction for constant-dimension codes (Q2099164) (← links)
• Backtrack search for parallelisms of projective spaces (Q2115893) (← links)
• New constant dimension subspace codes from block inserting constructions (Q2130029) (← links)
• New constant dimension subspace codes from parallel linkage construction and multilevel construction (Q2130037) (← links)
• Subspace code constructions (Q2147947) (← links)
• Subspace packings: constructions and bounds (Q2200513) (← links)
• Covering of subspaces by subspaces (Q2248651) (← links)
• Several classes of optimal Ferrers diagram rank-metric codes (Q2273871) (← links)
• Subspaces intersecting in at most a point (Q2302159) (← links)
• Binary additive MRD codes with minimum distance \(n-1\) must contain a semifield spread set (Q2329397) (← links)
• On point-transitive and transitive deficiency one parallelisms of \(\mathrm{PG}(3,4)\) (Q2339129) (← links)
• New constructions of constant dimension codes by improved inserting construction (Q2698184) (← links)
• Improved generalized block inserting construction of constant dimension codes (Q2698341) (← links)
• New Regular Parallelisms of PG(3, 5) (Q2831138) (← links)
• <i>q</i>-Analogs of Packing Designs (Q3191439) (← links)
• New Lower Bounds for Binary Constant-Dimension Subspace Codes (Q4643732) (← links)
• (Q5241131) (← links)
• Partial ‐Parallelisms in Finite Projective Spaces (Q5249055) (← links)
• Subspace codes from Ferrers diagrams (Q5272572) (← links)
• Constant dimension codes from multilevel construction based on matchings of complete hypergraphs (Q6041574) (← links)
• Construction of constant dimension codes via improved inserting construction (Q6056622) (← links)
• Almost affinely disjoint subspaces and covering Grassmannian codes (Q6063245) (← links)
• Generalized block inserting for constructing new constant dimension codes (Q6101845) (← links)
• Bilateral multilevel construction of constant dimension codes (Q6112215) (← links)
• Combining subspace codes (Q6112253) (← links)
• New constant dimension subspace codes from improved parallel subcode construction (Q6585254) (← links)