An Optimal Coding Scheme for a Certain Type of Ensemble

An optimal coding scheme is offered for binary messages with a limited number of successive runs of length 1 (i.e., strings of the form 010101..., in the messages, have a known limited length). A practical example is given of a case where such messages are found.