Referenced Items are not available for this document.
A fast algorithm for the computation of the ρ-representation of n-dimensional discrete Fourier transform (DFT) is given, where ρ is an mth primitive root of unity. Applying this algorithm to the standard ρ-representation of the DFT of ρf(x), the best linear approximation of a function f(x) can be easily obtained when the codomain of f(x) is Zm. A spectral characterization of correlation-immune functions over Z, is also presented in terms of the DFT of ζf(x)
Published in:
Information Theory, IEEE Transactions on
(Volume:45
,
Issue:
1
)
Date of Publication: Jan 1999
- Page(s):
- 303 - 308
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 6192087
- Digital Object Identifier :
- 10.1109/18.746825
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Jan 1999
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
