...
首页> 外文期刊>Designs, Codes and Crytography >Primitive polynomials,singer cycles and word-oriented linear feedback shift registers
【24h】

Primitive polynomials,singer cycles and word-oriented linear feedback shift registers

机译:原始多项式,歌手周期和面向单词的线性反馈移位寄存器

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

摘要

Using the structure of Singer cycles in general linear groups,we prove that a conjecture of Zeng et al.(Word-Oriented Feedback Shift Register:σ-LFSR, 2007) holds in the affirmative in a special case, and outline a plausible approach to prove it in the general case. This conjecture is about the number of primitive σ-LFSRs of a given order over a finite field,and it generalizes a known formula for the number of primitive LFSRs, which, in turn, is the number of primitive polynomials of a given degree over a finite field. Moreover, this conjecture is intimately related to an open question of Niederreiter (Finite Fields Appl 1:3-30,1995) on the enumeration of splitting subspaces of a given dimension.
机译:利用一般线性群中Singer循环的结构,我们证明了Zeng等人的猜想(Word-Oriented Feedback Shift Register:σ-LFSR,2007)在特殊情况下是肯定的,并概述了一种可行的方法在一般情况下证明这一点。这个猜想是关于有限域上给定阶数的本原σ-LFSR的数目,并且它概括了一个原始LFSR数的已知公式,这又是一个给定度数上a的原始多项式的数目。有限域。而且,这个猜想与Niederreiter的公开问题(Finite Fields Appl 1:3-30,1995)密切相关,该问题涉及给定维的分裂子空间的枚举。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号