首页> 外文会议>International workshop on matrix analysis and applications >The Resaearch on the Minimum Distance of Generalized Hadamard Codes
【24h】

The Resaearch on the Minimum Distance of Generalized Hadamard Codes

机译:广义Hadamard代码的最小距离的研究

获取原文

摘要

The problem about the minimum distance of generalized Hadamard code C is discussed. This paper derived that the generalized Hadamard code C was a code in F2n, the length of the code was n, and the dimension was 2(n+1). Moreover, the minimum distance of generalized Hadamard codes is (n-3)/2, which is proved finally.
机译:讨论了关于广义Hadamard Code C的最小距离的问题。本文导出,广义Hadamard代码C是F2N中的代码,代码的长度为n,尺寸为2(n + 1)。此外,广泛化的Hadamard代码的最小距离是(n-3)/ 2,其最终被证明。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号