Hamming Distance for Conjugates

Details Hamming Distance for Conjugates Hamming Distance for Conjugates

2007-10-05

arxiv.org/abs/0710.1234v2

Mathematics

Combinatorics

revision

Scientific paper

Let x, y be strings of equal length. The Hamming distance h(x,y) between x and y is the number of positions in which x and y differ. If x is a cyclic shift of y, we say x and y are conjugates. We consider f(x,y), the Hamming distance between the conjugates xy and yx. Over a binary alphabet f(x,y) is always even, and must satisfy a further technical condition. By contrast, over an alphabet of size 3 or greater, f(x,y) can take any value between 0 and |x|+|y|, except 1; furthermore, we can always assume that the smaller string has only one type of letter.

Affiliated with

Also associated with

No associations

Rating

Hamming Distance for Conjugates does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hamming Distance for Conjugates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hamming Distance for Conjugates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-329240