The perfect sequences are so ideal that all out-of-phase autocorrelation coefficients are zero, and if the sequences are used as the coding modulating signal for the phase-modulated radar, there will be no interferenc...The perfect sequences are so ideal that all out-of-phase autocorrelation coefficients are zero, and if the sequences are used as the coding modulating signal for the phase-modulated radar, there will be no interference of side lobes theoretically. However, it has been proved that there are no binary perfect sequences of period 4 〈 n ≤ 12100. Hence, the almost perfect sequences with all out-of-phase autocorrelation coefficients as zero except one are of great practice in engineering. Currently, the cyclic difference set is one of most effective tools to analyze the binary sequences with perfect periodic autocorrelation function. In this article, two characteristic formulas corresponding to the autocorrelation and symmetric structure of almost perfect sequences are calculated respectively. All almost perfect sequences with period n, which is a multiple of 4, can be figured out by the two formulas. Several almost perfect sequences with different periods have been hunted by the program based on the two formulas and then applied to the simulation program and practical application for ionospheric sounding.展开更多
The concept of the binary sequence pair is generalized from a single binary sequence. Binary sequence pairs are applied in many fields of radar, sonar or communication systems, in which signals with optimal periodic c...The concept of the binary sequence pair is generalized from a single binary sequence. Binary sequence pairs are applied in many fields of radar, sonar or communication systems, in which signals with optimal periodic correlation are required. Several types of almost perfect binary sequence pairs of length T = 2q are constructed, where q is an odd number. These almost perfect binary sequence pairs are based on binary ideal sequence or binary ideal two-level correlation sequence pairs by using Chinese remainder theorem. For these almost perfect binary sequence pairs with good balanced property, their corresponding divisible difference set pairs(DDSPs) are also derived.展开更多
An integral domain R is called a locally almost perfect domain provided that Rm is an almost perfect domain for any maximal ideal m of R.In this paper,we give several characterizations of locally almost perfect domain...An integral domain R is called a locally almost perfect domain provided that Rm is an almost perfect domain for any maximal ideal m of R.In this paper,we give several characterizations of locally almost perfect domains in terms of locally perfect rings,almost projective modules,weak-injective modules,almost strongly flat modules and strongly Matlis cotorsion modules.展开更多
A graph G is close to regular or more precisely a （d, d ＋ k）-graph, if the degree of each vertex of G is between d and d ＋ k. Let d ≥ 2 be an integer, and let G be a connected bipartite （d, d＋k）-graph with par...A graph G is close to regular or more precisely a （d, d ＋ k）-graph, if the degree of each vertex of G is between d and d ＋ k. Let d ≥ 2 be an integer, and let G be a connected bipartite （d, d＋k）-graph with partite sets X and Y such that ｜X｜- ｜Y｜＋1. If G is of order n without an almost perfect matching, then we show in this paper that·n ≥ 6d ＋7 when k = 1,·n ≥ 4d＋ 5 when k = 2,·n ≥ 4d＋3 when k≥3.Examples will demonstrate that the given bounds on the order of G are the best possible.展开更多
In this paper, we introduce the concept of almost cotorsion modules. A module is called almost cotorsion if it is subisomorphic to its cotorsion envelope. Some characterizations of almost cotorsion modules are given. ...In this paper, we introduce the concept of almost cotorsion modules. A module is called almost cotorsion if it is subisomorphic to its cotorsion envelope. Some characterizations of almost cotorsion modules are given. It is also proved that every module is a direct summand of an almost cotorsion module. As an application, perfect rings are characterized in terms of almost cotorsion modules.展开更多
Functions with difference uniformity have important applications in cryptography. Some planar functions and almost perfect nonlinear（APN） functions are presented in the note. In addition, an upper bound of the unifo...Functions with difference uniformity have important applications in cryptography. Some planar functions and almost perfect nonlinear（APN） functions are presented in the note. In addition, an upper bound of the uniformity of some power mappings is provided by using an interesting identity on Dickson polynomials. When the character of the finite field is less than 11, the upper bound is proved to be the best possibility.展开更多
基金This poject was supported by the National Natural Science Foundation of China (40474066).
文摘The perfect sequences are so ideal that all out-of-phase autocorrelation coefficients are zero, and if the sequences are used as the coding modulating signal for the phase-modulated radar, there will be no interference of side lobes theoretically. However, it has been proved that there are no binary perfect sequences of period 4 〈 n ≤ 12100. Hence, the almost perfect sequences with all out-of-phase autocorrelation coefficients as zero except one are of great practice in engineering. Currently, the cyclic difference set is one of most effective tools to analyze the binary sequences with perfect periodic autocorrelation function. In this article, two characteristic formulas corresponding to the autocorrelation and symmetric structure of almost perfect sequences are calculated respectively. All almost perfect sequences with period n, which is a multiple of 4, can be figured out by the two formulas. Several almost perfect sequences with different periods have been hunted by the program based on the two formulas and then applied to the simulation program and practical application for ionospheric sounding.
基金supported by the National Natural Science Foundation of China(6160140161501395+6 种基金6160139961671402)Natural Science Foundation of Hebei Province(F2015203150F2016203293F2016203312)Natural Science Research Programs of Hebei Educational Committee(QN2016120)the Independent Research Programs for Young Teachers of Yanshan University(15LGB013)
文摘The concept of the binary sequence pair is generalized from a single binary sequence. Binary sequence pairs are applied in many fields of radar, sonar or communication systems, in which signals with optimal periodic correlation are required. Several types of almost perfect binary sequence pairs of length T = 2q are constructed, where q is an odd number. These almost perfect binary sequence pairs are based on binary ideal sequence or binary ideal two-level correlation sequence pairs by using Chinese remainder theorem. For these almost perfect binary sequence pairs with good balanced property, their corresponding divisible difference set pairs(DDSPs) are also derived.
基金Supported by the National Natural Science Foundation of China(Grant No.12061001).
文摘An integral domain R is called a locally almost perfect domain provided that Rm is an almost perfect domain for any maximal ideal m of R.In this paper,we give several characterizations of locally almost perfect domains in terms of locally perfect rings,almost projective modules,weak-injective modules,almost strongly flat modules and strongly Matlis cotorsion modules.
文摘A graph G is close to regular or more precisely a （d, d ＋ k）-graph, if the degree of each vertex of G is between d and d ＋ k. Let d ≥ 2 be an integer, and let G be a connected bipartite （d, d＋k）-graph with partite sets X and Y such that ｜X｜- ｜Y｜＋1. If G is of order n without an almost perfect matching, then we show in this paper that·n ≥ 6d ＋7 when k = 1,·n ≥ 4d＋ 5 when k = 2,·n ≥ 4d＋3 when k≥3.Examples will demonstrate that the given bounds on the order of G are the best possible.
基金Specialized Research Fund (20050284015, 20030284033) for the Doctoral Program of Higher Education of China the Postdoctoral Research Fund (2005037713) of China Jiangsu Planned Projects for Postdoctoral Research Fund (0203003403) the Research Fund of Nanjing Institute of Technology of China
文摘In this paper, we introduce the concept of almost cotorsion modules. A module is called almost cotorsion if it is subisomorphic to its cotorsion envelope. Some characterizations of almost cotorsion modules are given. It is also proved that every module is a direct summand of an almost cotorsion module. As an application, perfect rings are characterized in terms of almost cotorsion modules.
文摘Functions with difference uniformity have important applications in cryptography. Some planar functions and almost perfect nonlinear（APN） functions are presented in the note. In addition, an upper bound of the uniformity of some power mappings is provided by using an interesting identity on Dickson polynomials. When the character of the finite field is less than 11, the upper bound is proved to be the best possibility.
