A new approach for encoding any string of information bits into a sequence having bounded running digital sum is presented. The results improve previously known values of the running digital sum for the same rate. Also discussed are ways of incorporating an error-correcting capability into these codes. Some general constructions are given and tables are constructed for specific cases.
Blaum, M., Litsyn, S., Buskens, V. W., & Tilborg, van, H. C. A. (1993). Error-correcting codes with bounded running digital sum. IEEE Transactions on Information Theory, 39(1), 216-227. https://doi.org/10.1109/18.179362