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

H.K. Nurijanyan

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

This work is licensed under Creative Commons Attribution–NonCommercial International License (CC BY-NC 4.0).

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.

Author(s)

Table of Contents

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

Abstract

Author(s)

Table of Contents

Related Articles

AZIMUTHS RADIATION RISK DEGREE APPRAISAL FOR THE POPULATION LIVING IN AREA OF THE NUCLEAR POWER PLANTS LOCATION

THE KINETICS OF VESICLES SWELLING IN PRESENCE OF TRANSMEMBRANE DIFFERENCE OF POTENTIALS

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

Abstract

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter