Complexity of function systems over a finite field in the class of polarized polynomial forms
- 16 Downloads
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: L q PPF (n,m) = q n for all n ≥ 1, m ≥ 2, and all possible odd q. It has previously been known that L2PPF (n,m) = 2 n and L3PPF (n,m) = 3 n for all n ≥ 1 and m ≥ 2.
Keywordsfunction over a finite field function system polynomial form polarized polynomial form (PPF) complexity lower bound
Unable to display preview. Download preview PDF.
- 8.A. S. Balyuk and G. V. Yanushkovskii, “Upper estimates of the complexity of the function above the finite fields in Croneker form classes,” Izv. Irkutsk. Univ., Ser. Mat. 14, 3–17 (2015).Google Scholar
- 9.A. S. Balyuk and A. S. Zinchenko, “Lower estimate of the complexity of the function above the finite field of order 4 in the class of polarized polynomials,” Izv. Irkutsk. Univ., Ser.Mat. 16, 19–29 (2016).Google Scholar
- 12.S. V. Yablonskii, Introduction to Discrete Mathematics (Vysshaya Shkola, Moscow, 2001; Mir, Moscow, 1989).Google Scholar