• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Designs, Codes and Crytography >A new iterative computer search algorithm for good quasi-twisted codes
【24h】

A new iterative computer search algorithm for good quasi-twisted codes

机译：一种新的良好扭曲代码的迭代计算机搜索算法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

As a generalization to cyclic and consta-cyclic codes, quasi-twisted (QT) codes contain many good linear codes. During the last twenty years, a lot of record-breaking codes have been found by computer search for good QT codes. But due to the time complexity, very few QT codes have been reported recently. In this paper, a new iterative, heuristic computer search algorithm is presented, and a lot of new QT codes have been obtained. With these results, a total of 45 entries in the code tables for the best-known codes have been improved. Also, as an example to show the effectiveness of the algorithm, 8 better binary quasi-cyclic codes with dimension 12 and than previously best-known results are constructed.
机译：作为循环码和常量循环码的概括，准扭曲（QT）码包含许多良好的线性码。在过去的二十年中，通过计算机搜索找到了许多创纪录的代码，以寻找优质的QT代码。但是由于时间的复杂性，最近报告的QT代码很少。本文提出了一种新的迭代启发式计算机搜索算法，并获得了许多新的QT代码。有了这些结果，最知名代码的代码表中总共增加了45个条目。同样，作为展示该算法有效性的示例，构建了8个更好的尺寸为12且比以前最著名的结果更好的二进制准循环码。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号