Complexity of function systems over a finite field in the class of polarized polynomial forms
- Autores: Selezneva S.N.1, Gordeev M.M.1
-
Afiliações:
- Department of Computational Mathematics and Cybernetics
- Edição: Volume 41, Nº 4 (2017)
- Páginas: 193-198
- Seção: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176210
- DOI: https://doi.org/10.3103/S0278641917040069
- ID: 176210
Citar
Resumo
The Shannon complexity of a function system over a q-element finite field which contains m functions of n variables in the class of polarized polynomial forms is exactly evaluated: LqPPF (n,m) = qn for all n ≥ 1, m ≥ 2, and all possible odd q. It has previously been known that L2PPF (n,m) = 2n and L3PPF (n,m) = 3n for all n ≥ 1 and m ≥ 2.
Sobre autores
S. Selezneva
Department of Computational Mathematics and Cybernetics
Autor responsável pela correspondência
Email: selezn@cs.msu.su
Rússia, Moscow, 119991
M. Gordeev
Department of Computational Mathematics and Cybernetics
Email: selezn@cs.msu.su
Rússia, Moscow, 119991
Arquivos suplementares
