AN UPPER BOUND FOR THE COMPLEXITY OF LINEARIZED COVERINGS IN A FINITE FIELD
DOI:
https://doi.org/10.46991/PYSU:A/2010.44.2.041Keywords:
finite fields, system of linear equations over finite fields, linearized coveringsAbstract
The minimal number of systems of linear equations with n unknowns over a finite field $F_q$, such that the union of all solutions of the systems forms an exact cover for a given subset in $F_q^n$, is the complexity of a linearized covering. An upper bound for the complexity for “almost all” subsets in $F_q^n$ is presented.
Downloads
Published
2010-04-26
How to Cite
Nurijanyan, H. K. (2010). AN UPPER BOUND FOR THE COMPLEXITY OF LINEARIZED COVERINGS IN A FINITE FIELD. Proceedings of the YSU A: Physical and Mathematical Sciences, 44(2 (222), 41–48. https://doi.org/10.46991/PYSU:A/2010.44.2.041
Issue
Section
Informatics
License
Copyright (c) 2010 Proceedings of the YSU
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.