Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
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
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
Preeti Malakar, Thomas George, et al.
SC 2012
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009