The construction of Boolean functions with good cryptographic properties over subsets of vectors with fixed Hamming weight is significant for lightweight stream ciphers like FLIP. This article introduces a general construction for a class of Weightwise Almost Perfectly Balanced (WAPB) Boolean functions, based on the action of a cyclic permutation group on \(\mathbb {F}_2^n\) . This class generalizes the Weightwise Perfectly Balanced (WPB) \(n = 2^m\) -variable Boolean function construction by Liu and Mesnager to any n. We establish theoretical bounds on the nonlinearity and weightwise nonlinearity of the resulting functions. Particularly, we explore two significant permutation groups, \(\langle \psi \rangle \) and \(\langle \sigma \rangle \) , where \(\psi \) is a distinct binary-cycle permutation and \(\sigma \) is a rotation. Beyond the theoretical analysis of nonlinearity and weightwise nonlinearity, we perform an extensive experimental study for \(n\le 4\le 20\) , examining nonlinearity, weightwise nonlinearity, algebraic immunity, and weightwise algebraic immunity of these classes of functions. The results confirm that the proposed WAPB functions achieve high values across these important cryptographic parameters, demonstrating their practical relevance for cryptographic designs that require balancedness across fixed-weight slices.