In this paper,we first generalize the constant dimension and orbit codes over finite fields to the constant rank and orbit codes over finite chain rings.Then we provide a relationship between constant rank codes over ...In this paper,we first generalize the constant dimension and orbit codes over finite fields to the constant rank and orbit codes over finite chain rings.Then we provide a relationship between constant rank codes over finite chain rings and constant dimension codes over the residue fields.In particular,we prove that an orbit submodule code over a finite chain ring is a constant rank code.Finally,for special finite chain ring F_(q)+γF_(q),we define a Gray mapφfrom(F_(q)+γF_(q))^(n)to F^(2n)_(q),and by using cyclic codes over F_(q)+γF_(q),we obtain a method of constructing an optimum distance constant dimension code over F_(q).展开更多
Permutation codes over finite chain rings are introduced; by using the character of the finite chain rings and the knowledge of representation of group, some conditions for existence or non-existence of self-dual perm...Permutation codes over finite chain rings are introduced; by using the character of the finite chain rings and the knowledge of representation of group, some conditions for existence or non-existence of self-dual permutation codes over finite chain rings are obtained. Specially, when the group is a direct product of a 2-group and a T-group, and the group action is transitive, the sufficient and necessary condition of the existence of permutation codes is given.展开更多
In this paper,we investigate the stability for a finite harmonic lattice under a certain class of boundary conditions.A rigorous eigenvalue study clarifies that the invalidity of Fourier modes as the basis results in ...In this paper,we investigate the stability for a finite harmonic lattice under a certain class of boundary conditions.A rigorous eigenvalue study clarifies that the invalidity of Fourier modes as the basis results in the deficiency of standard reflection coefficient approach for stability analysis.In a certain parameter range,unstable surface modes exist in the form of exponential decay in space,and exponential growth in time.An approximate eigen-polynomial is proposed to ease the stability analysis.Moreover,the eigenvalues with small positive real part quantitatively explain the long time instability in wave propagation computations.Numerical results verify the analysis.展开更多
In this article, we focus on cyclic and negacyclic codes of length 2p^s over the ring R = Fp^m ＋ uFp^m, where p is an odd prime. On the basis of the works of Dinh （in J.Algebra 324,940-950,2010）, we use the Chinese...In this article, we focus on cyclic and negacyclic codes of length 2p^s over the ring R = Fp^m ＋ uFp^m, where p is an odd prime. On the basis of the works of Dinh （in J.Algebra 324,940-950,2010）, we use the Chinese Remainder Theorem to establish the algebraic structure of cyclic and negacyclic codes of length 2p^s over the ring Fp^m ＋ uFp^m in terms of polynomial generators. Furthermore, we obtain the number of codewords in each of those cyclic and negacyclic codes.展开更多
In this article, cyclic codes and negacyclic codes over formal power series rings are studied. The structure of cyclic codes over this class of rings is given, and the relationship between these codes and cyclic codes...In this article, cyclic codes and negacyclic codes over formal power series rings are studied. The structure of cyclic codes over this class of rings is given, and the relationship between these codes and cyclic codes over finite chain rings is obtained. Using an isomorphism between cyclic and negacyclic codes over formal power series rings, the structure of negacyclic codes over the formal power series rings is obtained.展开更多
Let R be a finite chain ring with maximal ideal （7） and residue field F,and letγ be of nilpotency index t. To every code C of length n over R, a tower of codes C = （C ： γ0） C_ （C： 7） C ... C_ （C： γ2） C_ ...Let R be a finite chain ring with maximal ideal （7） and residue field F,and letγ be of nilpotency index t. To every code C of length n over R, a tower of codes C = （C ： γ0） C_ （C： 7） C ... C_ （C： γ2） C_ .-. C_ （C：γ^t-1） can be associated with C, where for any r C R, （C ： r） = {e C Rn I re E C}. Using generator elements of the projection of such a tower of codes to the residue field F, we characterize cyclic codes over R. This characterization turns the condition for codes over R to be cyclic into one for codes over the residue field F. Furthermore, we obtain a characterization of cyclic codes over the formal power series ring of a finite chain ring.展开更多
The properties of the generator matrix are given for linear codes over finite commutative chain rings, and the so-called almost-MDS （AMDS） codes are studied.
We complete the determination of the maximum sizes of （k,n）-arcs, n ≤ 12, in the projective gjelmslev planes over the two （proper） chain rings Z9 = Z/9Z and S3 = F3[X]/（X2） of order 9 by resolving the hitherto ...We complete the determination of the maximum sizes of （k,n）-arcs, n ≤ 12, in the projective gjelmslev planes over the two （proper） chain rings Z9 = Z/9Z and S3 = F3[X]/（X2） of order 9 by resolving the hitherto open cases n = 6 and n = 7. Parts of our proofs rely on decidedly geometric properties of the planes such as Desargues＇ theorem and the existence of certain subplanes.展开更多
Distributed Lagrange Multiplier/Fictitious Domain （DLM/FD） method was employed to simulate the channel flow with polymer suspension. The polymer molecules were modeled as Finitely Extensible Nonlinear Elastic （FENE...Distributed Lagrange Multiplier/Fictitious Domain （DLM/FD） method was employed to simulate the channel flow with polymer suspension. The polymer molecules were modeled as Finitely Extensible Nonlinear Elastic （FENE） chains and FENE chain cluster. The coiled stretched transition of FENE chains was examined and the change in configuration of FENE chains was presented. The average velocity profile of the fully developed channel flow with 64 FENE chains was given and fitted well with the power-law curve. The change of chain cluster configuration was also simulated. These simulations show that DLM/FD method is capable of simulating the motion of not only FENE chain, but also FENE chain cluster.展开更多
A new genetic algorithm is proposed based on the careful coordination of the exploration in the solution space of the given problem and the exploitation of the information from the previous search. In the new algorit...A new genetic algorithm is proposed based on the careful coordination of the exploration in the solution space of the given problem and the exploitation of the information from the previous search. In the new algorithm architecture, the population in each generation consists of three sub-populations: a preserved part, a reproduced part, and a randomized part. Two parameters are incorporated into the algorithm to efficiently control the percentage of each sub-population to achieve good balance between the exploration and exploitation processes during the optimization. By modeling the algorithm as a homogeneous finite Markov chain, the new genetic algorithm is shown to converge towards the global optimum of the problem at hand. Experiments were designed to test the algorithm using the Rastrigin function, the Griewangk function, and the Schaffer function. Data analyses using the average success ratio, the average objective calculating number, the average first passage time to solution, and the standard deviation of the first passage time were compared with those of the canonical genetic algorithm, the elitist genetic algorithm, and the steady genetic algorithm. The results show strong evidence that our algorithm is superior in performance in terms of economy, robustness and efficiency.展开更多
基金Supported by Research Funds of Hubei Province(D20144401,Q20174503)。
文摘In this paper,we first generalize the constant dimension and orbit codes over finite fields to the constant rank and orbit codes over finite chain rings.Then we provide a relationship between constant rank codes over finite chain rings and constant dimension codes over the residue fields.In particular,we prove that an orbit submodule code over a finite chain ring is a constant rank code.Finally,for special finite chain ring F_(q)+γF_(q),we define a Gray mapφfrom(F_(q)+γF_(q))^(n)to F^(2n)_(q),and by using cyclic codes over F_(q)+γF_(q),we obtain a method of constructing an optimum distance constant dimension code over F_(q).
基金Supported by the National Natural Science Foundation of China (60373087, 60473023, 90104005, 60673071)
文摘Permutation codes over finite chain rings are introduced; by using the character of the finite chain rings and the knowledge of representation of group, some conditions for existence or non-existence of self-dual permutation codes over finite chain rings are obtained. Specially, when the group is a direct product of a 2-group and a T-group, and the group action is transitive, the sufficient and necessary condition of the existence of permutation codes is given.
基金supported in part by NSFC under contract number 10872004National Basic Research Program of China under contract number 2007CB814800the China Ministry of Education under contract numbers NCET-06-0011 and 200800010013.
文摘In this paper,we investigate the stability for a finite harmonic lattice under a certain class of boundary conditions.A rigorous eigenvalue study clarifies that the invalidity of Fourier modes as the basis results in the deficiency of standard reflection coefficient approach for stability analysis.In a certain parameter range,unstable surface modes exist in the form of exponential decay in space,and exponential growth in time.An approximate eigen-polynomial is proposed to ease the stability analysis.Moreover,the eigenvalues with small positive real part quantitatively explain the long time instability in wave propagation computations.Numerical results verify the analysis.
基金supported by the Natural ScienceFoundation of Hubei Province(D2014401)the Natural Science Foundation of Hubei Polytechnic University(12xjz14A)
文摘In this article, we focus on cyclic and negacyclic codes of length 2p^s over the ring R = Fp^m ＋ uFp^m, where p is an odd prime. On the basis of the works of Dinh （in J.Algebra 324,940-950,2010）, we use the Chinese Remainder Theorem to establish the algebraic structure of cyclic and negacyclic codes of length 2p^s over the ring Fp^m ＋ uFp^m in terms of polynomial generators. Furthermore, we obtain the number of codewords in each of those cyclic and negacyclic codes.
基金supported by SRF for ROCS,SEM,the Key Project of Chinese Ministry of Education (108099)CCNU Project (CCNU09Y01003)
文摘In this article, cyclic codes and negacyclic codes over formal power series rings are studied. The structure of cyclic codes over this class of rings is given, and the relationship between these codes and cyclic codes over finite chain rings is obtained. Using an isomorphism between cyclic and negacyclic codes over formal power series rings, the structure of negacyclic codes over the formal power series rings is obtained.
基金supported by the Natural Science Foundation of Hubei Province (B20114410)the Natural Science Foundation of Hubei Polytechnic University (12xjz14A)
文摘Let R be a finite chain ring with maximal ideal （7） and residue field F,and letγ be of nilpotency index t. To every code C of length n over R, a tower of codes C = （C ： γ0） C_ （C： 7） C ... C_ （C： γ2） C_ .-. C_ （C：γ^t-1） can be associated with C, where for any r C R, （C ： r） = {e C Rn I re E C}. Using generator elements of the projection of such a tower of codes to the residue field F, we characterize cyclic codes over R. This characterization turns the condition for codes over R to be cyclic into one for codes over the residue field F. Furthermore, we obtain a characterization of cyclic codes over the formal power series ring of a finite chain ring.
基金Supported by the National Natural Science Foundation of China (No. 60402022)
文摘The properties of the generator matrix are given for linear codes over finite commutative chain rings, and the so-called almost-MDS （AMDS） codes are studied.
基金supported by National Natural Science Foundation of China (Grant No.60872063)the Chinese Specialized Research Fund for the Doctoral Program of Higher Education (Grant No.200803351027)Deutsche Forschungsgemeinschaft (Grant No.WA 1666/4-1)
文摘We complete the determination of the maximum sizes of （k,n）-arcs, n ≤ 12, in the projective gjelmslev planes over the two （proper） chain rings Z9 = Z/9Z and S3 = F3[X]/（X2） of order 9 by resolving the hitherto open cases n = 6 and n = 7. Parts of our proofs rely on decidedly geometric properties of the planes such as Desargues＇ theorem and the existence of certain subplanes.
文摘Distributed Lagrange Multiplier/Fictitious Domain （DLM/FD） method was employed to simulate the channel flow with polymer suspension. The polymer molecules were modeled as Finitely Extensible Nonlinear Elastic （FENE） chains and FENE chain cluster. The coiled stretched transition of FENE chains was examined and the change in configuration of FENE chains was presented. The average velocity profile of the fully developed channel flow with 64 FENE chains was given and fitted well with the power-law curve. The change of chain cluster configuration was also simulated. These simulations show that DLM/FD method is capable of simulating the motion of not only FENE chain, but also FENE chain cluster.
文摘A new genetic algorithm is proposed based on the careful coordination of the exploration in the solution space of the given problem and the exploitation of the information from the previous search. In the new algorithm architecture, the population in each generation consists of three sub-populations: a preserved part, a reproduced part, and a randomized part. Two parameters are incorporated into the algorithm to efficiently control the percentage of each sub-population to achieve good balance between the exploration and exploitation processes during the optimization. By modeling the algorithm as a homogeneous finite Markov chain, the new genetic algorithm is shown to converge towards the global optimum of the problem at hand. Experiments were designed to test the algorithm using the Rastrigin function, the Griewangk function, and the Schaffer function. Data analyses using the average success ratio, the average objective calculating number, the average first passage time to solution, and the standard deviation of the first passage time were compared with those of the canonical genetic algorithm, the elitist genetic algorithm, and the steady genetic algorithm. The results show strong evidence that our algorithm is superior in performance in terms of economy, robustness and efficiency.
