2010; Physical and Mathematical Sciences, 44(2 (222): 41–48
Shared with The Gufo

AN UPPER BOUND FOR THE COMPLEXITY OF LINEARIZED COVERINGS IN A FINITE FIELD

H.K. Nurijanyan*

Received: 2025-02-23 · Published: 2010-04-26

© 2010 The Author(s) and the original publisher.

CC BY 4.0 This work is licensed under a Creative Commons Attribution 4.0 International License.
Shared article.
Original title
AN UPPER BOUND FOR THE COMPLEXITY OF LINEARIZED COVERINGS IN A FINITE FIELD
Author
H.K. Nurijanyan
Published
2010-04-26
Licence
Creative Commons Attribution 4.0 International

Abstract

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.
1 / ? 100% Open in new tab Download Cite

Loading the full text…

Download Follow Updates