This book discusses in a uniform way binary, ternary, and quaternary bent functions, while most of the existing books on bent functions refer to just binary bent functions. The authors describe the differences between binary and multiple-valued cases and the construction methods for bent functions are focused on the application of two types of permutation matrices. These matrices are derived from a class of differential operators on finite groups and Fast Fourier transform algorithms, respectively. The approach presented is based on the observation that given certain bent functions, many other bent functions can be constructed by manipulating them. Permutations are possible manipulations that are easy to implement. These permutations perform spectral invariant operations which ensure that they preserve bentness.

Verwandte Artikel

Download
PDF
Bent Functions and Permutation Methods Radomir S. Stankovic, Milena Stankovic, Claudio Moraga, Jaakko Astola

53,49 €*

Weitere Produkte vom selben Autor

Representations of Multiple-Valued Logic Functions Stankovic, Radomir S., Moraga, Claudio, Astola, Jaakko

37,44 €*
From Boolean Logic to Switching Circuits and Automata Astola, Jaakko, Stankovic, Radomir S.

181,89 €*
Microarray Quality Control Zhang, Wei, Shmulevich, Ilya, Astola, Jaakko

160,50 €*
Fundamentals of Switching Theory and Logic Design Astola, Jaakko, Stankovic, Radomir S

58,50 €*