### Abstract

Let p and q be two distinct odd primes. A binary sequences s={(t)|t≥0} of period pq is defined. From the definition, two cases are considered. From the main theorem, the linear complexity is given each of the cases.

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

Pages (from-to) | 379 |

Number of pages | 1 |

Journal | IEEE International Symposium on Information Theory - Proceedings |

Publication status | Published - 2003 |

Event | Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: 2003 Jun 29 → 2003 Jul 4 |

### All Science Journal Classification (ASJC) codes

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

## Fingerprint Dive into the research topics of 'Trace representation of binary jacobi sequences'. Together they form a unique fingerprint.

## Cite this

Dai, Z., Gong, G., & Song, H. Y. (2003). Trace representation of binary jacobi sequences.

*IEEE International Symposium on Information Theory - Proceedings*, 379.