The eigenstructure of finite field trigonometric transforms
Let \(\mathrm{GF}(q)\) denote a finite field with \(q\) elements. Consider the set \(\mathrm{GI}(p)=\{a+jb\,|\,a,b\in\mathrm{GF}(p)\}\), where \(p\) is a prime such that \(j^2\equiv -1\,(\mathrm{mod}\,p)\) is a quadratic nonresidue over~\(\mathrm{GF}(p)\), i.e., \(p\equiv 3\,(\mathrm{mod}\,4)\). Let \(\zeta=a+jb\in\mathrm{GI}\,(p)\) satisfy \(a^2+b^2\equiv 1\,(\mathrm{mod}\,p)\), and let \(\mathrm{ord}\,(\zeta)\) denote its multiplicative order. Originating from \textit{R.~M.~Campello de Souza, H.~M.~de Oliveira, A.~N.~Kauffman} and \textit{A.~J.~A.~Paschoal} [Proc. IEEE Internat. Sympos. Informat. Theory, p.~293 (1998)], define \[ \cos_\zeta(x)=\frac{\zeta^x+\zeta^{-x}}{2},\quad \sin_\zeta(x)=\frac{\zeta^x-\zeta^{-x}}{2j},\quad x= 0,1,\dots,\mathrm{ord}\,(\zeta)-1. \] The authors present various types of trigonometric transformations that change a vector with entries in~\(\mathrm{GF}(p)\) into one with entries in~\(\mathrm{GI}(p)\). They find the eigenvalues of the transformation matrices and study their multiplicities. They also propose procedures for constructing corresponding eigenvectors. Finally, the authors suggest applications to multiuser communication systems and error-correcting codes.
- A Block Cipher Cryptosystem Using Wavelet Transforms Over Finite Fields
- Block error correcting codes using finite-field wavelet transforms
- Computation Over Multiple-Access Channels
- Eigenvalues and eigenvectors of generalized DFT, generalized DHT, DCT-IV and DST-IV matrices
- Error control coding. Fundamentals and applications
- Factoring polynomials over finite fields: A survey
- scientific article; zbMATH DE number 5150289 (Why is no real title available?)
- scientific article; zbMATH DE number 3924676 (Why is no real title available?)
- scientific article; zbMATH DE number 3928865 (Why is no real title available?)
- scientific article; zbMATH DE number 2108106 (Why is no real title available?)
- scientific article; zbMATH DE number 3240629 (Why is no real title available?)
- The discrete fractional cosine and sine transforms
- The eigenstructure of finite field trigonometric transforms
- The Fast Fourier Transform in a Finite Field
- The fractional discrete cosine transform
- Fractional cosine and sine transforms over finite fields
- Fractional Fourier, Hartley, cosine and sine number-theoretic transforms based on matrix functions
- The eigenstructure and Jordan form of the Fourier transform over fields of characteristic 2 and a generalized Vandermonde-type formula
- Generalized trigonometry and Chebyshev functions in finite fields
- Finite field trigonometric transforms
- Eigenvalues and equivalent transformation of a trigonometric matrix associated with filter design
- The eigenstructure of finite field trigonometric transforms
- On eigenvalues and equivalent transformation of trigonometric matrices
- Cosine transforms over fields of characteristic 2
This page was built for publication: The eigenstructure of finite field trigonometric transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q551319)