Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Prikladnaya Diskretnaya Matematika. Supplement, 2012, Issue 5, Pages 8–9 (Mi pdma12)  
Theoretical Foundations of Applied Discrete Mathematics

Linear complexity of generalized cyclotomic sequences with period $2^mp^n$

V. A. Edemskiy, O. V. Antonova

Novgorod State University, Novgorod the Great
Full-text PDF (368 kB)
References:
PDF
HTML
Abstract: A method for analyzing the linear complexity of generalized cyclotomic sequences with period $2^mp^n$ is proposed. It allows to pick out sequences with the high linear complexity. The linear complexity of some sequences is computed on the base of classes of quadratic and biquadratic residues.
Document Type: Article
UDC: 519.7
Language: Russian
Citation: V. A. Edemskiy, O. V. Antonova, “Linear complexity of generalized cyclotomic sequences with period $2^mp^n$”, Prikl. Diskr. Mat. Suppl., 2012, no. 5, 8–9
Citation in format AMSBIB
\Bibitem{EdeAnt12}
\by V.~A.~Edemskiy, O.~V.~Antonova
\paper Linear complexity of generalized cyclotomic sequences with period~$2^mp^n$
\jour Prikl. Diskr. Mat. Suppl.
\yr 2012
\issue 5
\pages 8--9
\mathnet{http://mi.mathnet.ru/pdma12}
Linking options:
  • https://www.mathnet.ru/eng/pdma12
  • https://www.mathnet.ru/eng/pdma/y2012/i5/p8
    Cycle of papers
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Prikladnaya Diskretnaya Matematika. Supplement
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024