The minimal number of systems of linear equations with n unknowns over a finite field Fq, such that the union of all solutions of the systems forms an exact cover for a given subset in Fqn, is the complexity of a linearized covering. An upper bound for the complexity for “almost all” subsets in Fqn is presented.
No institution available
Physics
, 2025, Issue 1, pp. 1–10
ISSN Online: 0000-0000
DOI:
10.xxxx/example-doi