Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
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
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
Rajeev Gupta, Shourya Roy, et al.
ICAC 2006
John M. Boyer, Charles F. Wiecha
DocEng 2009