恒定最优因子下的无交叉bifix码
Cross-Bifix-Free Codes Within a Constant Factor of Optimality
摘要：
无交叉双缀码是一组单词，其中任何单词的任何长度的前缀都不是该组中任何单词的后缀。无交叉双缀码是在研究分布式帧同步序列时产生的。我们提供了一种新的无交叉bifix码的构造，它将Bajic（2007）中的构造推广到更长的码长和任何字母大小。的代码被证明是接近最佳的大小。我们还建立了新的结果Fibonacci序列，用于估计的大小的交叉bifix自由码。
英文摘要：
A cross-bifix-free code is a set of words in which no prefix of any length of any word is the suffix of any word in the set. Cross-bifix-free codes arise in the study of distributed sequences for frame synchronization. We provide a new construction of cross-bifix-free codes which generalizes the construction in Bajic (2007) to longer code lengths and to any alphabet size. The codes are shown to be nearly optimal in size. We also establish new results on Fibonacci sequences, that are used in estimating the size of the cross-bifix-free codes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
