Analogously to de Bruijn sequences, orientable sequences have application in automatic position-location applications and, until recently, studies of these sequences focused on the binary case. In recent work by Alhakim et al., a range of methods of construction were described for orientable sequences over arbitrary finite alphabets; some of these methods involve using negative orientable sequences as a building block. In this paper we describe three techniques for generating such negative orientable sequences, as well as upper bounds on their period. We then go on to show how these negative orientable sequences can be used to generate orientable sequences with period close to the maximum possible for every non-binary alphabet size and for every tuple length. In doing so we use two closely related approaches described by Alhakim et al.

翻译：类似于德布鲁因序列，可定向序列在自动定位应用中具有应用价值，且直到近期，相关研究主要集中于二进制情形。在Alhakim等人的近期工作中，描述了在任意有限字母表上构造可定向序列的一系列方法；其中部分方法涉及使用负可定向序列作为构建模块。本文阐述了三种生成此类负可定向序列的技术，并给出了其周期的上界。进而，我们展示了如何利用这些负可定向序列为每个非二进制字母表大小和每个元组长度生成周期接近最大可能值的可定向序列。在此过程中，我们采用了Alhakim等人描述的两种密切相关的方法。