SELF-DUAL PERMUTATION CODES OVER FORMAL POWER SERIES RINGS AND FINITE PRINCIPAL IDEAL RINGS

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.

CYCLIC CODES OVER FORMAL POWER SERIES 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 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.

Self-Dual Permutation Codes over Finite Chain Rings

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.

Using Normal Form of Idempotent Matrices over Finite Local Ring Z/p^kZ to Construct Cartesian Authentication Codes

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.

SKEW CYCLIC CODES OVER RING F_p+vF_p

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.

ON THE CHARACTERIZATION OF CYCLIC CODES OVER TWO CLASSES OF RINGS

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.

Criteria for level 1 and level 2 trauma codes: Are pelvic ring injuries undertriaged?

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.

A proof of maximum contention-free property of interleavers for Turbo codes using permutation polynomials over integer rings

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.

The Depth Distribution of Constacyclic Codes Over the Ring F_(p)+vF_(p)+v^(2)F_(p)

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.

A Ring Signature Based on LDGM Codes

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

lncRNA MIR17HG调节miR-214-3p/RNF38信号轴对肝癌细胞恶性生物学行为的影响

目的探究长链非编码RNA(lncRNA)人类微小RNA17簇宿主基因(MIR17HG)调节微小RNA(miR)-214-3p/环指蛋白38(RNF38)信号轴对肝癌细胞恶性生物学行为的影响。方法收集2022年5月至2023年10月于本院行手术切除的46例肝癌患者的癌组织及癌旁组织,检测lncRNA MIR17HG、miR-214-3p和RNF38的表达。体外培养HepG2、Bel-7402、SMMC-7721、HL-7702细胞,并比较lncRNA MIR17HG、miR-214-3p和RNF38的表达,选择Bel-7402细胞继续研究,随机分为sh-NC组、sh-MIR17HG组、anti-NC组、anti-miR-214-3p组和Bel-7402组。探究各组Bel-7402细胞增殖、凋亡、侵袭和迁移情况,蛋白质印迹法分析RNF38、半胱天冬酶-3(caspase-3)、B细胞淋巴瘤-2(Bcl-2)、基质金属蛋白酶-2(MMP2)、基质金属蛋白酶-9(MMP9)蛋白表达,双荧光素酶验证lncRNA MIR17HG与miR-214-3p以及miR-214-3p与RNF38的关系。结果肝癌组织中lncRNA MIR17HG、RNF38的mRNA表达较高,miR-214-3p的mRNA表达较低,RNF38的蛋白阳性表达率较高(P<0.05)。细胞SMMC-7721、HepG2、Bel-7402中lncRNA MIR17HG mRNA、RNF38 mRNA和RNF38蛋白表达高于HL-7702细胞,miR-214-3p mRNA表达低于HL-7702细胞(P<0.05)。与Bel-7402组、sh-NC组比较,sh-MIR17HG组OD 450nm值、克隆细胞数、侵袭细胞数、迁移细胞数和RNF38、MMP2、Bcl-2、MMP9表达减少,凋亡率和caspase-3表达增加(P<0.05);与sh-MIR17HG组、anti-NC组比较,anti-miR-214-3p组OD 450nm值、克隆细胞数、侵袭细胞数、迁移细胞数和RNF38、MMP2、Bcl-2、MMP9表达增加,凋亡率和caspase-3表达减少(P<0.05)。lncRNA MIR17HG与miR-214-3p以及miR-214-3p与RNF38分别存在靶向关系。miR-214-3p+WT-MIR17HG组荧光素酶活性低于miR-NC+WT-MIR17HG组(P<0.05),miR-214-3p+WT-RNF38组荧光素酶活性低于miR-NC+WT-RNF38组(P<0.05)。结论lncRNA MIR17HG可能通过调控miR-214-3p/RNF38轴促进肝癌细胞的恶性生物学行为。

QPSK调制解调技术的仿真与研究

给出全数字QPSK接收机和发射机的总体方案框图以及同步系统的详细设计方案,对FFT辅助的松尾环载波同步系统模块、Gardner位同步系统主要模块、巴克码帧同步系统主要模块进行理论分析和推导,为整机系统实现奠定理论基础.对系统接收机和发射机的各个模块进行MATLAB仿真,提取出同频同相的本地载波信号,成功获得最佳采样点及寻找到帧头,正确还原出调制信号,验证了本文设计系统的合理性.

摄影测量中环状编码标靶识别与定位方法

为满足环状编码标靶精准定位与识别的要求,提出了一套定位精度和识别稳定性较高的算法。针对环状编码标靶的精确定位,提出了一种基于同心圆投影变换求解圆心的方法;在对编码标靶进行识别时,通过仿射变换将椭圆变为标准圆,进而对内部编码带进行解码得到其唯一解码值。试验结果表明:该圆心提取方法与理想圆心平均误差为0.225像素,与椭圆拟合提取外圆圆心平均误差为0.501像素,与内圆圆心平均误差为0.294像素,其精度分别提高了122.05%与30.26%;相机与编码标靶夹角需控制在75°以内,夹角小于75°时,编码标靶识别率可达100%。研究表明该编码标靶识别与定位方法能够满足摄影测量需求,且比椭圆拟合算法精度更高,具有一定的实际意义。

环Z_p^l导出Kerdock-code序列的部分周期性质

对环Zpl导出的多元Kerdock-code序列的部分周期性质进行了研究,这里p为任意奇素数,l为任意正整数.利用特征为pl的Galois环上不完全指数和的非平凡上界,对上述p元Kerdock-code序列的非周期自相关性及互相关性进行了估计,同时对序列的部分周期分布和部分周期独立r-样式分布也进行了刻画.结果表明,此类序列具有极低的非周期自相关性及互相关性,同时其部分周期分布和部分周期独立r-样式分布也是渐进均匀的,在密码学和通信领域具有潜在的应用价值.

CYCLIC AND NEGACYCLIC CODES OF LENGTH 2p^s OVER F_(p^m) + uF_(p^m)

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.

Quaternion Integers Based Higher Length Cyclic Codes and Their Decoding Algorithm

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.

Two Classes of Quaternary Codes from Z_4-valued Quadratic Forms

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.

Construction of Self-dual Codes over F_p+vF_p

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.

MATRIX PRODUCT CODES WITH ROSENBLOOM-TSFASMAN METRIC

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.