Authors: Stanković, Radomir 
Stankovic, Milena
Moraga, Claudio
Astola, Jaakko T.
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Construction of Ternary Bent Functions by FFT-like Permutation Algorithms
Journal: Proceedings of The International Symposium on Multiple-Valued Logic
Conference: 50th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2020; Miyazaki; Japan; 9 November 2020 through 11 November 2020
Issue Date: 1-Nov-2020
Rank: M33
ISBN: 9781728154060
ISSN: 0195-623X
DOI: 10.1109/ISMVL49045.2020.00-24
Binary bent functions have a strictly specified number of non-zero values. In the same way, ternary bent functions satisfy certain requirements on the elements of their value vectors. These requirements can be used to specify six classes of ternary bent functions. Classes are mutually related by encoding of function values. Given a basic ternary bent function, other functions in the same class can be constructed by permutation matrices having a block structure similar to that of the factor matrices appearing in the Good-Thomas decomposition of Cooley-Tukey Fast Fourier transform and related algorithms.
Keywords: Bent functions | Fast Fourier transform | Permutation matrices | Ternary functions | Vilenkin-Chrestenson transform
Publisher: IEEE

Show full item record


checked on May 21, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.