Title
Minimally modified balanced codes
Author
Schouhamer Immink, Kees A. (Turing Machines Inc.)
Weber, J.H. (TU Delft Discrete Mathematics and Optimization) 
Date
2023
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.
Subject
balanced code
Codes
Complexity theory
constrained code
Decoding
Encoding
error propagation
Indexes
Raney’s Lemma
Redundancy
Symbols
To reference this document use:
http://resolver.tudelft.nl/uuid:aa682c85-688f-4c56-861b-42063c7ab4ba
DOI
https://doi.org/10.1109/TIT.2022.3200136
Embargo date
2023-07-01
ISSN
0018-9448
Source
IEEE Transactions on Information Theory, 69 (1), 187-193
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.
Part of collection
Institutional Repository
Document type
journal article
Rights
© 2023 Kees A. Schouhamer Immink, J.H. Weber