2007
DOI: 10.1515/jmc.2007.014
|View full text |Cite
|
Sign up to set email alerts
|

On the k-error linear complexity of cyclotomic sequences

Abstract: Abstract. Exact values and bounds on the k-error linear complexity of p-periodic sequences which are constant on the cyclotomic classes are determined. This family of sequences includes sequences of discrete logarithms, Legendre sequences and Hall's sextic residue sequence.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(20 citation statements)
references
References 16 publications
0
20
0
Order By: Relevance
“…So, by (6) S t (α v ) = 0 if and only if v ∈ H (q) 0 and q ≡ 1 (mod p) and q ≡ 1 (mod 4) or q ≡ −1 (mod p) and q ≡ 3 (mod 4). If S t (α v ) = 0 then by Lemma 4 and Corollary 6 we obtain that α v is a root of S t (x) of multiplicity p. The conclusion of this theorem then follows from (2).…”
Section: The Linear Complexity Of Sequences Over Gf(p)mentioning
confidence: 68%
See 2 more Smart Citations
“…So, by (6) S t (α v ) = 0 if and only if v ∈ H (q) 0 and q ≡ 1 (mod p) and q ≡ 1 (mod 4) or q ≡ −1 (mod p) and q ≡ 3 (mod 4). If S t (α v ) = 0 then by Lemma 4 and Corollary 6 we obtain that α v is a root of S t (x) of multiplicity p. The conclusion of this theorem then follows from (2).…”
Section: The Linear Complexity Of Sequences Over Gf(p)mentioning
confidence: 68%
“…Then, according to (2), (3), in order to find the minimal polynomial and the linear complexity of {s i } over GF(q) or GF(p) it is sufficient to find the roots of S (x) in the set {1, α, . .…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…Theorem 1 Let H = {h 0 , h 1 , · · · , h p−1 } be a period of Hall's sextic sequence defined by (2). Then the correlation measure of order k of H satisfies…”
Section: Correlation Measure Of Order Kmentioning
confidence: 99%
“…The linear complexity of generalized cyclotomic binary sequences of order 2 was investigated in [4] and linear complexity of Ding-Helleseth sequences of order 2 over GF(l) in [17]. The linear complexity of Hall's sextic residue sequences with the length p was considered in [14] over the finite field of order 2 and in [1] over the finite field of p elements. The linear complexity of other binary cyclotomic sequences of order 6 over the finite field of order 2 was investigated in [3,7,15] (also, see references therein).…”
Section: Introductionmentioning
confidence: 99%