Error-correcting codes with bounded running digital sum

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

doi:10.1109/18.179362

Error-correcting codes with bounded running digital sum

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

Research output: Contribution to journal › Article › Academic › peer-review

11 Citations (Scopus)

1 Downloads (Pure)

Abstract

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 language	English
Pages (from-to)	216-227
Journal	IEEE Transactions on Information Theory
Volume	39
Issue number	1
DOIs	https://doi.org/10.1109/18.179362
Publication status	Published - 1993

Access to Document

10.1109/18.179362

Cite this

@article{56da0eacc8c5410e958b5ecfb7ef7e98,

title = "Error-correcting codes with bounded running digital sum",

abstract = "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.",

author = "M. Blaum and S. Litsyn and V.W. Buskens and {Tilborg, van}, H.C.A.",

year = "1993",

doi = "10.1109/18.179362",

language = "English",

volume = "39",

pages = "216--227",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "1",

}

TY - JOUR

T1 - Error-correcting codes with bounded running digital sum

AU - Blaum, M.

AU - Litsyn, S.

AU - Buskens, V.W.

AU - Tilborg, van, H.C.A.

PY - 1993

Y1 - 1993

N2 - 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.

AB - 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.

U2 - 10.1109/18.179362

DO - 10.1109/18.179362

M3 - Article

SN - 0018-9448

VL - 39

SP - 216

EP - 227

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 1

ER -

Error-correcting codes with bounded running digital sum

Abstract

Access to Document

Fingerprint

Cite this