...
首页> 外文期刊>IEICE Transactions on fundamentals of electronics, communications & computer sciences >Enumeration of Both-Ends-Fixed k-ary Necklaces and Its Applications
【24h】

Enumeration of Both-Ends-Fixed k-ary Necklaces and Its Applications

机译:Enumeration of Both-Ends-Fixed k-ary Necklaces and Its Applications

获取原文
获取原文并翻译 | 示例

摘要

We consider both-ends-fixed -ary necklaces and enumerateall such necklaces of length from the viewpoints of symbolic dynamicsand -expansions, where and (≥ 2) are natural numbers and (> 1) isa real number. Recently, Sawada et al. proposed an efficient constructionof -ary de Bruijn sequence of length , which for each ≥ 1, requires ( ) space but generates a single -ary de Bruijn sequence of length in (1)-amortized time per bit. Based on the enumeration of both-ends-fixed -ary necklaces of length , we evaluate auto-correlation values of the -ary de Bruijn sequences of length constructed by Sawada et al. We alsoestimate the asymptotic behaviour of the obtained auto-correlation valuesas tends to infinity.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号