An asymptotically optimal construction of almost affinely disjoint subspaces
From MaRDI portal
Publication:2081335
DOI10.1016/j.ffa.2022.102099zbMath1498.51009OpenAlexW4293281393MaRDI QIDQ2081335
Publication date: 12 October 2022
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2022.102099
partial spreadsMRD codessubspace designslifting methodalmost affinely disjoint subspaceslinkage construction
Spreads and packing problems in finite geometry (51E23) Polynomials over finite fields (11T06) Designs and configurations (05B99)
Related Items (1)
Cites Work
- Unnamed Item
- Non-linear maximum rank distance codes
- A new family of linear maximum rank distance codes
- Construction of subspace codes through linkage
- Explicit constructions of some non-Gabidulin linear maximum rank distance codes
- Generalized twisted Gabidulin codes
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Recursive constructions for large caps
- Some new non-additive maximum rank distance codes
- Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
- Almost affinely disjoint subspaces
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Subspace packings: constructions and bounds
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- Explicit subspace designs
- Improved upper bounds for partial spreads
- Partial spreads in random network coding
- Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric Codes
- Additive Rank Metric Codes
- Codes and Designs Related to Lifted MRD Codes
- 13. MRD codes: constructions and connections
- Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance
- Batch codes and their applications
- A Rank-Metric Approach to Error Control in Random Network Coding
- A New Family of MRD Codes in <inline-formula> <tex-math notation="LaTeX">$\mathbb{F_q}^{2n\times2n}$ </tex-math> </inline-formula> With Right and Middle Nuclei <inline-formula> <tex-math notation="LaTeX">$\mathbb F_{q^n}$ </tex-math> </inline-formula>
- Subspace designs based on algebraic function fields
- Generalized Linkage Construction for Constant-Dimension Codes
- Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction
- Error-Correcting Codes in Projective Space
- List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication: An asymptotically optimal construction of almost affinely disjoint subspaces
