Three new constraints are introduced in this paper. These constraints are characterized by limitations on the Hamming weight of every subword of some fixed even length l. In the (l, δ)-locally-balanced constraint, the Hamming weight of every length-l subword is bounded between l/2 - δ and l/2 + δ. The strong-(l,δ)-locally-balanced constraint imposes the locally- balanced constraint for any subword whose length is at least l. Lastly, the Hamming weight of every length-l subword which satisfies the (l, δ)-locally-bounded constraint is at most l/2 - δ. It is shown that the capacity of the strong-(l, δ)-locally-balanced constraint does not depend on the value of l and is identical to the capacity of the (2δ + 1)-RDS constraint. The latter constraint limits the difference between the number of zeros and ones in every prefix of the word to be at most 2δ + 1. This value is also a lower bound on the capacity of the (l, δ)-locally-balanced constraint, while a corresponding upper bound is given as well. Lastly, it is shown that if δ is not large enough, namely for δ < l/2, then the capacity of the (l, δ)-locally-bounded constraint approaches 1 as l increases.