학술논문

Minimally Modified Balanced Codes
Document Type
Periodical
Source
IEEE Transactions on Information Theory IEEE Trans. Inform. Theory Information Theory, IEEE Transactions on. 69(1):187-193 Jan, 2023
Subject
Communication, Networking and Broadcast Technologies
Signal Processing and Analysis
Indexes
Symbols
Codes
Redundancy
Encoding
Decoding
Complexity theory
Balanced code
constrained code
error propagation
Raney’s Lemma
Language
ISSN
0018-9448
1557-9654
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.