首页> 外文会议>Computer Science and Software Engineering, CSSE 2008, 2008 International Conference on >Combinatorial Characterizations of k-Coincidence Frequency-Hopping Sequences
【24h】

Combinatorial Characterizations of k-Coincidence Frequency-Hopping Sequences

机译:k重合跳频序列的组合特征

获取原文

摘要

Cao et al. characterize one-coincidence frequency-hopping (OC-FH) sequences in terms of perfect Mendelsohn packings (PMP). In this note, we generalize the definition of $(v, n, lambda)$-PMP to $(k, v, n, lambda)$-PMP and provide combinatorial characterizations for sets of $k$-coincidence frequency-hopping ($k$-FH) sequences interms of $(k, v, n, lambda)$-PMP. As a consequence, results on perfect Mendelsohn packings and perfect Mendelsohn designs can be used to construct such sets of $k$-FH sequences.
机译:曹等。用完美的孟德尔松包装(PMP)表征一次巧合的跳频(OC-FH)序列。在本说明中,我们将$(v,n,λ)$-PMP的定义概括为$(k,v,n,λ)$-PMP,并提供了$ k $符合跳频( $(k,v,n,lambda)$-PMP的$ k $ -FH)序列项。结果,完美孟德尔索包装和完美孟德尔索设计的结果可用于构建这样的$ k $ -FH序列集。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号