• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Designs, Codes and Crytography >On relative constant-weight codes
【24h】

On relative constant-weight codes

机译：关于相对恒重码

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

摘要

In this paper, relative two-weight and three-weight codes are studied, which are both called relative constant-weight codes. A geometric approach is introduced to construct and characterize relative constant-weight codes, using the finite projective geometry. A sufficient and necessary condition is derived for linear codes to be relative constant-weight codes, based on the geometric approach. A family of infinite number of relative constant-weight codes are constructed, which includes dual Hamming codes and subcodes of punctured Reed-Muller codes as special instances. It is well known that determining all the minimal codewords is a hard problem for an arbitrary linear code. For relative constant-weight codes, minimal codewords are completely determined in this paper. Based on the above-mentioned results, applications of relative constant-weight codes to wire-tap channel of type Ⅱ and secret sharing are discussed. A comparative study shows that relative constant-weight codes form a new family. They are not covered by the previously well-known three-weight codes or linear codes for which minimal codewords can be determined.
机译：本文研究了相对二权和三权码，它们都称为相对恒权码。引入了一种几何方法，以使用有限射影几何来构造和表征相对等权重代码。基于几何方法，得出了一个充分必要的条件，以使线性编码成为相对等权重编码。构造了无数个相对恒定权重代码家族，其中包括双重汉明码和打孔的里德穆勒码的子码作为特殊实例。众所周知，对于任意线性码而言，确定所有最小码字是一个难题。对于相对恒定权重的代码，本文完全确定了最少的代码字。基于上述结果，讨论了相对恒定权重码在Ⅱ类窃听通道和秘密共享中的应用。一项比较研究表明，相对恒定权重的代码构成了一个新的家族。它们不能被先前已知的三重码或线性码所覆盖，对于这些三权重码或线性码可以确定最小的码字。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号