Trace representation of binary jacobi sequences

Zongduo Dai, Guang Gong, Hong Yeop Song

Research output: Contribution to journalConference article

3 Citations (Scopus)

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 languageEnglish
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
Publication statusPublished - 2003 Oct 20

Fingerprint

Binary sequences
Binary Sequences
Linear Complexity
Jacobi
Odd
Trace
Binary
Distinct
Theorem

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

@article{6d6e29a6ec6646c0a82f054835645169,
title = "Trace representation of binary jacobi sequences",
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.",
author = "Zongduo Dai and Guang Gong and Song, {Hong Yeop}",
year = "2003",
month = "10",
day = "20",
language = "English",
journal = "IEEE International Symposium on Information Theory - Proceedings",
issn = "2157-8095",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

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

In: IEEE International Symposium on Information Theory - Proceedings, 20.10.2003.

Research output: Contribution to journalConference 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 -