Rotating Binaries

07/18/2021
by   Anant Gupta, et al.
0

This paper investigates the behaviour of rotating binaries. A rotation by r digits to the left of a binary number B exhibits in particular cases the divisibility l| N_1(B)· r+1, where l is the bit-length of B and N_1(B) is the Hamming weight of B, that is the number of ones in B. The integer r is called the left-rotational distance. We investigate the connection between this rotational distance, the length and the Hamming weight of binary numbers. Moreover we follow the question under which circumstances the above mentioned divisibility is true. We have found out and will demonstrate that this divisibility occurs for kn+c cycles.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/16/2020

Weight Enumerators for Number-Theoretic Codes and Cardinalities of Non-binary VT Codes

This paper investigates the extended weight enumerators for the number-t...
research
11/29/2013

The Power of Asymmetry in Binary Hashing

When approximating binary similarity using the hamming distance between ...
research
02/25/2020

Generalized Hamming weight of Projective Toric Code over Hypersimplices

The d-th hypersimplex of R^s is the convex hull in R^s of all integral p...
research
03/10/2021

Binary Signed-Digit Integers, the Stern Diatomic Sequence and Stern Polynomials

Stern's diatomic sequence is a well-studied and simply defined sequence ...
research
04/02/2019

On transitive uniform partitions of F^n into binary Hamming codes

We investigate transitive uniform partitions of the vector space F^n of ...
research
07/12/2021

On the Hamming Weight Distribution of Subsequences of Pseudorandom Sequences

In this paper, we characterize the average Hamming weight distribution o...
research
08/31/2021

Gray Cycles of Maximum Length Related to k-Character Substitutions

Given a word binary relation τ we define a τ-Gray cycle over a finite la...

Please sign up or login with your details

Forgot password? Click here to reset