JUCS - Journal of Universal Computer Science 21(9): 1136-1142, doi: 10.3217/jucs-021-09-1136
A Note on Variable-Length Codes with Constant Hamming Weights
expand article infoPeter Fenwick‡
‡ The University of Auckland, Auckland, New Zealand

Corresponding author: Peter Fenwick ( pmbjfw@gmail.com )

© Peter Fenwick.
This article is freely available under the J.UCS Open Content License.
Citation: Fenwick P (2015) A Note on Variable-Length Codes with Constant Hamming Weights. JUCS - Journal of Universal Computer Science 21(9): 1136-1142. https://doi.org/10.3217/jucs-021-09-1136
Open Access
Abstract
A recent paper described a variable-length integer code based on the Goldbach conjecture where every codeword had exactly 2 1-bits but with an extremely irregular structure. A later, unpublished, work produced a much more regular code, again with a Hamming weight of 2. This paper extends that later work to weight-3 and weight-4 codes, which are shown to be competitive with more-usual codes over a useful range of values.
Keywords
Variable-length code, Hamming-weight 3