Linear complexity and autocorrelation of prime cube sequences

Young Joon Kim, Seok Yong Jin, Hong Yeop Song

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Citations (Scopus)

Abstract

We review a binary sequence based on the generalized cyclotomy of order 2 with respect to p3, where p is an odd prime. Linear complexities, minimal polynomials and autocorrelation of these sequences are computed.

Original languageEnglish
Title of host publicationApplied Algebra, Algebraic Algorithms and Error-Correcting Codes - 17th International Symposium, AAECC- 17, Proceedings
Pages188-197
Number of pages10
Publication statusPublished - 2007 Dec 1
Event17th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-17 - Bangalore, India
Duration: 2007 Dec 162007 Dec 20

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4851 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other17th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-17
CountryIndia
CityBangalore
Period07/12/1607/12/20

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Linear complexity and autocorrelation of prime cube sequences'. Together they form a unique fingerprint.

  • Cite this

    Kim, Y. J., Jin, S. Y., & Song, H. Y. (2007). Linear complexity and autocorrelation of prime cube sequences. In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 17th International Symposium, AAECC- 17, Proceedings (pp. 188-197). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4851 LNCS).