论文信息 - Enumeration of Splitting Subspaces over Finite Fields

Enumeration of Splitting Subspaces over Finite Fields

We discuss an elementary, yet unsolved, problem of Niederreiter concerning the enumeration of a class of subspaces of finite dimensional vector spaces over finite fields. A short and self-contained account of some recent progress on this problem is included and some related problems are discussed.

Sudhir R. Ghorpade | Samrith Ram

[1] Sudhir R. Ghorpade,et al. Relatively prime polynomials and nonsingular Hankel matrices over finite fields , 2011, J. Comb. Theory, Ser. A.

[2] I. N. Herstein,et al. The probability that a matrix be nilpotent , 1958 .

[3] Doron Zeilberger,et al. A Pentagonal Number Sieve , 1998, J. Comb. Theory, Ser. A.

[4] Daniel Panario,et al. Linear transformation shift registers , 2003, IEEE Trans. Inf. Theory.

[5] Arthur T. Benjamin,et al. The Probability of Relatively Prime Polynomials , 2007 .

[6] Wenbao Han,et al. High Efficiency Feedback Shift Register : σ − LFSR ? , 2007 .

[7] H. Niederreiter. The Multiple-Recursive Matrix Method for Pseudorandom Number Generation , 1995 .

[8] H. Niederreiter. Factorization of polynomials and some linear-algebra problems over finite fields , 1993 .

[9] Neil Genzlinger. A. and Q , 2006 .

[10] Qiang Wang,et al. Word-Oriented Transformation Shift Registers and Their Linear Complexity , 2012, SETA.

[11] J Botha. Matrices over Finite Fields , 2013 .

[12] Boaz Tsaban,et al. Efficient linear feedback shift registers with maximal period , 2002, IACR Cryptol. ePrint Arch..

[13] Sudhir R. Ghorpade,et al. Block companion Singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields , 2011, Finite Fields Their Appl..

[14] Meena Kumari,et al. Primitive polynomials, singer cycles and word-oriented linear feedback shift registers , 2009, Des. Codes Cryptogr..