### Abstract

We review prime n-square sequences of length p^{n} 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 language | English |
---|---|

Title of host publication | Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008 |

Pages | 2405-2408 |

Number of pages | 4 |

DOIs | |

Publication status | Published - 2008 Sep 29 |

Event | 2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada Duration: 2008 Jul 6 → 2008 Jul 11 |

### Other

Other | 2008 IEEE International Symposium on Information Theory, ISIT 2008 |
---|---|

Country | Canada |

City | Toronto, ON |

Period | 08/7/6 → 08/7/11 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

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

### Cite this

*Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008*(pp. 2405-2408). [4595422] https://doi.org/10.1109/ISIT.2008.4595422

}

*Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008.*, 4595422, pp. 2405-2408, 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, 08/7/6. https://doi.org/10.1109/ISIT.2008.4595422

**Linear complexity of prime n-square sequences.** / Kim, Young Joon; Song, Hong-Yeop.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Linear complexity of prime n-square sequences

AU - Kim, Young Joon

AU - Song, Hong-Yeop

PY - 2008/9/29

Y1 - 2008/9/29

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=52349114572&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=52349114572&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2008.4595422

DO - 10.1109/ISIT.2008.4595422

M3 - Conference contribution

SN - 9781424422579

SP - 2405

EP - 2408

BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008

ER -