首页> 外文会议>2012 International Symposium on Information Theory and its Applications. >Linear complexity of quaternary sequences constructed from binary Legendre sequences
【24h】

Linear complexity of quaternary sequences constructed from binary Legendre sequences

机译:由二元勒让德序列构造的四元序列的线性复杂度

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

摘要

In this paper, we derive the linear complexity of the quaternary sequences proposed by Kim, Jang, Kim, and No. Because the period of the quaternary sequences is 2p, we introduce the discrete Fourier transform over the finite field Fqm which is a splitting field of x2p − 1. It turns out that the linear complexity over Fqm of the quaternary sequence constructed from the Legendre sequence is p or 2p − 1.
机译:在本文中,我们推导了Kim,Jang,Kim和No提出的四元序列的线性复杂度。由于四元序列的周期为2p,因此我们在有限域F qm < / inf>是x 2p − 1的分裂字段。事实证明,从勒让德序列构造的四元序列在F qm 上的线性复杂度是p或2p-1。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号