Enumerative Coding for Constant-Weight Binary Sequences with Constrained Run-Length of Zeros

We suggest a method for computing the number of $dklr$-sequences with given number of ones. Based on these results and the well-known method of Babkin and Cover, enumerative encoding and decoding for constant-weight $dklr$-sequences is obtained.