This article is cited in 1 paper

Informatics

An upper bound for the complexity of linearized coverings in a finite field

H. K. Nurijanyan

Chair of Discrete Mathematics and Theoretical Informatics YSU, Armenia

Abstract: 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.

Received: 01.03.2010
Accepted: 05.04.2010

Language: English