Change search
ReferencesLink to record
Permanent link

Direct link
Least Period Of Linear Recurring Sequences Over The Finite Field
Linnaeus University, Faculty of Science and Engineering, School of Computer Science, Physics and Mathematics.
2012 (English)Independent thesis Advanced level (degree of Master (Two Years)), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

This thesis deals with fundamental concepts of linear recurring sequences over the finite fields. The theory of linear recurrence sequences(LRS) over finite field has great importance in cryptography, electric engineering and pseudo-random number generators. Linear recurring sequences and polynomials over finite field Fq are closely related. The least period of recurring sequences are discussed with the reducibility of corresponding characteristic polynomials. Few examples are constructed to find the least period of linear recurring sequences having reducible or irreducible characteristic polynomials.

Place, publisher, year, edition, pages
2012. , 24 p.
National Category
URN: urn:nbn:se:lnu:diva-17904OAI: diva2:507821
Subject / course
Educational program
Mathematics and Modelling, Master Programme, 120 credits
Physics, Chemistry, Mathematics
Available from: 2012-03-06 Created: 2012-03-06 Last updated: 2012-03-06Bibliographically approved

Open Access in DiVA

fulltext(343 kB)826 downloads
File information
File name FULLTEXT01.pdfFile size 343 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Hanif, Sajid
By organisation
School of Computer Science, Physics and Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 831 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 99 hits
ReferencesLink to record
Permanent link

Direct link