Haar transformation of linear boolean function
Haar transform is known to have the smallest computational requirement with a considerable interest and attraction drawn towards its spectral properties of Boolean functions. This paper presents Haar transform of Linear Boolean functions, where by the discussion is based on the transformation f...
Main Authors: | Mohamed Rafiq, Hashum, Siddiqi, Muhammad Umar |
---|---|
Format: | Proceeding Paper |
Language: | English |
Published: |
2009
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/6506/1/Haar_Transformation_of_Linear_Boolean_Function.pdf |
Similar Items
-
Simulation study of a many-to-one mapping for IPv6 address owner identification in an enterprise local area network
by: Hakiem, Nashrul, et al.
Published: (2015) -
Impulsive noise mitigation in Haar DWT based OFDM systems
by: Ali, Moaaz Elhag, et al.
Published: (2013) -
Optimal biphase sequences with large linear complexity derived from sequences over Z4
by: Udaya, Paramapalli, et al.
Published: (1996) -
Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
by: Udaya, Paramapalli, et al.
Published: (1998) -
Transform domain characterization of cyclic codes over Zm
by: Rajan, Sundar B., et al.
Published: (1994)