10 search results - page 1 / 2 » Almost p-Ary Perfect Sequences |
SETA
2010
Springer
13 years 3 months ago
2010
Springer
A sequence a = (a0, a1, a2, · · · , an) is said to be an almost p-ary sequence of period n + 1 if a0 = 0 and ai = ζbi p for 1 ≤ i ≤ n, where ζp is a primitive p-th root of...
EUROCRYPT
1987
Springer
13 years 9 months ago
1987
Springer
Sequences with almost perfect linear complexity profile are defined by H. Niederreiter[4]. C.P. Xing and K.Y. Lam[5, 6] extended this concept from the case of single sequences to ...
DAM
1999
13 years 5 months ago
1999
The autocorrelation function of a sequence is a measure for how much the given sequence di ers from its translates. Periodic binary sequences with good correlation properties have...
IPPS
2003
IEEE
13 years 10 months ago
2003
IEEE
The standard algorithm for alignment of DNA sequences using dynamic programming has been implemented on the Cray MTA-2 (Multithreaded Architecture-2) at ENRI (Electronic Navigatio...
CIKM
2009
Springer
14 years 3 days ago
2009
Springer
The popularity of Wikipedia and other online knowledge bases has recently produced an interest in the machine learning community for the problem of automatic linking. Automatic hy...