David Greaves and Stephen Montgomery-Smith, Unforgeable Marker Sequences. (Computer Science) A binary number of n bits consists of an ordered sequence of n digits taken from the set {0,1}. A sequence is said to be an unforgeable marker if all subsequences of consecutive digits starting at the left-hand end are dissimilar from the sequence of the same length which ends at the right-hand end. Unforgeable marker sequences are so called because, when misaligned in a shift-register or other view port of the correct length, there is no possibility of adjacent random digits impersonating the true sequence. Such sequences are used for frame alignment purposes in serial data communications systems. (tex, dvi, ps, pdf, html.) Since we wrote this paper, we found out that these sequences had been studied by others, as bifix-free words, or as autocorrelations. We refer the reader to On-Line Encyclopedia of Integer Sequences A003000 and http://www.mathematik.uni-bielefeld.de/~sillke/SEQUENCES/autocorrelation.


 List of all preprints