Oliver Bodemer
IBM J. Res. Dev
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
Oliver Bodemer
IBM J. Res. Dev
B.K. Boguraev, Mary S. Neff
HICSS 2000
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Daniel M. Bikel, Vittorio Castelli
ACL 2008