“…These generalizations of Boolean functions given by the various researchers are helpful in the construction of some efficient cryptographic algorithms for smooth digital communication. For Boolean functions in cryptography and error correcting codes, we may refer to MacWilliams (1977), Carlet (2010), Singh et al (2013), Zhuo and Chong (2015), Gangopadhyay et al (2019), Singh and Paul (2019), Mandal and Gangopadhyay (2021), Mandal et al (2022), Singh et al (2022), Tiwari and Sharma (2023). In the present article, by considering the Schmidt's generalization, we discuss some more results of generalized Boolean functions in respect of GNT.…”