Asymptotically optimal \([2k+1,k,k]_q\)-almost affinely disjoint subspaces
DOI10.1016/J.DISC.2024.114140MaRDI QIDQ6570056
Baran Düzgün, Kamil Otal, Ferruh Özbudak, Talha Arıkan
Publication date: 10 July 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Cramer's rulepartial spreadVan der Monde matricesalmost affinely disjoint subspaceasymptotically optimal families
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Combinatorial aspects of finite geometries (05B25) Spreads and packing problems in finite geometry (51E23)
Cites Work
- Construction of subspace codes through linkage
- Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
- Almost affinely disjoint subspaces
- An asymptotically optimal construction of almost affinely disjoint subspaces
- New constant dimension subspace codes from parallel linkage construction and multilevel construction
- Subspace packings: constructions and bounds
- Explicit subspace designs
- Improved upper bounds for partial spreads
- Partial spreads in random network coding
- 13. MRD codes: constructions and connections
- Batch codes and their applications
- A Rank-Metric Approach to Error Control in Random Network Coding
- Fundamentals of Error-Correcting Codes
- Subspace designs based on algebraic function fields
- Generalized Linkage Construction for Constant-Dimension Codes
- Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction
- Almost affinely disjoint subspaces and covering Grassmannian codes
This page was built for publication: Asymptotically optimal \([2k+1,k,k]_q\)-almost affinely disjoint subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570056)
