Orientable sequences. (English) Zbl 0812.94008
Ganley, M. J. (ed.), Cryptography and coding III. Based on the proceedings of the 3rd conference organized by the Institute of Mathematics and its Applications on cryptography and coding, held at Cirencester, GB, on Dec. 16-18, 1991. Oxford: Clarendon Press. Inst. Math. Appl. Conf. Ser., New Ser. 45, 97-115 (1993).
Summary: Periodic binary sequences with the property that no \(n\) bit sequence and its reverse occur more than once in the sequence are studied. We give an upper bound for the period of such a sequence and produce a lower bound by means of a construction. This lower bound is shown to be asymptotically of the same order as the maximum possible.
For the entire collection see [Zbl 0790.00017].
For the entire collection see [Zbl 0790.00017].
MSC:
| 94A55 | Shift register sequences and sequences over finite alphabets in information and communication theory |
| 05C90 | Applications of graph theory |
