...
首页> 外文期刊>Finite fields and their applications >Improved linear programming bound on sizes of doubly constant-weight codes
【24h】

Improved linear programming bound on sizes of doubly constant-weight codes

机译:改进的线性规划,适用于双重恒权码的大小

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

获取外文期刊封面封底 >>

       

摘要

In this paper we give new constraints on the distance distribution of doubly constant-weight (binary) codes. These constraints improve the linear programming bound on sizes of doubly constant-weight codes. Computations are done for all codes of length n = 28 and all improved upper bounds are shown. We moreover show that the improved upper bounds give rise to further new upper bounds. (C) 2018 Elsevier Inc. All rights reserved.
机译:在本文中,我们对双重等权重(二进制)代码的距离分布给出了新的约束。这些约束改善了双重恒定权码大小的线性编程边界。对长度为n <= 28的所有代码进行了计算,并显示了所有改进的上限。此外,我们表明,改进的上限产生了新的上限。 (C)2018 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号