中文摘要：

最小的多项式和二进制代码的线性复杂性钟声与二素数的残余戒指 Z pq 的顺序 2 的概括 cyclotomic 序列被黄雾在 2005 获得。在这份报纸，我们获得线性复杂性，所有的最小的多项式钟声概括 cyclotomic 序列。我们的结果证明这些序列的那线性复杂性呈现价值 p q 和 p q 吗？1 在我们有概率 1/4 和更低的界限的必要、足够的条件上(p q？1 ) 有概率 1/8 的 /2。这证明大多数这些序列好。我们也获得了那线性复杂性和这些序列的最小的多项式独立于他们的订单。这在选择合适的 p 和 q 使它不再困难。

英文摘要：

Minimal polynomials and linear complexity of binary Ding generalized cyclotomic sequences of order 2 with the two-prime residue ring Zpq are obtained by Bai in 2005. In this paper, we obtain linear complexity and minimal polynomials of all Ding generalized cyclotomic sequences. Our result shows that linear complexity of these sequences takes on the values pq and pq-1 on our necessary and sufficient condition with probability 1/4 and the lower bound （pq - 1）/2 with probability 1/8. This shows that most of these sequences are good. We also obtained that linear complexity and minimal polynomials of these sequences are independent of their orders. This makes it no more difficult in choosing proper p and q.