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

From MaRDI portal
Publication:629934

DOI10.1007/S10623-010-9387-7zbMATH Open1263.11108arXiv0904.1331OpenAlexW3099877718MaRDI QIDQ629934FDOQ629934


Authors: Sudhir R. Ghorpade, Sartaj Ul Hasan, Meena Kumari Edit this on Wikidata


Publication date: 10 March 2011

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (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 sigma-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 (1995) on the enumeration of splitting subspaces of a given dimension.


Full work available at URL: https://arxiv.org/abs/0904.1331




Recommendations




Cites Work


Cited In (29)





This page was built for publication: Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q629934)