Abstract
We consider the problem of constructing a cyclic listing of all bitstrings of length 2n + 1 with Hamming weights in the interval [n + 1 - l, n + l], where 1 = 12. (c) 2021 Elsevier Inc. All rights reserved.
We consider the problem of constructing a cyclic listing of all bitstrings of length 2n + 1 with Hamming weights in the interval [n + 1 - l, n + l], where 1 = 12. (c) 2021 Elsevier Inc. All rights reserved.