Construction of Ternary Bent Functions From Ternary Linear Functions

As in the binary case, ternary bent functions are defined as most non-linear ternary functions meaning that they are at the largest possible Hamming distance from affine ternary functions. It is therefore interesting to observe that some ternary bent functions can be constructed as various combinations of linear ternary functions. By starting from the combination of linear functions corresponding to the basic ternary bent functions the construction of different other ternary bent functions can be performed by the application of different combinations of FFT-like permutation matrices for ternary functions.