Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
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
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Lixi Zhou, Jiaqing Chen, et al.
VLDB
B. Wagle
EJOR
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine