• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>World Conference on Information Systems and Technologies >Graph colouring and branch and bound approaches for permutation code algorithms
【24h】

Graph colouring and branch and bound approaches for permutation code algorithms

机译：图形着色和分支和置换码算法的绑定方法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A considerable amount of research has been devoted to permutation codes in recent years. This has been motivated by some real-world applications. Permutation codes are important because of their robustness against transmission errors and noise. This study addresses the problem of the construction of the largest possible permutation codes with given parameters, namely a specified length and minimum Hamming distance. The problem is modelled in terms of maximum cliques and it is shown how a well-known upper bound based on colouring can be successfully embedded inside a branch and bound method. Experimental results are presented to evaluate the effectiveness of the new idea.
机译：近年来一直致力于排列代码的大量研究。这一直受到一些现实世界的应用。由于其鲁棒性反对传输错误和噪声，排列码很重要。本研究解决了具有给定参数的最大可能置换码的问题，即指定的长度和最小汉明距离。问题是在最大派系上建模的，并且示出了如何在分支和绑定方法内成功地嵌入着着色的众所周知的上限。提出了实验结果来评估新想法的有效性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号