Authors: | Stanković, Radomir Stanković, 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: | IEICE Transactions on Information and Systems | Volume: | E104D | Issue: | 8 | First page: | 1092 | Last page: | 1102 | Issue Date: | 2021 | Rank: | ~M23 | ISSN: | 0916-8532 | DOI: | 10.1587/transinf.2020LOP0006 | Abstract: | 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: | Institute of Electronics Information Communication Engineers |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.