Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
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 error-correcting capability into these codes. Some general constructions are given and tables are constructed for specific cases. © 1993 IEEE
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Robert E. Donovan
INTERSPEECH - Eurospeech 2001