首页> 外文期刊>Designs, Codes and Crytography >Extremal self-dual codes of length 64 through neighbors and covering radii
【24h】

Extremal self-dual codes of length 64 through neighbors and covering radii

机译:通过邻居并覆盖半径的长度为64的极值自对偶编码

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

摘要

We construct extremal singly even self-dual [64, 32, 12] codes with weight enumerators which were not known to be attainable. In particular, we find some codes whose shadows have minimum weight 12. By considering their doubly even neighbors, extremal doubly even self-dual [64, 32, 12] codes with covering radius 12 are constructed for the first time.
机译:我们使用重量枚举器构造极个别甚至偶对的[64、32、12]代码,但未知。特别是,我们发现一些阴影阴影的权重最小为12的代码。通过考虑它们的偶数偶数邻居,首次构造了覆盖半径12的极偶偶偶数[64、32、12]码。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号