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).展开更多
In this paper, we study self-dual permutation codes over formal power series rings and finite principal ideal rings. We first give some results on the torsion codes associated with the linear codes over formal power s...In this paper, we study self-dual permutation codes over formal power series rings and finite principal ideal rings. We first give some results on the torsion codes associated with the linear codes over formal power series rings. These results allow for obtaining some conditions for non-existence of self-dual permutation codes over formal power series rings. Finally, we describe self-dual permutation codes over finite principal ideal rings by examining permutation codes over their component chain rings.展开更多
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.展开更多
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.展开更多
Let R-Fpm+uFpm+vFpm+uvFpm,where u2=v2=0,uv=vu.Then R is a local ring,but it is not a chain ring.R contains precisely(pm-1)p3 m units,namely,α+uβ+vγ+uvδ,where α,β,γ,δ∈Fpm,α≠0.In this paper,we investigate all...Let R-Fpm+uFpm+vFpm+uvFpm,where u2=v2=0,uv=vu.Then R is a local ring,but it is not a chain ring.R contains precisely(pm-1)p3 m units,namely,α+uβ+vγ+uvδ,where α,β,γ,δ∈Fpm,α≠0.In this paper,we investigate all constacyclic codes of length ps over R.Firstly,we classify allα-constacyclic and(α+uvβ)-constacyclic codes of length ps over R,respectively,and obtain their structure in each of thoseα-constacyclic and(α+uvβ)-constacyclic codes.Secondly,we address the(α+uβ)-constacyclic codes of length ps over R,and get their classification and structure.Finally,using similar discussion of(α+uβ)-constacyclic codes,we obtain the classification and the structure of α+vβ,α+uβ+uvγ,α+vβ+uvγ,α+uβ+vγ,α+uβ+vβ+uvδ-constacyclic codes of length ps over R.展开更多
In this paper, we determine the normal forms of idempotent matrices for similarity over finite local rings Z/p^kZ, from which we construct a Cartesian authentication code and compute its size parameters and the probab...In this paper, we determine the normal forms of idempotent matrices for similarity over finite local rings Z/p^kZ, from which we construct a Cartesian authentication code and compute its size parameters and the probabilities of successful impersonation and substitution attack under the hypothesis that the cecoding rules are chosen according to a uniform probability distribution.展开更多
In this paper, we study skew cyclic codes over the ring Fp +vFp,where p is a odd prime and v 2=1. We give the generators of skew cyclic codes, with the consideration of the dual of skew cyclic codes.
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.展开更多
AIM: To determine the association of unstable pelvic ring injuries with trauma code status.METHODS: A retrospective review of all pelvic ring injuries at a single academic center from July 2010 to June 2013 was perfor...AIM: To determine the association of unstable pelvic ring injuries with trauma code status.METHODS: A retrospective review of all pelvic ring injuries at a single academic center from July 2010 to June 2013 was performed. The trauma registry was used to identify level 1 and level 2 trauma codes for each injury. The computed tomography scans in all patients were classified as stable or unstable using the Abbreviated Injury Scale. Pelvic injury classifications in level 1 and level 2 groups were compared. Patient disposition at discharge in level 1 and level 2 groups were also compared.RESULTS: There were 108 level 1 and 130 level 2 blunt trauma admissions. In the level 1 group, 67% of pelvic injuries were classified as stable fracture patterns and 33% were classified as unstable. In the level 2 group, 62% of pelvic injuries were classified as stable fracture patterns and 38% were classified as unstable. level 1 trauma code was not associated with odds of having an unstable fracture pattern(OR = 0.83, 95%CI: 0.48-1.41, P = 0.485). In the level 1 group with unstable pelvic injuries, 33% were discharged to home, 36% to a rehabilitation facility, and 32% died. In the level 2 group with unstable pelvic injuries, 65% were discharged to home, 31% to a rehabilitation facility, and 4% died. For those with unstable pelvic fractures(n = 85), assignment of a level 2 trauma code was associated with reduced odds of death(OR = 0.07, 95%CI: 0.01-0.35, P = 0.001) as compared to being discharged to home.CONCLUSION: Trauma code level assignment is not correlated with severity of pelvic injury. Because an unstable pelvis can lead to hemodynamic instability, these injuries may be undertriaged.展开更多
It is well known that interleavers play a critical role in Turbo coding/decoding schemes, and contention-free interleaver design has become a serious problem in the paraUelization of Turbo decoding, which is indispens...It is well known that interleavers play a critical role in Turbo coding/decoding schemes, and contention-free interleaver design has become a serious problem in the paraUelization of Turbo decoding, which is indispensable to meet the demands for high throughput and low latency in next generation mobile communication systems. This paper unveils the fact that interleavers based on permutation polynomials modulo N are contention-free for every window size W, a factor of the intedeaver length N, which, also called maximum contention-free interleavers.展开更多
In this paper,we studied the depth spectrum and the depth distribution of constacyclic codes over the non-chain ring R=F_(p)+vF_(p)+v^(2)F_(p),where v^(3)=v.By decomposing the linear codes C over R into the linear cod...In this paper,we studied the depth spectrum and the depth distribution of constacyclic codes over the non-chain ring R=F_(p)+vF_(p)+v^(2)F_(p),where v^(3)=v.By decomposing the linear codes C over R into the linear codes over the finite field F_(p),three corresponding constacyclic codes C_(1),C_(2),C_(3) over F_(p)were obtained.Furthermore,considering the depth spectrum of constacyclic codes over the finite filed F_(p),and the relationship between constacyclic codes C_(1),C_(2),C_(3) and C,the depth spectrum and the depth distribution of constacyclic codes over R were discussed.展开更多
McEliece cryptosystem is a public key cryptosystem that combines channel coding and encryption,and the oldest PKC that is conjectured to be postquantum secure.To decrease the key size of the original scheme,alternativ...McEliece cryptosystem is a public key cryptosystem that combines channel coding and encryption,and the oldest PKC that is conjectured to be postquantum secure.To decrease the key size of the original scheme,alternative codes have been adopted to replace Goppa codes.In this paper,we propose a ring signature using low-density generator-matrix codes.Our new scheme satisfies anonymity and existential unforgeability under chosen message attacks(EUFCMA).As for efficiency,the number of decoding operations has been reduced largely compared with ZLC ring signature,and the size of the public key is about 0.2%of the ZLC展开更多
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.展开更多
The decoding algorithm for the correction of errors of arbitrary Mannheim weight has discussed for Lattice constellations and codes from quadratic number fields.Following these lines,the decoding algorithms for the co...The decoding algorithm for the correction of errors of arbitrary Mannheim weight has discussed for Lattice constellations and codes from quadratic number fields.Following these lines,the decoding algorithms for the correction of errors of n=p−12 length cyclic codes(C)over quaternion integers of Quaternion Mannheim(QM)weight one up to two coordinates have considered.In continuation,the case of cyclic codes of lengths n=p−12 and 2n−1=p−2 has studied to improve the error correction efficiency.In this study,we present the decoding of cyclic codes of length n=ϕ(p)=p−1 and length 2n−1=2ϕ(p)−1=2p−3(where p is prime integer andϕis Euler phi function)over Hamilton Quaternion integers of Quaternion Mannheim weight for the correction of errors.Furthermore,the error correction capability and code rate tradeoff of these codes are also discussed.Thus,an increase in the length of the cyclic code is achieved along with its better code rate and an adequate error correction capability.展开更多
Let R=GR (4,m)be a Galois ring with Teichmuller set T_m and Tr_m be the trace function fromRto Z_4.In this paper,two classes of quaternary codes C_1 = {c(a,b):a ∈R,b ∈ T_(m/2)},where c(a,b)=(Tr_m(ax)+Tr_(m/2)(2 bx^(...Let R=GR (4,m)be a Galois ring with Teichmuller set T_m and Tr_m be the trace function fromRto Z_4.In this paper,two classes of quaternary codes C_1 = {c(a,b):a ∈R,b ∈ T_(m/2)},where c(a,b)=(Tr_m(ax)+Tr_(m/2)(2 bx^(2 m/2 +1)))_(x∈T_m),and C_2= {c(a,b):a ∈ R,b ∈ T_m}, where c(a,b)=(Tr_m(ax+2 bx^(2 k+1)))_(x∈T_m),and m/gcd(m,k)is even,are investigated,respectively.The Lee weight distributions,Hamming weight distributions and complete weight distributions of the codes are completely given.展开更多
In this paper, we give an explicit construction for self-dual codes over F_p+vF_p(v^2= v) and determine all the self-dual codes over F_p+ vF_p by using self-dual codes over finite field F_p, where p is a prime.
In this article, the Rosenbloom-Tsfasman metric of matrix product codes over finite commutative rings is studied and the lower bounds for the minimal Rosenbloom- Tsfasman distances of the matrix product codes axe obta...In this article, the Rosenbloom-Tsfasman metric of matrix product codes over finite commutative rings is studied and the lower bounds for the minimal Rosenbloom- Tsfasman distances of the matrix product codes axe obtained. The lower bounds of the dual codes of matrix product codes over finite commutative Frobenius rings are also given.展开更多
A new non-binary decoding method, which is called Yaletharatalhussein decoding algorithm, is designed and implemented for decoding non-binary convolutional codes which is based on the trellis diagram representing the ...A new non-binary decoding method, which is called Yaletharatalhussein decoding algorithm, is designed and implemented for decoding non-binary convolutional codes which is based on the trellis diagram representing the convolutional encoder. Yaletharatalhussein decoding algorithm outperforms the Viterbi algorithm and other algorithms in its simplicity, very small computational complexity, decoding reliability for high states TCM codes that suitable for Fourth-Generation (4G), decreasing errors with increasing word length, and easy to implement with real-time applications. The proposed Yaletharatalhussein decoding algorithm deals with non-binary error control coding of the convolutional and TCM codes. Convolutional codes differ from block codes in that a block code takes a fixed message length and encodes it, whereas a convolutional code can encode a continuous stream of data, and a hard-decision decoding can easily be realized using the Yaletharatalhussein algorithm. The idea of non-binary codes has been extended for symbols defined over rings of integers, which outperform binary codes with only a small increase in decoding complexity. The simulation results show that the performance of the nonbinary TCM-based Yaletharatalhussein algorithm outperforms the binary and non-binary decoding methods.展开更多
基金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).
文摘In this paper, we study self-dual permutation codes over formal power series rings and finite principal ideal rings. We first give some results on the torsion codes associated with the linear codes over formal power series rings. These results allow for obtaining some conditions for non-existence of self-dual permutation codes over formal power series rings. Finally, we describe self-dual permutation codes over finite principal ideal rings by examining permutation codes over their component chain rings.
基金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 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 by Research Funds of Hubei Province(D20144401,Q20174503)。
文摘Let R-Fpm+uFpm+vFpm+uvFpm,where u2=v2=0,uv=vu.Then R is a local ring,but it is not a chain ring.R contains precisely(pm-1)p3 m units,namely,α+uβ+vγ+uvδ,where α,β,γ,δ∈Fpm,α≠0.In this paper,we investigate all constacyclic codes of length ps over R.Firstly,we classify allα-constacyclic and(α+uvβ)-constacyclic codes of length ps over R,respectively,and obtain their structure in each of thoseα-constacyclic and(α+uvβ)-constacyclic codes.Secondly,we address the(α+uβ)-constacyclic codes of length ps over R,and get their classification and structure.Finally,using similar discussion of(α+uβ)-constacyclic codes,we obtain the classification and the structure of α+vβ,α+uβ+uvγ,α+vβ+uvγ,α+uβ+vγ,α+uβ+vβ+uvδ-constacyclic codes of length ps over R.
基金Foundation item:The Key Project(03060)of Chinese Ministry of Education.
文摘In this paper, we determine the normal forms of idempotent matrices for similarity over finite local rings Z/p^kZ, from which we construct a Cartesian authentication code and compute its size parameters and the probabilities of successful impersonation and substitution attack under the hypothesis that the cecoding rules are chosen according to a uniform probability distribution.
基金Supported by the National Natural Science Foundation of China(No.61370089)
文摘In this paper, we study skew cyclic codes over the ring Fp +vFp,where p is a odd prime and v 2=1. We give the generators of skew cyclic codes, with the consideration of the dual of skew cyclic codes.
基金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.
文摘AIM: To determine the association of unstable pelvic ring injuries with trauma code status.METHODS: A retrospective review of all pelvic ring injuries at a single academic center from July 2010 to June 2013 was performed. The trauma registry was used to identify level 1 and level 2 trauma codes for each injury. The computed tomography scans in all patients were classified as stable or unstable using the Abbreviated Injury Scale. Pelvic injury classifications in level 1 and level 2 groups were compared. Patient disposition at discharge in level 1 and level 2 groups were also compared.RESULTS: There were 108 level 1 and 130 level 2 blunt trauma admissions. In the level 1 group, 67% of pelvic injuries were classified as stable fracture patterns and 33% were classified as unstable. In the level 2 group, 62% of pelvic injuries were classified as stable fracture patterns and 38% were classified as unstable. level 1 trauma code was not associated with odds of having an unstable fracture pattern(OR = 0.83, 95%CI: 0.48-1.41, P = 0.485). In the level 1 group with unstable pelvic injuries, 33% were discharged to home, 36% to a rehabilitation facility, and 32% died. In the level 2 group with unstable pelvic injuries, 65% were discharged to home, 31% to a rehabilitation facility, and 4% died. For those with unstable pelvic fractures(n = 85), assignment of a level 2 trauma code was associated with reduced odds of death(OR = 0.07, 95%CI: 0.01-0.35, P = 0.001) as compared to being discharged to home.CONCLUSION: Trauma code level assignment is not correlated with severity of pelvic injury. Because an unstable pelvis can lead to hemodynamic instability, these injuries may be undertriaged.
基金Project (No. 60332030) supported by the National Natural ScienceFoundation of China
文摘It is well known that interleavers play a critical role in Turbo coding/decoding schemes, and contention-free interleaver design has become a serious problem in the paraUelization of Turbo decoding, which is indispensable to meet the demands for high throughput and low latency in next generation mobile communication systems. This paper unveils the fact that interleavers based on permutation polynomials modulo N are contention-free for every window size W, a factor of the intedeaver length N, which, also called maximum contention-free interleavers.
基金Supported by the Open Research Fund of Key Laboratory of Intelligent Computing and Signal Processing,Ministry of Education,Anhui University.
文摘In this paper,we studied the depth spectrum and the depth distribution of constacyclic codes over the non-chain ring R=F_(p)+vF_(p)+v^(2)F_(p),where v^(3)=v.By decomposing the linear codes C over R into the linear codes over the finite field F_(p),three corresponding constacyclic codes C_(1),C_(2),C_(3) over F_(p)were obtained.Furthermore,considering the depth spectrum of constacyclic codes over the finite filed F_(p),and the relationship between constacyclic codes C_(1),C_(2),C_(3) and C,the depth spectrum and the depth distribution of constacyclic codes over R were discussed.
文摘McEliece cryptosystem is a public key cryptosystem that combines channel coding and encryption,and the oldest PKC that is conjectured to be postquantum secure.To decrease the key size of the original scheme,alternative codes have been adopted to replace Goppa codes.In this paper,we propose a ring signature using low-density generator-matrix codes.Our new scheme satisfies anonymity and existential unforgeability under chosen message attacks(EUFCMA).As for efficiency,the number of decoding operations has been reduced largely compared with ZLC ring signature,and the size of the public key is about 0.2%of the ZLC
基金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.
基金The authors extend their gratitude to the Deanship of Scientific Research at King Khalid University for funding this work through research groups program under grant number R.G.P.1/85/42.
文摘The decoding algorithm for the correction of errors of arbitrary Mannheim weight has discussed for Lattice constellations and codes from quadratic number fields.Following these lines,the decoding algorithms for the correction of errors of n=p−12 length cyclic codes(C)over quaternion integers of Quaternion Mannheim(QM)weight one up to two coordinates have considered.In continuation,the case of cyclic codes of lengths n=p−12 and 2n−1=p−2 has studied to improve the error correction efficiency.In this study,we present the decoding of cyclic codes of length n=ϕ(p)=p−1 and length 2n−1=2ϕ(p)−1=2p−3(where p is prime integer andϕis Euler phi function)over Hamilton Quaternion integers of Quaternion Mannheim weight for the correction of errors.Furthermore,the error correction capability and code rate tradeoff of these codes are also discussed.Thus,an increase in the length of the cyclic code is achieved along with its better code rate and an adequate error correction capability.
文摘Let R=GR (4,m)be a Galois ring with Teichmuller set T_m and Tr_m be the trace function fromRto Z_4.In this paper,two classes of quaternary codes C_1 = {c(a,b):a ∈R,b ∈ T_(m/2)},where c(a,b)=(Tr_m(ax)+Tr_(m/2)(2 bx^(2 m/2 +1)))_(x∈T_m),and C_2= {c(a,b):a ∈ R,b ∈ T_m}, where c(a,b)=(Tr_m(ax+2 bx^(2 k+1)))_(x∈T_m),and m/gcd(m,k)is even,are investigated,respectively.The Lee weight distributions,Hamming weight distributions and complete weight distributions of the codes are completely given.
基金supported in part by the National Science Foundation of China under Grant 11571005in part by the Key Research Project of Higher Education of the Education Department of Henan Province under Grant 19A120010
文摘In this paper, we give an explicit construction for self-dual codes over F_p+vF_p(v^2= v) and determine all the self-dual codes over F_p+ vF_p by using self-dual codes over finite field F_p, where p is a prime.
文摘In this article, the Rosenbloom-Tsfasman metric of matrix product codes over finite commutative rings is studied and the lower bounds for the minimal Rosenbloom- Tsfasman distances of the matrix product codes axe obtained. The lower bounds of the dual codes of matrix product codes over finite commutative Frobenius rings are also given.
文摘A new non-binary decoding method, which is called Yaletharatalhussein decoding algorithm, is designed and implemented for decoding non-binary convolutional codes which is based on the trellis diagram representing the convolutional encoder. Yaletharatalhussein decoding algorithm outperforms the Viterbi algorithm and other algorithms in its simplicity, very small computational complexity, decoding reliability for high states TCM codes that suitable for Fourth-Generation (4G), decreasing errors with increasing word length, and easy to implement with real-time applications. The proposed Yaletharatalhussein decoding algorithm deals with non-binary error control coding of the convolutional and TCM codes. Convolutional codes differ from block codes in that a block code takes a fixed message length and encodes it, whereas a convolutional code can encode a continuous stream of data, and a hard-decision decoding can easily be realized using the Yaletharatalhussein algorithm. The idea of non-binary codes has been extended for symbols defined over rings of integers, which outperform binary codes with only a small increase in decoding complexity. The simulation results show that the performance of the nonbinary TCM-based Yaletharatalhussein algorithm outperforms the binary and non-binary decoding methods.
