首页> 外文期刊>IEEE Transactions on Information Theory >Nonbinary Kasami sequences over GF(p)
【24h】

Nonbinary Kasami sequences over GF(p)

机译:GF(p)上的非二元Kasami序列

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

摘要

The correlation values and the distribution of these correlation values for the small set of nonbinary Kasami sequences over GF(p) (p prime) are presented. The correlation results are an extension of the binary results and have p+2 correlation levels. This nonbinary Kasami set is asymptotically optimum with respect to its correlation properties. These sequences are obtained, as in the binary case, from a large primitive polynomial of degree n=2 m and a small primitive polynomial of degree m that yields a sequence length of p/sup n/-1 and maximum nontrivial correlation value of 1+p/sup m/. Nonbinary Kasami sequences are directly implemented using shift registers and are applicable for code division multiple access systems.
机译:给出了在GF(p)(p素数)上的一小部分非二进制Kasami序列的相关值和这些相关值的分布。相关结果是二进制结果的扩展,并且具有p + 2相关级别。就其相关特性而言,此二元Kasami集是渐近最优的。与二元情况一样,这些序列是从度数n = 2 m的大原始多项式和度数m的小原始多项式获得的,该多项式的序列长度为p / sup n / -1,最大非平凡相关值为1 + p / sup m /。非二进制Kasami序列是使用移位寄存器直接实现的,适用于码分多址系统。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号