Cyclically covering subspaces in F₂^n
DOI10.1016/J.JCTA.2021.105436zbMATH Open1462.05056arXiv1903.10613OpenAlexW3130256170MaRDI QIDQ2019622FDOQ2019622
Authors: James Aaronson, Carla Groenland, Tom Johnston
Publication date: 21 April 2021
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.10613
Recommendations
- Smallest cyclically covering subspaces of \(\mathbb{F}_q^n\), and lower bounds in Isbell's conjecture
- A subspace covering problem in the \(n\)-cube
- Cyclic codes and the Frobenius automorphism
- A recursive construction for universal cycles of 2-subspaces
- New constructions of large cyclic subspace codes and Sidon spaces
Polynomials over finite fields (11T06) Combinatorial aspects of packing and covering (05B40) Arithmetic combinatorics; higher degree uniformity (11B30) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Title not available (Why is that?)
- Structural additive theory. Based on courses given at Karl-Franzens-Universität Graz, Austria, 2008--2012
- ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
- On Artin's conjecture.
- Intersecting families of finite sets and fixed-point-free 2-elements
- Research problems
- An inverse theorem mod p
- Large sets with small doubling modulo \(p\) are well covered by an arithmetic progression
- Smallest cyclically covering subspaces of \(\mathbb{F}_q^n\), and lower bounds in Isbell's conjecture
Cited In (3)
This page was built for publication: Cyclically covering subspaces in \(\mathbb{F}_2^n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019622)