首页> 外文期刊>Problems of information transmission >Classification of Optimal (v, 4,1) Binary Cyclically Permutable Constant-Weight Codes and Cyclic 2-(v, 4,1) Designs with v < 76
【24h】

Classification of Optimal (v, 4,1) Binary Cyclically Permutable Constant-Weight Codes and Cyclic 2-(v, 4,1) Designs with v < 76

机译:最优(v,4,1)二元循环可置换恒定重量代码和v <76的循环2-(v,4,1)设计的分类

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

摘要

We classify up to isomorphism optimal (v,4,1) binary cyclically permutable constant-weight (CPCW) codes with v < 76 and cyclic 2-(73,4,1) and 2-(7G,4,1) designs. There is a one-to-one correspondence between optimal (v,4,1) CPCW codes, optimal cyclic binary constant-weight codes with weight 4 and minimum distance 6, (v, 4; [(v - l)/12j) difference packings, and optimal (v,A, 1) optical orthogonal codes. Therefore, the classification of CPCW codes holds for them too. Perfect (v, 4,1) CPCW codes are equivalent to (v, 4,1) cyclic difference families, and thus (73,4,1) cyclic difference families are classified too.
机译:我们根据v <76以及循环2-(73,4,1)和2-(7G,4,1)设计将同构最优(v,4,1)二进制循环可置换恒定权重(CPCW)代码分类。最佳(v,4,1)CPCW码,权重4和最小距离6(v,4; [(v-l)/ 12j)的最优循环二进制恒权码之间存在一一对应关系差异填充和最佳(v,A,1)光学正交码。因此,CPCW代码的分类也适用于它们。完美的(v,4,1)CPCW代码等效于(v,4,1)循环差分族,因此(73,4,1)循环差分族也被分类。

著录项

  • 来源
    《Problems of information transmission》 |2011年第3期|p.224-231|共8页
  • 作者

    T. Baicheva; S. Topalova;

  • 作者单位

    Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Bulgaria;

    Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Bulgaria;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号