Construction of ternary bent functions by FFT-like permutation algorithms

Radomir S. Stanković, Milena Stanković, Claudio Moraga, Jaakko T. Astola

Research output: Contribution to journalArticleScientificpeer-review


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.

Original languageEnglish
Pages (from-to)1092-1102
Number of pages11
JournalIEICE Transactions on Information and Systems
Issue number8
Publication statusPublished - 2021
Publication typeA1 Journal article-refereed


  • Bent functions
  • Fast Fourier transform
  • Permutation matrices
  • Ternary functions
  • Vilenkin-Chrestenson transform

Publication forum classification

  • Publication forum level 1

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence


Dive into the research topics of 'Construction of ternary bent functions by FFT-like permutation algorithms'. Together they form a unique fingerprint.

Cite this