Hamming Distance for Conjugates
| dc.creator | Shallit, Jeffrey | |
| dc.date | 2007-10-05 | |
| dc.date | 2008-08-15 | |
| dc.date.accessioned | 2026-07-07T09:56:34Z | |
| dc.date.available | 2026-07-07T09:56:34Z | |
| dc.description | 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. | |
| dc.description | revision | |
| dc.identifier | https://arxiv.org/abs/0710.1234 | |
| dc.identifier | http://arxiv.org/abs/0710.1234 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/167024 | |
| dc.subject | Combinatorics | |
| dc.subject | 68R15 | |
| dc.title | Hamming Distance for Conjugates | |
| dc.type | text |