Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences

Tor Helleseth; Sang Hyo Kim; Jong Seon No

Linear complexity over F_p and trace representation of Lempel-Cohn-Eastman sequences

Tor Helleseth
, Sang Hyo Kim
, Jong Seon No

University of Bergen

Research output: Contribution to journal › Conference article › peer-review

Abstract

Linear complexity over F_p and trace representation of Lempel-Cohn-Eastman (LCE) sequences were presented. The LCE sequences was expressed with indicator function and the quadratic character. The linear complexity over F₃ of the LCE sequence of period n = 3^m - 1 was derived. The p-ranks of LCE sequences for p = 5,7 was also derived.

Original language	English
Pages (from-to)	180
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
State	Published - 2002
Externally published	Yes
Event	2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland Duration: 30 Jun 2002 → 5 Jul 2002

Cite this

@article{5a7a76fa71dd4688a5b0e075facc77e8,

title = "Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences",

abstract = "Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman (LCE) sequences were presented. The LCE sequences was expressed with indicator function and the quadratic character. The linear complexity over F3 of the LCE sequence of period n = 3m - 1 was derived. The p-ranks of LCE sequences for p = 5,7 was also derived.",

author = "Tor Helleseth and Kim, \{Sang Hyo\} and No, \{Jong Seon\}",

year = "2002",

language = "English",

pages = "180",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8095",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "2002 IEEE International Symposium on Information Theory ; Conference date: 30-06-2002 Through 05-07-2002",

}

TY - JOUR

T1 - Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences

AU - Helleseth, Tor

AU - Kim, Sang Hyo

AU - No, Jong Seon

PY - 2002

Y1 - 2002

N2 - Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman (LCE) sequences were presented. The LCE sequences was expressed with indicator function and the quadratic character. The linear complexity over F3 of the LCE sequence of period n = 3m - 1 was derived. The p-ranks of LCE sequences for p = 5,7 was also derived.

AB - Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman (LCE) sequences were presented. The LCE sequences was expressed with indicator function and the quadratic character. The linear complexity over F3 of the LCE sequence of period n = 3m - 1 was derived. The p-ranks of LCE sequences for p = 5,7 was also derived.

UR - https://www.scopus.com/pages/publications/0036350810

M3 - Conference article

AN - SCOPUS:0036350810

SN - 2157-8095

SP - 180

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - 2002 IEEE International Symposium on Information Theory

Y2 - 30 June 2002 through 5 July 2002

ER -

Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences

Abstract

Other files and links

Cite this

Linear complexity over F_p and trace representation of Lempel-Cohn-Eastman sequences