Skip to main content
Approximation Theory and its ApplicationsVolume 7, Issue 2, June 1991, Pages 1-19

Fast algorithms for calculation of Gibbs derivatives on finite groups(Article)

  Save all to author list
  • Brace Taskovica 17/29, Nis, 18 000

Abstract

In this paper we discuss the definition of Gibbs derivatives on finite, not necessarily Abelian, groups in terms of the partial Gibbs derivatives. We consider the matrix representation of Gibbs derivatives defined in this way, which enables us to disclose FFT-like algorithms for the calculation of the values of Gibbs derivatives of functions on finite groups into fields admitting the existence of a Fourier transform on groups. © 1991, Springer. All rights reserved.

  • ISSN: 10009221
  • Source Type: Journal
  • Original language: English
  • DOI: 10.1007/BF02845188
  • Document Type: Article

  Stankovic, R.S.; Brace Taskovica 17/29,
© Copyright 2017 Elsevier B.V., All rights reserved.

Cited by 7 documents

Stanković, R.S. , Stanković, M. , Moraga, C.
Remarks on Gibbs Permutation Matrices for Ternary Bent Functions
(2023) Proceedings of The International Symposium on Multiple-Valued Logic
Stankovic, R.S. , Stankovic, M. , Astola, J.
Quaternary generalized boolean bent functions obtained through permutation of binary boolean bent functions
(2018) Proceedings of The International Symposium on Multiple-Valued Logic
Yanushkevich, S.N. , Shmerko, V.P. , Lyshevski, S.E.
Logic Design of NanoICS
(2017) Logic Design of NanoICS
View details of all 7 citations
Inform me when this document is cited in Scopus:
Set citation alert Set citation feed

SciVal Topic Prominence

Topic:
Prominence percentile: