首页> 外文期刊>電子情報通信学会技術研究報告. 情報理論. Information Theory >Hadamard-type Matrices on Finite Fields and Complete Complementary Codes
【24h】

Hadamard-type Matrices on Finite Fields and Complete Complementary Codes

机译:有限字段的Hadamard型矩阵和完整的互补代码

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

摘要

Hadamard matrix is defined as a square matrix where any components are -1 or +1, and where any pairs of rows are mutually orthogonal. In this study, we consider the similar matrix on finite field GF(p) where p is an odd prime. In such a matrix, every component is one of the integers on GF(p){0}, that is, {1, 2,...,p-1}. Any additions and multiplications should be executed under modulo p. In this paper, a method to generate such matrices is proposed. In addition, the paper includes the applications to generate n-shift orthogonal sequences and complete complementary codes. The generated complete complementary code is a family of sets of multi-valued sequences on GF(p), where the number of sequence sets, the number of sequences in each sequence set and the sequence length depend on various divisors of p - 1. To the best of the author's knowledge, such complete complementary codes with various parameters have not been proposed in previous studies.
机译:Hadamard矩阵被定义为方形矩阵,其中任何组件为-1或+1,并且在其中任何一对行相互正交。 在这项研究中,我们考虑了有限场GF(P)上的类似矩阵,其中P是奇数的素数。 在这样的矩阵中,每个组件是GF(P) {0}上的整数之一,即{1,2,...,P-1}。 应在Modulo P下执行任何添加和乘法。 在本文中,提出了一种生成这种矩阵的方法。 此外,本文包括生成N移正交序列和完整的互补代码的应用。 生成的完整互补代码是GF(P)上的多值序列集合,其中序列组的数量,每个序列组中的序列数和序列长度依赖于P - 1的各种除数。 提交人的知识中,在以前的研究中尚未提出具有各种参数的这种完整的互补代码。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号