Binary Variable-to-Fixed Length Balancing Scheme with Simple Encoding/Decoding

Journal article (2018)

Authors

T.G. Swart University of Johannesburg
J.H. Weber Discrete Mathematics and Optimization - EEMCS
Research Group
Discrete Mathematics and Optimization (EEMCS) (TU Delft)
Copyright: © 2018 T.G. Swart, J.H. Weber
DOI: https://doi.org/10.1109/LCOMM.2018.2865350
Redundancy Encoding Memory management Decoding Balanced code Constrained code Dc-free code Electronic mail Systematics Table lookup Variable length
More Info
expand_more

Published Date

2018

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 a systematic variable-to-fixed (VF) length scheme encoding binary information sequences into binary balanced sequences. The redundancy of the proposed scheme is larger than the redundancy of the best fixed-to-fixed (FF) length schemes in case of long codes, but it is smaller in case of short codes. The biggest advantage comes from the simplicity of the scheme: encoding only requires one to keep track of the sequence weight, while decoding requires only one extremely simple step, irrespective of the sequence length.