## Abstract

We propose an appropriate approach of defining the LC of sequences over unknown symbol set. We are able to characterize those p-ary sequences whose k-tuple versions now over GF(p^{k}) have the same characteristic polynomial as the original with repect to any basis. This leads to a construction of p^{k}-ary sequences whose characteristic polynomial is essentially over GF(p).

Original language | English |
---|---|

Pages (from-to) | 468 |

Number of pages | 1 |

Journal | IEEE International Symposium on Information Theory - Proceedings |

Publication status | Published - 2002 |

Event | 2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland Duration: 2002 Jun 30 → 2002 Jul 5 |

## 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 sequences over arbitrary symbols and constructions of sequences over GF(p^{k}) whose characteristic polynomial is over GF(p)'. Together they form a unique fingerprint.