One-error linear complexity over Fp of sidelnikov sequences

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

Research output: Contribution to journalConference article

10 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 Fp of Sidelnikov sequences of length pm - 1 is (p+1/2)m - 1, which is much less than its (zero-error) linear complexity.

Original languageEnglish
Pages (from-to)154-165
Number of pages12
JournalLecture Notes in Computer Science
Volume3486
Publication statusPublished - 2005 Sep 27
EventThird International Conference on Sequences and Their Applications - SETA 2004 - Seoul, Korea, Republic of
Duration: 2004 Oct 242004 Oct 28

Fingerprint

Linear Complexity
p.m.
Odd
Integer
Zero

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Eun, Yu Chang ; Song, Hong Yeop ; Kyureghyan, Gohar M. / One-error linear complexity over Fp of sidelnikov sequences. In: Lecture Notes in Computer Science. 2005 ; Vol. 3486. pp. 154-165.
@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",
month = "9",
day = "27",
language = "English",
volume = "3486",
pages = "154--165",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

One-error linear complexity over Fp of sidelnikov sequences. / Eun, Yu Chang; Song, Hong Yeop; Kyureghyan, Gohar M.

In: Lecture Notes in Computer Science, Vol. 3486, 27.09.2005, p. 154-165.

Research output: Contribution to journalConference article

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/9/27

Y1 - 2005/9/27

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

M3 - Conference article

AN - SCOPUS:24944587121

VL - 3486

SP - 154

EP - 165

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -