Constrained coding is widely applicable to digital communication and storage systems. Motivated by recent interest in simultaneous energy and information transfer, we study a generalized sliding window constraint called the skip-sliding window (SSW) constraint. Given a sliding window of length $L$, an SSW code with skip length $J$ is one in which the codewords satisfy the constraint that, as you slide the window consecutively by $J$ symbols, a cost constraint $E$ is satisfied in each window.  We study the noiseless capacity of binary SSW codes and explore noisy capacity bounds.