Abstract
As in the binary case, ternary bent functions are a very small portion of the set of all ternary functions for a given number of variables. For example, for n = 2, there are 486 ternary bent functions out of 19683 ternary functions, which is 2, 47%, and this number reduces exponentially with the increase of n. However, finding, or alternatively, constructing them is a challenging task. A possible approach is based upon the manipulation of known ternary bent functions to construct other ternary bent functions. In this paper, we define Gibbs permutation matrices derived from the Gibbs derivative with respect to the Vilenkin-Chrestenson transform and propose their usage in constructing bent functions. The method can be extended to p-valued bent functions, where p is a prime larger than 3.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
