arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.00672math.COcs.DM
收藏

可定向和负可定向序列

Orientable and negative orientable sequences

Royal Holloway, University of London(伦敦大学皇家霍洛威学院)

Chris J Mitchell, Peter R Wild

AI总结:

本文提出三种生成负可定向序列的技术,并给出其周期上界,展示了如何利用这些序列生成接近最大周期的可定向序列。

摘要:

类似于德布鲁因序列,可定向序列在自动定位应用中有重要用途,此前研究多集中于二元情况。Alhakim等人最近提出了一系列构造可定向序列的方法,其中一些方法使用负可定向序列作为构建块。本文描述了三种生成负可定向序列的技术,并给出其周期上界。随后,本文展示了如何利用这些负可定向序列生成具有接近最大可能周期的可定向序列,无论非二元字母表大小和元组长度如何。在此过程中,本文使用了Alhakim等人描述的两种密切相关的方法。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑