Linear complexity of prime n-square sequences

Young Joon Kim, Hong Yeop Song

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

19 Citations (Scopus)

Abstract

We review prime n-square sequences of length pn which is originally defined by Ding and Helleseth in 1998, where p is an odd prime and n is a positive integer. In this paper, we determine the linear complexity and the minimal polynomial of these sequences for any n. It turned out that these sequences have linear complexity that is of the order of the period p n.

Original languageEnglish
Title of host publicationProceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages2405-2408
Number of pages4
DOIs
Publication statusPublished - 2008
Event2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada
Duration: 2008 Jul 62008 Jul 11

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Other

Other2008 IEEE International Symposium on Information Theory, ISIT 2008
CountryCanada
CityToronto, ON
Period08/7/608/7/11

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Linear complexity of prime n-square sequences'. Together they form a unique fingerprint.

Cite this