Enumeration of constant-weight run-length limited binary sequences

Constant-weight binary sequences with constrained run lengths of zeros and ones are introduced. These run-length constraints are separate and independent. Using the Babkin–Cover enumerative scheme, the number of these sequences is found. Then enumeration-based encoding and decoding procedures are constructed.