Error-correcting codes with bounded running digital sum

M. Blaum, S. Litsyn, V.W. Buskens, H.C.A. Tilborg, van

Research output: Contribution to journalArticleAcademicpeer-review

11 Citations (Scopus)


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 an error-correcting capability into these codes. Some general constructions are given and tables are constructed for specific cases.
Original languageEnglish
Pages (from-to)216-227
JournalIEEE Transactions on Information Theory
Issue number1
Publication statusPublished - 1993


Dive into the research topics of 'Error-correcting codes with bounded running digital sum'. Together they form a unique fingerprint.

Cite this