Minimally modified balanced codes

Journal article (2023)

Authors

Kees A. Schouhamer Immink Turing Machines Inc.
J.H. Weber Discrete Mathematics and Optimization - EEMCS
Research Group
Discrete Mathematics and Optimization (EEMCS) (TU Delft)
Copyright: © 2023 Kees A. Schouhamer Immink, J.H. Weber
DOI: https://doi.org/10.1109/TIT.2022.3200136
Redundancy Codes Error propagation Encoding Decoding Indexes Symbols Constrained code Complexity theory Balanced code Raney’s Lemma
More Info
expand_more

Published Date

2023

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Delft Institute of Applied Mathematics

Research Group

Discrete Mathematics and Optimization

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.