### 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 |
---|---|

Number of pages | 1 |

Journal | IEEE International Symposium on Information Theory - Proceedings |

Publication status | Published - 2003 Oct 20 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Electrical and Electronic Engineering

### Cite this

}

**Trace representation of binary jacobi sequences.** / Dai, Zongduo; Gong, Guang; Song, Hong Yeop.

Research output: Contribution to journal › Conference article

TY - JOUR

T1 - Trace representation of binary jacobi sequences

AU - Dai, Zongduo

AU - Gong, Guang

AU - Song, Hong Yeop

PY - 2003/10/20

Y1 - 2003/10/20

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

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

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

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

M3 - Conference article

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8095

ER -