Error-correcting codes with bounded running digital sum

M BLAUM; S LITSYN; Vincent Buskens; HCA VANTILBORG

Error-correcting codes with bounded running digital sum

M BLAUM^*
, S LITSYN
, Vincent Buskens
, HCA VANTILBORG

^*Corresponding author for this work

Chair Buskens

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

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 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
Number of pages	12
Journal	IEEE Transactions on Information Theory
Volume	39
Issue number	1
Publication status	Published - Jan 1993
Event	INTERNATIONAL SYMP ON INFORMATION THEORY - BUDAPEST, Hungary Duration: 24 Jun 1991 → 28 Jun 1991

Keywords

RUNNING DIGITAL SUM
DC-CONSTRAINED CODES
MAGNETIC RECORDING
HAMMING DISTANCE
ERROR-CORRECTED CODES
GENERALIZED CONCATENATED CODES

Cite this

@article{86450f4bc4494790bfbb89b953e95f28,

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 error-correcting capability into these codes. Some general constructions are given and tables are constructed for specific cases.",

keywords = "RUNNING DIGITAL SUM, DC-CONSTRAINED CODES, MAGNETIC RECORDING, HAMMING DISTANCE, ERROR-CORRECTED CODES, GENERALIZED CONCATENATED CODES",

author = "M BLAUM and S LITSYN and Vincent Buskens and HCA VANTILBORG",

year = "1993",

month = jan,

language = "English",

volume = "39",

pages = "216--227",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

note = "INTERNATIONAL SYMP ON INFORMATION THEORY ; Conference date: 24-06-1991 Through 28-06-1991",

}

TY - JOUR

T1 - Error-correcting codes with bounded running digital sum

AU - BLAUM, M

AU - LITSYN, S

AU - Buskens, Vincent

AU - VANTILBORG, HCA

PY - 1993/1

Y1 - 1993/1

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 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 error-correcting capability into these codes. Some general constructions are given and tables are constructed for specific cases.

KW - RUNNING DIGITAL SUM

KW - DC-CONSTRAINED CODES

KW - MAGNETIC RECORDING

KW - HAMMING DISTANCE

KW - ERROR-CORRECTED CODES

KW - GENERALIZED CONCATENATED CODES

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

T2 - INTERNATIONAL SYMP ON INFORMATION THEORY

Y2 - 24 June 1991 through 28 June 1991

ER -

Error-correcting codes with bounded running digital sum

Abstract

Keywords

Fingerprint

Cite this