New objects characterizing the structure of complex linear transformations areintroduced. These new objects yield a new result for the decomposition of complexvector spaces relative to complex lrnear transformations a...New objects characterizing the structure of complex linear transformations areintroduced. These new objects yield a new result for the decomposition of complexvector spaces relative to complex lrnear transformations and provide all Jordan basesby which the Jordan canonical form is constructed. Accordingly, they can result in thecelebrated Jordan theorem and the third decomposition theorem of space directly. and,moreover, they can give a new deep insight into the exquisite and subtle structure ofthe Jordan form. The latter indicates that the Jordan canonical form of a complexlinear transformation is an invariant structure associated with double arbitrary. choices.展开更多
In this article, we study the complex oscillation problems of entire solutions to homogeneous and nonhomogeneous linear difference equations, and obtain some relations of the exponent of convergence of zeros and the o...In this article, we study the complex oscillation problems of entire solutions to homogeneous and nonhomogeneous linear difference equations, and obtain some relations of the exponent of convergence of zeros and the order of growth of entire solutions to complex linear difference equations.展开更多
Recently,inspired by a modified generalized shift-splitting iteration method for complex symmetric linear systems,we propose two variants of the modified generalized shift-splitting iteration(MGSS)methods for solving ...Recently,inspired by a modified generalized shift-splitting iteration method for complex symmetric linear systems,we propose two variants of the modified generalized shift-splitting iteration(MGSS)methods for solving com-plex symmetric linear systems.One is a parameterized MGSS iteration method and the other is a modified parameterized MGSS iteration method.We prove that the proposed methods are convergent under appropriate constraints on the parameters.In addition,we also give the eigenvalue distributions of differ-ent preconditioned matrices to verify the effectiveness of the preconditioners proposed in this paper.展开更多
In this paper, a complex parameter is employed in the Hermitian and skew-Hermitian splitting （HSS） method （Bai, Golub and Ng： SIAM J. Matrix Anal. Appl., 24（2003）, 603-626） for solving the complex linear system...In this paper, a complex parameter is employed in the Hermitian and skew-Hermitian splitting （HSS） method （Bai, Golub and Ng： SIAM J. Matrix Anal. Appl., 24（2003）, 603-626） for solving the complex linear system Ax = f. The convergence of the resulting method is proved when the spectrum of the matrix A lie in the right upper （or lower） part of the complex plane. We also derive an upper bound of the spectral radius of the HSS iteration matrix, and a estimated optimal parameter a （denoted by a^st） of this upper bound is presented. Numerical experiments on two modified model problems show that the HSS method with a est has a smaller spectral radius than that with the real parameter which minimizes the corresponding upper hound. In particular, for the ＇dominant＇ imaginary part of the matrix A, this improvement is considerable. We also test the GMRES method preconditioned by the HSS preconditioning matrix with our parameter a est.展开更多
Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of keystreams. For the 2n -periodicperiodic binary sequence with linear complexity 2n 1and k = ...Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of keystreams. For the 2n -periodicperiodic binary sequence with linear complexity 2n 1and k = 2,3,the number of sequences with given k-error linear complexity and the expected k-error linear complexity are provided. Moreover,the proportion of the sequences whose k-error linear complexity is bigger than the expected value is analyzed.展开更多
We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotie...We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotients modulo an odd prime p.If 2 is a primitive element modulo p2,the linear complexity equals to p2-p or p2-1,which is very close to the period and it is large enough for cryptographic purpose.展开更多
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 mini...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.展开更多
The linear complexity of a new kind of keystream sequences.FCSR sequences,is discussed by use of the properties of cyclotomic polynomials.Based on the results of C.Seo's,an upper bound and a lower bound on the li...The linear complexity of a new kind of keystream sequences.FCSR sequences,is discussed by use of the properties of cyclotomic polynomials.Based on the results of C.Seo's,an upper bound and a lower bound on the linear complexity of a significant kind of FCSR sequences—l-sequences are presented.展开更多
The k-error linear complexity and the linear complexity of the keystream of a stream cipher are two important standards to scale the randomness of the key stream. For a pq^n-periodic binary sequences where p, q are tw...The k-error linear complexity and the linear complexity of the keystream of a stream cipher are two important standards to scale the randomness of the key stream. For a pq^n-periodic binary sequences where p, q are two odd primes satisfying that 2 is a primitive root module p and q^2 and gcd（p-1, q-1） = 2, we analyze the relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.展开更多
Both four-ann star-shaped poly（ε-caprolactone） （4sPCL） and two-ann linear PCL （2LPCL） were synthesized and their inclusion complexation with α-cyclodextrin （α-CD） were studied. The inclusion complexes （ICs...Both four-ann star-shaped poly（ε-caprolactone） （4sPCL） and two-ann linear PCL （2LPCL） were synthesized and their inclusion complexation with α-cyclodextrin （α-CD） were studied. The inclusion complexes （ICs） formed between the PCL polymers and α-CD were characterized by ^1H-NMR, DSC, TGA, WAXD, and FT-1R, respectively. Both branch ann number and molecular weight of the PCL polymers have apparent effect on the stoichiometry （CL：CD, mol：mol） of these ICs. All these analytical results indicate that the branch arms of the PCL polymers are incorporated into the hydrophobic α-CD cavities and their original crystalline properties are completely suppressed. Moreover, the inclusion complexation between two-ann linear or four-ann star-shaped PCL polymers and α-CD not only enhances the thermal stability of the vip PCL polymers but also improves that of α-CD.展开更多
The general-linear-complex singularity of Stewart mechanism is a veryimportant problem in the parallel manipulator. Its general regularity is not found yet during thepast two decades. St-Onge and Gosselin pointed Out ...The general-linear-complex singularity of Stewart mechanism is a veryimportant problem in the parallel manipulator. Its general regularity is not found yet during thepast two decades. St-Onge and Gosselin pointed Out that the singularity locus of the Stewartmechanism at some given orientations of the moving platform should be polynomial expressions withvaried degrees in 2000, but they didn't formulate the expression. Based on the kinematicssingularity principle and the geometry condition proposed by Huang Zhen in 1999, firstly thesingularity equation in degree two is derived. It is a hyperbola when the orientation of the movingplatform is given. This result is also proved using screw theory. Then some singularity surfaces aregotten in three-dimensional space. This result is of important significance.展开更多
Cyclotomic sequences have good cryptographic properties and are closely related to difference sets.This paper proposes a new class of binary generalized cyclotomic sequences of order two and length pqr.Its linear comp...Cyclotomic sequences have good cryptographic properties and are closely related to difference sets.This paper proposes a new class of binary generalized cyclotomic sequences of order two and length pqr.Its linear complexity,minimal polynomial,and autocorrelation are investigated.The results show that these sequences have a large linear complexity when 2∈D1,which means they can resist the Berlekamp-Massey attack.Furthermore,the autocorrelation values are close to 0 with a probability of approximately 1?1/r.Therefore,when r is a big prime,the new sequence has a good autocorrelation.展开更多
Based on the Games-Chan algorithm and StampMartin algorithm, this paper provides some new algorithms to compute the error linear complexity spectrum of binary 2n-periodic se- quences. These new algorithms are clearer ...Based on the Games-Chan algorithm and StampMartin algorithm, this paper provides some new algorithms to compute the error linear complexity spectrum of binary 2n-periodic se- quences. These new algorithms are clearer and simpler than old algorithms, and they can quickly compute the error linear com- plexity spectrum of sequences according to different situations. We also discuss such algorithms and give some new results about linear complexity and error linear complexity of sequences.展开更多
This paper contributes to the stability of linear complexity of a binary periodic Jacobi sequence.By employing a pair of reference sequences,we prove that the linear complexity of a binary Jacobi sequence is unstable,...This paper contributes to the stability of linear complexity of a binary periodic Jacobi sequence.By employing a pair of reference sequences,we prove that the linear complexity of a binary Jacobi sequence is unstable,namely,by changing its few bits in one-period length,the linear complexity of the modified sequences will become far less than the required value.展开更多
The linear complexity and minimal polynomial of new generalized cyclotomic sequences of order two are investigated.A new generalized cyclotomic sequence Sof length 2pqis defined with an imbalance p+1.The results show ...The linear complexity and minimal polynomial of new generalized cyclotomic sequences of order two are investigated.A new generalized cyclotomic sequence Sof length 2pqis defined with an imbalance p+1.The results show that this sequence has high linear complexity.展开更多
Combining with the research on the linear complexity of explicit nonlinear generators of pseudorandom sequences, we study the stability on linear complexity of two classes of explicit inversive generators and two clas...Combining with the research on the linear complexity of explicit nonlinear generators of pseudorandom sequences, we study the stability on linear complexity of two classes of explicit inversive generators and two classes of explicit nonlinear generators. We present some lower bounds in theory on the k-error linear complexity of these explicit generatol＇s, which further improve the cryptographic properties of the corresponding number generators and provide very useful information when they are applied to cryptography.展开更多
Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given ...Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribution function of sequences with period over using Discrete Fourier Transform (DFT), where and the characteristics of are odd primes, gcd and is a primitive root modulo The results presented can be used to study the randomness of periodic sequences and the analysis and design of stream cipher.展开更多
The title complex [NH4]n [WAgS4]n crystallizes in the tetragonalspace group I4 with crystallographic parameters: a = b = 7. 994 (2 ), c = 5. 855 (2 ):A,V = 373. g(2) A3, Z=2, Dc= 3. 89 g/cm3, F(000) = 392, μ= 19. 27 ...The title complex [NH4]n [WAgS4]n crystallizes in the tetragonalspace group I4 with crystallographic parameters: a = b = 7. 994 (2 ), c = 5. 855 (2 ):A,V = 373. g(2) A3, Z=2, Dc= 3. 89 g/cm3, F(000) = 392, μ= 19. 27 mm-l , A(MoKα) = 0. 71069, Mr = 438. 01, and the convergence factors R = 0. 045, Rw =0. 055 for 341 observed reflections (I>3σ(I)). The anion structure can be viewed as apolymeric single chain consisting of unlimited extended rhombic fragruents of -AgS2W-which are alternately perpendicular to each other. Additionally, influence of di- and tri-valent complex cations on the assembIy of WS2-4 and Ag+ is briefly discussed.展开更多
Firstly,the Fourier transforms in finite fields and the concept of linear complexityof sequences are described.Then several known lower bounds on the minimum distance of cycliccodes are outlined.Finally,the minimum di...Firstly,the Fourier transforms in finite fields and the concept of linear complexityof sequences are described.Then several known lower bounds on the minimum distance of cycliccodes are outlined.Finally,the minimum distance of cyclic codes is analyzed via linear complexityof sequences,and new theorems about the lower bounds are obtained.展开更多
Synchronization of high-order discrete-time complex networks with undirected topologies is studied and the impacts of time delays are investigated. Firstly,by the state decomposition,synchronization problems are trans...Synchronization of high-order discrete-time complex networks with undirected topologies is studied and the impacts of time delays are investigated. Firstly,by the state decomposition,synchronization problems are transformed into asymptotic stability ones of multiple lower dimensional time-delayed subsystems. Then,linear matrix inequality( LMI) criteria for synchronization are given,which can guarantee the scalability of complex networks since they only include three LMI constraints independent of the number of agents. Moreover,an explicit expression of the synchronization function is presented,which can describe the synchronization behavior of all agents in complex networks. Finally,a numerical example is given to demonstrate the theoretical results,where it is shown that if the gain matrices of synchronization protocols satisfy LMI criteria for synchronization,synchronization can be achieved.展开更多
文摘New objects characterizing the structure of complex linear transformations areintroduced. These new objects yield a new result for the decomposition of complexvector spaces relative to complex lrnear transformations and provide all Jordan basesby which the Jordan canonical form is constructed. Accordingly, they can result in thecelebrated Jordan theorem and the third decomposition theorem of space directly. and,moreover, they can give a new deep insight into the exquisite and subtle structure ofthe Jordan form. The latter indicates that the Jordan canonical form of a complexlinear transformation is an invariant structure associated with double arbitrary. choices.
基金supported by the National Natural Science Foundation of China (11171119 and 10871076)
文摘In this article, we study the complex oscillation problems of entire solutions to homogeneous and nonhomogeneous linear difference equations, and obtain some relations of the exponent of convergence of zeros and the order of growth of entire solutions to complex linear difference equations.
基金supported by the National Natural Science Foundation of China(Grant No.12371378)by the Natural Science Foundation of Fujian Province(Grant Nos.2024J01980,2024J08242).
文摘Recently,inspired by a modified generalized shift-splitting iteration method for complex symmetric linear systems,we propose two variants of the modified generalized shift-splitting iteration(MGSS)methods for solving com-plex symmetric linear systems.One is a parameterized MGSS iteration method and the other is a modified parameterized MGSS iteration method.We prove that the proposed methods are convergent under appropriate constraints on the parameters.In addition,we also give the eigenvalue distributions of differ-ent preconditioned matrices to verify the effectiveness of the preconditioners proposed in this paper.
文摘In this paper, a complex parameter is employed in the Hermitian and skew-Hermitian splitting （HSS） method （Bai, Golub and Ng： SIAM J. Matrix Anal. Appl., 24（2003）, 603-626） for solving the complex linear system Ax = f. The convergence of the resulting method is proved when the spectrum of the matrix A lie in the right upper （or lower） part of the complex plane. We also derive an upper bound of the spectral radius of the HSS iteration matrix, and a estimated optimal parameter a （denoted by a^st） of this upper bound is presented. Numerical experiments on two modified model problems show that the HSS method with a est has a smaller spectral radius than that with the real parameter which minimizes the corresponding upper hound. In particular, for the ＇dominant＇ imaginary part of the matrix A, this improvement is considerable. We also test the GMRES method preconditioned by the HSS preconditioning matrix with our parameter a est.
基金the National Natural Science Foundation of China (No.60373092).
文摘Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of keystreams. For the 2n -periodicperiodic binary sequence with linear complexity 2n 1and k = 2,3,the number of sequences with given k-error linear complexity and the expected k-error linear complexity are provided. Moreover,the proportion of the sequences whose k-error linear complexity is bigger than the expected value is analyzed.
基金the National Natural Science Foundation of China，the Open Funds of State Key Laboratory of Information Security (Chinese Academy of Sciences)，the Program for New Century Excellent Talents in Fujian Province University
文摘We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotients modulo an odd prime p.If 2 is a primitive element modulo p2,the linear complexity equals to p2-p or p2-1,which is very close to the period and it is large enough for cryptographic purpose.
基金Project supported by the National Natural Science Foundation of China(Grant No.60473028)the Natural Science Foundation of Fujian Province(Grant No.A0540011)the Science and Technology Fund of Educational Committee of Fujian Province(Grant No.JA04264)
文摘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.
基金The work is supported by the Special Fund of National Excellently Doctoral Paper and HAIPURT.
文摘The linear complexity of a new kind of keystream sequences.FCSR sequences,is discussed by use of the properties of cyclotomic polynomials.Based on the results of C.Seo's,an upper bound and a lower bound on the linear complexity of a significant kind of FCSR sequences—l-sequences are presented.
基金Supported by the National Natural Science Foun-dation of China (60373092)
文摘The k-error linear complexity and the linear complexity of the keystream of a stream cipher are two important standards to scale the randomness of the key stream. For a pq^n-periodic binary sequences where p, q are two odd primes satisfying that 2 is a primitive root module p and q^2 and gcd（p-1, q-1） = 2, we analyze the relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.
基金This work was supported by the National Natural Science Foundation of China (No. 20404007).
文摘Both four-ann star-shaped poly（ε-caprolactone） （4sPCL） and two-ann linear PCL （2LPCL） were synthesized and their inclusion complexation with α-cyclodextrin （α-CD） were studied. The inclusion complexes （ICs） formed between the PCL polymers and α-CD were characterized by ^1H-NMR, DSC, TGA, WAXD, and FT-1R, respectively. Both branch ann number and molecular weight of the PCL polymers have apparent effect on the stoichiometry （CL：CD, mol：mol） of these ICs. All these analytical results indicate that the branch arms of the PCL polymers are incorporated into the hydrophobic α-CD cavities and their original crystalline properties are completely suppressed. Moreover, the inclusion complexation between two-ann linear or four-ann star-shaped PCL polymers and α-CD not only enhances the thermal stability of the vip PCL polymers but also improves that of α-CD.
基金This project is supported by National Natural Science Foundation of China (No.59985006).
文摘The general-linear-complex singularity of Stewart mechanism is a veryimportant problem in the parallel manipulator. Its general regularity is not found yet during thepast two decades. St-Onge and Gosselin pointed Out that the singularity locus of the Stewartmechanism at some given orientations of the moving platform should be polynomial expressions withvaried degrees in 2000, but they didn't formulate the expression. Based on the kinematicssingularity principle and the geometry condition proposed by Huang Zhen in 1999, firstly thesingularity equation in degree two is derived. It is a hyperbola when the orientation of the movingplatform is given. This result is also proved using screw theory. Then some singularity surfaces aregotten in three-dimensional space. This result is of important significance.
基金supported by the National Key Research and Development Program of China(2016YFB0800601)the Natural Science Foundation of China(61303217+3 种基金61502372)the Fundamental Research Funds for the Central Universities(JB140115)the Natural Science Foundation of Shaanxi Province(2013JQ80022014JQ8313)
文摘Cyclotomic sequences have good cryptographic properties and are closely related to difference sets.This paper proposes a new class of binary generalized cyclotomic sequences of order two and length pqr.Its linear complexity,minimal polynomial,and autocorrelation are investigated.The results show that these sequences have a large linear complexity when 2∈D1,which means they can resist the Berlekamp-Massey attack.Furthermore,the autocorrelation values are close to 0 with a probability of approximately 1?1/r.Therefore,when r is a big prime,the new sequence has a good autocorrelation.
基金Supported by the National Natural Science Foundation of China (61174085, 61170270, 61121061)
文摘Based on the Games-Chan algorithm and StampMartin algorithm, this paper provides some new algorithms to compute the error linear complexity spectrum of binary 2n-periodic se- quences. These new algorithms are clearer and simpler than old algorithms, and they can quickly compute the error linear com- plexity spectrum of sequences according to different situations. We also discuss such algorithms and give some new results about linear complexity and error linear complexity of sequences.
基金Supported by the National Natural Science Foundation of China (61170319,61063041)the Natural Science Fund of Shandong Province (ZR2010FM017)+1 种基金the China Postdoctoral Science Foundation Funded Project(119103S148)the Fundamental Research Funds for the Central Universities(11CX04056A,10CX04038A)
文摘This paper contributes to the stability of linear complexity of a binary periodic Jacobi sequence.By employing a pair of reference sequences,we prove that the linear complexity of a binary Jacobi sequence is unstable,namely,by changing its few bits in one-period length,the linear complexity of the modified sequences will become far less than the required value.
基金Supported by the Natural Science Foundation of Hubei Province(2009CDZ004)the Scientific Research Fund of Hubei Provincial Education Department(B20104403)
文摘The linear complexity and minimal polynomial of new generalized cyclotomic sequences of order two are investigated.A new generalized cyclotomic sequence Sof length 2pqis defined with an imbalance p+1.The results show that this sequence has high linear complexity.
基金the Natural Science Foundation of Fujian Province (2007F3086)the Funds of the Education Department of Fujian Prov-ince (JA07164)the Open Funds of Key Laboratory of Fujian Province University Network Security and Cryptology (07B005)
文摘Combining with the research on the linear complexity of explicit nonlinear generators of pseudorandom sequences, we study the stability on linear complexity of two classes of explicit inversive generators and two classes of explicit nonlinear generators. We present some lower bounds in theory on the k-error linear complexity of these explicit generatol＇s, which further improve the cryptographic properties of the corresponding number generators and provide very useful information when they are applied to cryptography.
基金Supported by the National Natural Science Foundation of China (No. 60973125)
文摘Linear complexity is an important standard to scale the randomicity of stream ciphers. The distribution function of a sequence complexity measure gives the function expression for the number of sequences with a given complexity measure value. In this paper, we mainly determine the distribution function of sequences with period over using Discrete Fourier Transform (DFT), where and the characteristics of are odd primes, gcd and is a primitive root modulo The results presented can be used to study the randomness of periodic sequences and the analysis and design of stream cipher.
文摘The title complex [NH4]n [WAgS4]n crystallizes in the tetragonalspace group I4 with crystallographic parameters: a = b = 7. 994 (2 ), c = 5. 855 (2 ):A,V = 373. g(2) A3, Z=2, Dc= 3. 89 g/cm3, F(000) = 392, μ= 19. 27 mm-l , A(MoKα) = 0. 71069, Mr = 438. 01, and the convergence factors R = 0. 045, Rw =0. 055 for 341 observed reflections (I>3σ(I)). The anion structure can be viewed as apolymeric single chain consisting of unlimited extended rhombic fragruents of -AgS2W-which are alternately perpendicular to each other. Additionally, influence of di- and tri-valent complex cations on the assembIy of WS2-4 and Ag+ is briefly discussed.
文摘Firstly,the Fourier transforms in finite fields and the concept of linear complexityof sequences are described.Then several known lower bounds on the minimum distance of cycliccodes are outlined.Finally,the minimum distance of cyclic codes is analyzed via linear complexityof sequences,and new theorems about the lower bounds are obtained.
基金Sponsored by the National Natural Science Foundation of China(Grant No.61374054,61174067,61263002)the Shaanxi Province Natural Science Foundation Research Projection(Grant No.2013JQ8038)
文摘Synchronization of high-order discrete-time complex networks with undirected topologies is studied and the impacts of time delays are investigated. Firstly,by the state decomposition,synchronization problems are transformed into asymptotic stability ones of multiple lower dimensional time-delayed subsystems. Then,linear matrix inequality( LMI) criteria for synchronization are given,which can guarantee the scalability of complex networks since they only include three LMI constraints independent of the number of agents. Moreover,an explicit expression of the synchronization function is presented,which can describe the synchronization behavior of all agents in complex networks. Finally,a numerical example is given to demonstrate the theoretical results,where it is shown that if the gain matrices of synchronization protocols satisfy LMI criteria for synchronization,synchronization can be achieved.
