Zobrazeno 1 - 10
of 50
pro vyhledávání: '"Zongduo Dai"'
Publikováno v:
IEEE Transactions on Information Theory. 57:1530-1547
Let p = ef + 1 be an odd prime for some e and e and let f, be the finite field with Fp elements. In this paper, we explicitly describe the trace representations of the binary characteristic sequences (of period p) of all the cyclic difference sets D
Publikováno v:
Acta Arithmetica. 150:361-384
Autor:
Ping Wang, Zongduo Dai
Publikováno v:
Finite Fields and Their Applications. 14:438-455
The multi-continued fraction expansion C([email protected]?) of a multi-formal Laurent series [email protected]? is a sequence pair ([email protected]?,[email protected]?) consisting of an index sequence [email protected]? and a multi-polynomial sequ
Publikováno v:
Journal of Approximation Theory. 148:194-210
It is shown that each rational approximant to (@w,@w^2)^@t given by the Jacobi-Perron algorithm (JPA) or modified Jacobi-Perron algorithm (MJPA) is optimal, where @w is an algebraic function (a formal Laurent series over a finite field) satisfying @w
Publikováno v:
Acta Arithmetica. 130:127-140
Autor:
Junhui Yang, Zongduo Dai
Publikováno v:
Finite Fields and Their Applications. 12:379-402
An iterative algorithm in solving the linear synthesis problem on multi-sequences over finite fields is derived from the multi-strict continued fraction algorithm (m-SCFA in short). It is interesting that the derived iterative algorithm is the same a
Publikováno v:
Acta Arithmetica. 122:1-16
Publikováno v:
ISIT
Sequences with almost perfect linear complexity profile are defined by Niederreiter (Proceedings of the Salzburg Conference 1986, Vol. 5, Teubner, Stuttgart, 1987, pp. 221–233). Xing and Lam (IEEE Trans. Inform. Theory 45 (1999) 1267; J. Complexity
Publikováno v:
IEEE Transactions on Information Theory. 50:2911-2915
For an ultimately nonperiodic binary sequence s={s/sub t/}/sub t/spl ges/0/, it is shown that the set of the accumulation values of the normalized linear complexity, L/sub s/(n)/n, is a closed interval centered at 1/2, where L/sub s/(n) is the linear
Publikováno v:
Science in China Series F Information Sciences. 45:397-400
In 1993, Alabhadi and Wicker gave a modification to Xinmei Digital Signature Scheme based on error-correcting codes, which is usually denoted by AW Scheme. In this paper we show that the AW Scheme is actually not secure: anyone holding public keys of