Sciweavers

6 search results - page 1 / 2
» Linear Complexity and Autocorrelation of Prime Cube Sequence...
Sort
View
AAECC
2007
Springer
133views Algorithms» more  AAECC 2007»
13 years 10 months ago
Linear Complexity and Autocorrelation of Prime Cube Sequences
Abstract. We review a binary sequence based on the generalized cyclotomy of order 2 with respect to p3 , where p is an odd prime. Linear complexities, minimal polynomials and autoc...
Young-Joon Kim, Seok-Yong Jin, Hong-Yeop Song
TIT
2008
78views more  TIT 2008»
13 years 4 months ago
New Binary Sequences With Optimal Autocorrelation Magnitude
New binary sequences of period
Nam Yul Yu, Guang Gong
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
12 years 4 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 4 months ago
New Sequences Design from Weil Representation with Low Two-Dimensional Correlation in Both Time and Phase Shifts
For a given prime p, a new construction of families of the complex valued sequences of period p with efficient implementation is given by applying both multiplicative characters a...
Zilong Wang, Guang Gong
JC
2007
96views more  JC 2007»
13 years 4 months ago
Error linear complexity measures for multisequences
Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments ...
Wilfried Meidl, Harald Niederreiter, Ayineedi Venk...