An asymptotically optimal construction of almost affinely disjoint subspaces
From MaRDI portal
Publication:2081335
Recommendations
- Almost affinely disjoint subspaces
- On the approximation between affine subspaces
- A pairwise almost disjoint subspace of \(k^{\mathbb{N}}\) of maximal dimension
- Almost affinely disjoint subspaces and covering Grassmannian codes
- scientific article; zbMATH DE number 4188744
- Almost disjoint families: an application to linear algebra
- A class of d-disjunct matrices constructed by subspaces
- On best p-approximation from affine subspaces: Asymptotic expansion
- scientific article; zbMATH DE number 1275127
- Generalizing the Johnson--Lindenstrauss lemma to \(k\)-dimensional affine subspaces
Cites work
- A new family of linear maximum rank distance codes
- 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>
- A Rank-Metric Approach to Error Control in Random Network Coding
- Additive Rank Metric Codes
- Almost affinely disjoint subspaces
- Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
- Batch codes and their applications
- Bilinear forms over a finite field, with applications to coding theory
- Codes and Designs Related to Lifted MRD Codes
- Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction
- Construction of subspace codes through linkage
- Error-Correcting Codes in Projective Space
- Evading subspaces over large fields and explicit list-decodable rank-metric codes
- Explicit constructions of some non-Gabidulin linear maximum rank distance codes
- Explicit subspace designs
- Generalized Linkage Construction for Constant-Dimension Codes
- Generalized twisted Gabidulin codes
- scientific article; zbMATH DE number 7250144 (Why is no real title available?)
- Improved upper bounds for partial spreads
- List decoding Reed-Solomon, algebraic-geometric, and Gabidulin subcodes up to the Singleton bound
- Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance
- Maximum-rank array codes and their application to crisscross error correction
- MRD codes: constructions and connections
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Non-linear maximum rank distance codes
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- Partial spreads in random network coding
- Recursive constructions for large caps
- Some new non-additive maximum rank distance codes
- Subspace designs based on algebraic function fields
- Subspace packings: constructions and bounds
- Theory of codes with maximum rank distance
Cited in
(6)- Almost affinely disjoint subspaces
- ON THE DISJOINTNESS OF ALGEBRAICALLY CONSTRUCTED COSTAS ARRAYS
- Almost affinely disjoint subspaces and covering Grassmannian codes
- Asymptotically optimal \([2k+1,k,k]_q\)-almost affinely disjoint subspaces
- An explicit construction of asymptotically optimal \([n=t(2k+1),tk,k]_q\)-AAD families
- Two new constructions of almost MFRD codes
This page was built for publication: An asymptotically optimal construction of almost affinely disjoint subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2081335)
