Complexity of function systems over a finite field in the class of polarized polynomial forms
- 作者: Selezneva S.N.1, Gordeev M.M.1
-
隶属关系:
- Department of Computational Mathematics and Cybernetics
- 期: 卷 41, 编号 4 (2017)
- 页面: 193-198
- 栏目: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176210
- DOI: https://doi.org/10.3103/S0278641917040069
- ID: 176210
如何引用文章
详细
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.
作者简介
S. Selezneva
Department of Computational Mathematics and Cybernetics
编辑信件的主要联系方式.
Email: selezn@cs.msu.su
俄罗斯联邦, Moscow, 119991
M. Gordeev
Department of Computational Mathematics and Cybernetics
Email: selezn@cs.msu.su
俄罗斯联邦, Moscow, 119991
补充文件
