Dc-Constrained Codes From Hadamard Matrices

Alexander M. Barg; Simon N. Litsyn

doi:10.1109/18.79949

Dc-Constrained Codes From Hadamard Matrices

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

Abstract

The construction of balanced error-correcting codes with distance close to half of the block length and bounded running digital sum is considered. Use of these codes in cascade constructions allows us to obtain a number of classes of dc-constrained codes of various lengths. We also present a construction based on simple properties of quadratic residues, generalizing the Paley construction of Hadamard matrices.

Original language	English
Pages (from-to)	801-807
Number of pages	7
Journal	IEEE Transactions on Information Theory
Volume	37
Issue number	3
DOIs	https://doi.org/10.1109/18.79949
State	Published - May 1991
Externally published	Yes

Keywords

Legendre symbol
Running digital sum
incomplete exponential sum

Access to Document

10.1109/18.79949

Cite this

@article{10227db1dc394bf9805d66a607935914,

title = "Dc-Constrained Codes From Hadamard Matrices",

abstract = "The construction of balanced error-correcting codes with distance close to half of the block length and bounded running digital sum is considered. Use of these codes in cascade constructions allows us to obtain a number of classes of dc-constrained codes of various lengths. We also present a construction based on simple properties of quadratic residues, generalizing the Paley construction of Hadamard matrices.",

keywords = "Legendre symbol, Running digital sum, incomplete exponential sum",

author = "Barg, {Alexander M.} and Litsyn, {Simon N.}",

year = "1991",

month = may,

doi = "10.1109/18.79949",

language = "אנגלית",

volume = "37",

pages = "801--807",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

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

number = "3",

}

TY - JOUR

T1 - Dc-Constrained Codes From Hadamard Matrices

AU - Barg, Alexander M.

AU - Litsyn, Simon N.

PY - 1991/5

Y1 - 1991/5

N2 - The construction of balanced error-correcting codes with distance close to half of the block length and bounded running digital sum is considered. Use of these codes in cascade constructions allows us to obtain a number of classes of dc-constrained codes of various lengths. We also present a construction based on simple properties of quadratic residues, generalizing the Paley construction of Hadamard matrices.

AB - The construction of balanced error-correcting codes with distance close to half of the block length and bounded running digital sum is considered. Use of these codes in cascade constructions allows us to obtain a number of classes of dc-constrained codes of various lengths. We also present a construction based on simple properties of quadratic residues, generalizing the Paley construction of Hadamard matrices.

KW - Legendre symbol

KW - Running digital sum

KW - incomplete exponential sum

UR - http://www.scopus.com/inward/record.url?scp=0026151471&partnerID=8YFLogxK

U2 - 10.1109/18.79949

DO - 10.1109/18.79949

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0026151471

VL - 37

SP - 801

EP - 807

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 3

ER -

Dc-Constrained Codes From Hadamard Matrices

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this