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

Journal Article (2018)
Author(s)

T.G. Swart (University of Johannesburg)

Jos H. Weber (TU Delft - Discrete Mathematics and Optimization)

Research Group
Discrete Mathematics and Optimization
Copyright
© 2018 T.G. Swart, J.H. Weber
DOI related publication
https://doi.org/10.1109/LCOMM.2018.2865350
More Info
expand_more
Publication Year
2018
Language
English
Copyright
© 2018 T.G. Swart, J.H. Weber
Research Group
Discrete Mathematics and Optimization
Issue number
10
Volume number
22
Pages (from-to)
1992-1995
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.

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.

Files

46622178_manuscript.pdf
(pdf | 0.28 Mb)
License info not available