Asymptotically optimal [2k+1,k,k]_q-almost affinely disjoint subspaces

DOI10.1016/J.DISC.2024.114140MaRDI QIDQ6570056zbMATH OpenFDO

Authors Baran Düzgün, Talha Arıkan, Kamil Otal, Ferruh Özbudak

Publication date 10 July 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2024.114140

zbMATH Keywords

almost affinely disjoint subspaceasymptotically optimal familiesCramer's rulepartial spreadVan der Monde matrices

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Spreads and packing problems in finite geometry (51E23) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• An asymptotically optimal construction of almost affinely disjoint subspaces
• Almost affinely disjoint subspaces and covering Grassmannian codes
• Almost affinely disjoint subspaces
• New constructions of large cyclic subspace codes and Sidon spaces
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4

Cites work

• A Rank-Metric Approach to Error Control in Random Network Coding
• Almost affinely disjoint subspaces
• Almost affinely disjoint subspaces and covering Grassmannian codes
• An asymptotically optimal construction of almost affinely disjoint subspaces
• Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
• Batch codes and their applications
• Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction
• Construction of subspace codes through linkage
• Explicit subspace designs
• Fundamentals of Error-Correcting Codes
• Generalized Linkage Construction for Constant-Dimension Codes
• Improved upper bounds for partial spreads
• MRD codes: constructions and connections
• New constant dimension subspace codes from parallel linkage construction and multilevel construction
• Partial spreads in random network coding
• Subspace designs based on algebraic function fields
• Subspace packings: constructions and bounds

Cited in

(2)

• Almost affinely disjoint subspaces and covering Grassmannian codes
• An explicit construction of asymptotically optimal \([n=t(2k+1),tk,k]_q\)-AAD families

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)