Cyclically covering subspaces in $\mathbb{F}_2^n$
Combinatorics
2021-02-18 v3
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.
Cite
@article{arxiv.1903.10613,
title = {Cyclically covering subspaces in $\mathbb{F}_2^n$},
author = {James Aaronson and Carla Groenland and Tom Johnston},
journal= {arXiv preprint arXiv:1903.10613},
year = {2021}
}
Comments
36 pages