Minimally modified balanced codes

Kees A. Schouhamer Immink; Jos H. Weber

doi:10.1109/TIT.2022.3200136

Minimally modified balanced codes

Kees A. Schouhamer Immink, Jos H. Weber

Discrete Mathematics and Optimization

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

1 Citation (Scopus)

20 Downloads (Pure)

Abstract

We present and analyze a new construction of bipolar balanced codes where each codeword contains equally many -1's and +1's. The new code is minimally modified as the number of symbol changes made to the source word for translating it into a balanced codeword is as small as possible. The balanced codes feature low redundancy and time complexity. Large look-up tables are avoided.

Original language	English
Pages (from-to)	187-193
Number of pages	7
Journal	IEEE Transactions on Information Theory
Volume	69
Issue number	1
DOIs	https://doi.org/10.1109/TIT.2022.3200136
Publication status	Published - 2023

Bibliographical note

Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care
Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.

Keywords

balanced code
Codes
Complexity theory
constrained code
Decoding
Encoding
error propagation
Indexes
Raney’s Lemma
Redundancy
Symbols

Access to Document

10.1109/TIT.2022.3200136

Minimally_Modified_Balanced_CodesFinal published version, 731 KB

Cite this

@article{aa682c85688f4c56861b42063c7ab4ba,

title = "Minimally modified balanced codes",

abstract = "We present and analyze a new construction of bipolar balanced codes where each codeword contains equally many -1's and +1's. The new code is minimally modified as the number of symbol changes made to the source word for translating it into a balanced codeword is as small as possible. The balanced codes feature low redundancy and time complexity. Large look-up tables are avoided.",

keywords = "balanced code, Codes, Complexity theory, constrained code, Decoding, Encoding, error propagation, Indexes, Raney{\textquoteright}s Lemma, Redundancy, Symbols",

author = "{Schouhamer Immink}, {Kees A.} and Weber, {Jos H.}",

note = "Green Open Access added to TU Delft Institutional Repository {\textquoteleft}You share, we take care!{\textquoteright} – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public. ",

year = "2023",

doi = "10.1109/TIT.2022.3200136",

language = "English",

volume = "69",

pages = "187--193",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "IEEE",

number = "1",

}

TY - JOUR

T1 - Minimally modified balanced codes

AU - Schouhamer Immink, Kees A.

AU - Weber, Jos H.

N1 - Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.

PY - 2023

Y1 - 2023

N2 - We present and analyze a new construction of bipolar balanced codes where each codeword contains equally many -1's and +1's. The new code is minimally modified as the number of symbol changes made to the source word for translating it into a balanced codeword is as small as possible. The balanced codes feature low redundancy and time complexity. Large look-up tables are avoided.

AB - We present and analyze a new construction of bipolar balanced codes where each codeword contains equally many -1's and +1's. The new code is minimally modified as the number of symbol changes made to the source word for translating it into a balanced codeword is as small as possible. The balanced codes feature low redundancy and time complexity. Large look-up tables are avoided.

KW - balanced code

KW - Codes

KW - Complexity theory

KW - constrained code

KW - Decoding

KW - Encoding

KW - error propagation

KW - Indexes

KW - Raney’s Lemma

KW - Redundancy

KW - Symbols

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

U2 - 10.1109/TIT.2022.3200136

DO - 10.1109/TIT.2022.3200136

M3 - Article

AN - SCOPUS:85136869763

SN - 0018-9448

VL - 69

SP - 187

EP - 193

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 1

ER -

Minimally modified balanced codes

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this