中文摘要：

有理想的关联函数的序列在象 CDMA 那样的通讯有重要应用程序， FDMA，等等。差别集合能被用来构造如此的序列，这被显示出。作者扩大 Pott；Bradley 的方法到由建议概括差别集合的概念的一个宽广得多的案例。为概括差别集合的存在的一些必要条件借助于一些 Diophantine 方程被建立。作者也提供一个算法在周期的组决定概括差别集合的存在。一些例子被举说明那我们的方法工作。

英文摘要：

Sequences with ideal correlation functions have important applications in communications such as CDMA, FDMA, etc. It has been shown that difference sets can be used to construct such sequences. The author extends Pott and Bradley＇s method to a much broader case by proposing the concept of generalized difference sets. Some necessary conditions for the existence of generalized difference sets are established by means of some Diophantine equations. The author also provides an algorithm to determine the existence of generalized difference sets in the cyclic group Zv. Some examples are presented to illustrate that our method works.