Cyclically covering subspaces in F₂^n
From MaRDI portal
Publication:2019622
Abstract: A subspace of is called cyclically covering if every vector in has a cyclic shift which is inside the subspace. Let denote the largest possible codimension of a cyclically covering subspace of . We show that for every prime such that 2 is a primitive root modulo , which, assuming Artin's conjecture, answers a question of Peter Cameron from 1991. We also prove various bounds on depending on and and extend some of our results to a more general set-up proposed by Cameron, Ellis and Raynaud.
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
Cites work
- scientific article; zbMATH DE number 5652361 (Why is no real title available?)
- ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
- An inverse theorem mod p
- Intersecting families of finite sets and fixed-point-free 2-elements
- Large sets with small doubling modulo \(p\) are well covered by an arithmetic progression
- On Artin's conjecture.
- Research problems
- Smallest cyclically covering subspaces of \(\mathbb{F}_q^n\), and lower bounds in Isbell's conjecture
- Structural additive theory. Based on courses given at Karl-Franzens-Universität Graz, Austria, 2008--2012
Cited in
(4)
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)