One-error linear complexity over Fp of sidelnikov sequences

Yu Chang Eun; Hong Yeop Song; Gohar M. Kyureghyan

doi:10.1007/11423461_9

One-error linear complexity over F_p of sidelnikov sequences

Yu Chang Eun, Hong Yeop Song, Gohar M. Kyureghyan

Department of Electrical and Electronic Engineering

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

15 Citations (Scopus)

Abstract

Let p be an odd prime and m be a positive integer. In this paper, we prove that the one-error linear complexity over F_p of Sidelnikov sequences of length p^m - 1 is (p+1/2)^m - 1, which is much less than its (zero-error) linear complexity.

Original language	English
Pages (from-to)	154-165
Number of pages	12
Journal	Lecture Notes in Computer Science
Volume	3486
DOIs	https://doi.org/10.1007/11423461_9
Publication status	Published - 2005
Event	Third International Conference on Sequences and Their Applications - SETA 2004 - Seoul, Korea, Republic of Duration: 2004 Oct 24 → 2004 Oct 28

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/11423461_9

Cite this

@article{276c9c8235af46e5b0c71fc8085ef65b,

title = "One-error linear complexity over Fp of sidelnikov sequences",

abstract = "Let p be an odd prime and m be a positive integer. In this paper, we prove that the one-error linear complexity over Fp of Sidelnikov sequences of length pm - 1 is (p+1/2)m - 1, which is much less than its (zero-error) linear complexity.",

author = "Eun, {Yu Chang} and Song, {Hong Yeop} and Kyureghyan, {Gohar M.}",

year = "2005",

doi = "10.1007/11423461_9",

language = "English",

volume = "3486",

pages = "154--165",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

note = "Third International Conference on Sequences and Their Applications - SETA 2004 ; Conference date: 24-10-2004 Through 28-10-2004",

}

TY - JOUR

T1 - One-error linear complexity over Fp of sidelnikov sequences

AU - Eun, Yu Chang

AU - Song, Hong Yeop

AU - Kyureghyan, Gohar M.

PY - 2005

Y1 - 2005

N2 - Let p be an odd prime and m be a positive integer. In this paper, we prove that the one-error linear complexity over Fp of Sidelnikov sequences of length pm - 1 is (p+1/2)m - 1, which is much less than its (zero-error) linear complexity.

AB - Let p be an odd prime and m be a positive integer. In this paper, we prove that the one-error linear complexity over Fp of Sidelnikov sequences of length pm - 1 is (p+1/2)m - 1, which is much less than its (zero-error) linear complexity.

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

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

U2 - 10.1007/11423461_9

DO - 10.1007/11423461_9

M3 - Conference article

AN - SCOPUS:24944587121

SN - 0302-9743

VL - 3486

SP - 154

EP - 165

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - Third International Conference on Sequences and Their Applications - SETA 2004

Y2 - 24 October 2004 through 28 October 2004

ER -

One-error linear complexity over F_p of sidelnikov sequences

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this