In this paper, we prove that enumeration of the number of balanced sym- metric functions over GF(p) is equivalent to solve the equation system in [13] and we ...
When n and p become large, we give a lower bound on number of balanced symmetric functions over GF ( p ) , and the lower bound provides best known result.
It is proved that the construction and enumeration of the number of balanced symmetric functions over GF(p) are equivalent to solving an equation system and ...
It is proved that the construction and enumeration of the number of balanced symmetric functions over GF (p) are equivalent to solving an equation system ...
In this paper, by an enu- merating method, we give a lower bound for the number of balanced symmetric polynomials over GF(p), and as an immediate consequence, ...
Recently, they give a lower bound for the number of balanced symmetric functions over GF (p) and show the existence of nonlinear balanced symmetric functions [1] ...
Under mild conditions on n, p, we give a lower bound on the number of n-variable balanced symmetric polynomials over finite fields GFp, where p is a prime ...
Missing: Enumeration | Show results with:Enumeration
Shaojing Fu, Chao Li, Kanta Matsuura , Longjiang Qu : Enumeration of balanced symmetric functions over GF(p). Inf. Process. Lett. 110(14-15): 544-548 (2010).
First, we prove that the construction and enumeration of balanced rotation symmetric functions over GF(p)GF(p) are equivalent to solving a specified equation ...
instance of · scholarly article ; title. Enumeration of balanced symmetric functions over \(GF(p)\) (English) ; published in · Information Processing Letters.