Almost affinely disjoint subspaces

DOI10.1016/j.ffa.2021.101879zbMath1471.51005arXiv2007.01792OpenAlexW3040303918MaRDI QIDQ1979948

Ilya Vorobyev, Antonia Wachter-Zeh, Nikita Polianskii, Hedongliang Liu

Publication date: 3 September 2021

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.01792

zbMATH Keywords

subspace designpartial spreadalmost affinely disjoint subspaces

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other designs, configurations (05B30) Spreads and packing problems in finite geometry (51E23) Polynomials over finite fields (11T06)

Related Items (2)

Almost affinely disjoint subspaces and covering Grassmannian codes ⋮ An asymptotically optimal construction of almost affinely disjoint subspaces

Cites Work

• Unnamed Item
• Unnamed Item
• Lower bounds on \(m_t(r,s)\)
• Recursive constructions for large caps
• Explicit subspace designs
• Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric Codes
• Long Nonbinary Codes Exceeding the Gilbert–Varshamov Bound for any FixedDistance
• Batch codes and their applications
• Subspace designs based on algebraic function fields
• List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound

This page was built for publication: Almost affinely disjoint subspaces