THE AUTOMORPHISM GROUP OF A LINEAR CODE

We know that for a code C,it‘s very important to find out the Automorphism groupAutC of C.However,it is very difficult to seek entire AutC.In this paper,using the G.I of matrices over a finite field,we give several methods to judge whether a permutation σ∈S_n.(Symmetric group) belongs to AutC or not.They are helpful for the purpose to ex-

COSET PARTITION OF ADDITIVE GROUPS AND MINORITY-LOGIC DECODING ALGORITHM FOR RM CODES

Two new notions for the coset partition of dyadic additive groups are proposed,andtheir sufficient and necessary conditions are also given.On the basis of these works,the feasibilityproblem of implementing minority-logic decoding algorithm for RM codes is solved.

An Improved Group Space-Time Block Code Through Constellation Rotation

A new improved group space-time block code (G-STBC) based on constellation rotation for four transmit antennas was proposed. In comparison with the traditional G-STBC coding scheme, the proposed space-time code has longer code length and adopts proper rotation-based symbols, which can increase the minimum distance of space-time codes and thereby improve code gain and achieve full diversity performance. The simulation results verify that the proposed group space-time code can achieve better bit error performance than both the traditional group space-time code and other quasi-orthogonal space-time codes. Compared with Ma’s full diversity full rate (FDFR) codes, the proposed space-time code also can achieve the same excellent error performance. Furthermore, the design of the new space-time code gives another new and simple method to construct space-time codes with full diversity and high rate in case that it is not easy to design the traditional FDFR space-time codes.

On the Automorphism Group of Distinct Weight Codes

In this work, we study binary linear distinct weight codes (DW-code). We give a complete classification of -DW-codes and enumerate their equivalence classes in terms of the number of solutions of specific Diophantine Equations. We use the Q-extension program to provide examples.

A novel approach to authenticated group key transfer protocol based on AG codes

Group key management technique is a fundamental building block for secure and reliable group communication systems.In order to successfully achieve this goal, group session key needs to be generated and distributed to all group members in a secure and authenticated manner.The most commonly used method is based on Lagrange interpolating polynomial over the prime field F p={0,1,2,…, p-1}. A novel approach to group key transfer protocol based on a category of algebraic-geometry code is presented over the infinite field GF(2 m). The attractive advantages are obvious. Especially, the non-repeatability, confidentiality, and authentication of group key transfer protocols are obtained easily. Besides, a more generalized and simple mathematical construction model is proposed which also can be applied perfectly to related fields of information security.

一种基于多层次校验的低恢复成本纠删码

随着纠删码在分布式存储系统中的实际应用,纠删码为存储系统提供了更加优秀的存储效率,但当节点丢失时,相较于传统副本技术更多的网络传输带宽开销成为了造成系统性能瓶颈的关键因素。为了解决MDS编码高带宽开销对系统性能的影响,一类新型编码方案——分组码被应用在分布式存储系统中,相较于传统MDS编码能够有效地降低节点修复时的数据传输量,从而减少网络带宽需求。在Pyramid分组码的基础上进行层次扩展,提出一种HLRC(hierarchical local repair codes)纠删码。HLRC相较于LRC引入了层次编码模型,将原始数据块构建为编码矩阵,根据层次进行分别编码,生成包含数据块范围不同的局部校验块;每个层次包含的数据块数量不同,可以保证修复节点时的低修复成本,同时还拥有较高的存储效率。HLRC相较于Pyramid拥有额外的校验块冗余,能够降低校验块出错和多节点出错时的恢复开销。在基于Ceph的分布式存储系统中的实验结果表明,HLRC与Pyramid等分组码相比,单节点修复开销最高可降低48.56%,多节点修复开销最高可降低25%。

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.

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.

ON SELF-DUAL PERMUTATION CODES

Permutation codes over finite fields are introduced, some conditions for existence or non-existence of self-dual permutation codes are obtained.

基于OpenMC制作轻水堆中子少群截面用于OpenMOC计算

为了给确定论特征线程序OpenMOC提供高精度轻水堆少群截面库,研究了蒙特卡罗程序OpenMC的输出计数文件,开发了计数转换截面代码CSC,可以将OpenMC计数文件中的中子注量和各反应类型的反应率(单位体积内反应数占总反应数比率)计数进行处理得到中子少群截面。采用这种截面制作方式,制作了不同输运修正方式和不同精细程度能群的少群截面库,提供给OpenMOC计算。分析了轻水堆燃料组件和基准题结果,得到了截面库制作精度较高的方式。采用内散射近似和CASMO-40群制作了中子少群截面库,以OpenMC的计算结果为参考解,对C5G7基准题的结果做了对比。结果表明,k_(eff)偏差为322.5×10^(-5),燃料棒功率相对偏差均小于2%,组件功率相对偏差均小于1%,通过这种方式制作的轻水堆截面库精度良好。

基于疾病诊断相关分组付费原理分析乳腺癌手术操作编码的错误案例

目的为分析基于病病诊断相关分组(DRGs)分组付费原理分析乳腺癌手术操作编码的错误案例以减少手术操作编码错误的情况。方法本研究在2019年7月至2023年7月期间于在我院接受乳腺癌手术治疗的患者为研究对象,基于DRGs分组原理收集了乳腺癌手术治疗的患者380例,并对这些患者的病案数据进行核查,收集核查结果包括不同手术方式以及不同分期患者中错误编码的发生率情况、错误编码的类别分布以及错误编码的责任人情况。结果通过对380例患者的病案数据核查,发现其中有错误编码案例44例,不同手术方式以及不同分期患者中错误编码的发生率情况差异无统计学意义(χ^(2)=2.504,P>0.05),编码不完整错误有5例,编码不准确有17例、编码不规范有18例、编码不一致有4例,分别占错误编码的比例11.4%、38.6%、40.9%以及9.1%;临床医师发生错误编码情况有39例占总错误的比例为88.6%、编码员发生错误情况有5例占总错误的比例为11.4%。结论我院编码错误类型主要是编码不准确以及编码不规范的问题,并且临床医师发生错误编码情况较多。

循环码的一种构造方法研究

运用循环码生成多项式的性质与定义,对循环码新的构造方法进行研究,确定了构造出的循环码的重量分布、重量谱、最小距离和自同构群。新的构造方法在一定条件下比现有文献中的构造方法更易得出循环码的自同构群等性质。

Form Gene Clustering Method about Pan-Ethnic-Group Products Based on Emotional Semantic

The use of pan-ethnic-group products form knowledge primarily depends on a designer＇s subjective experience without user participation. The majority of studies primarily focus on the detection of the perceptual demands of consumers from the target product category. A pan-ethnic-group products form gene clustering method based on emotional semantic is constructed. Consumers＇ perceptual images of the pan-ethnic-group products are obtained by means of product form gene extraction and coding and computer aided product form clustering technology. A case of form gene clustering about the typical pan-ethnic-group products is investigated which indicates that the method is feasible. This paper opens up a new direction for the future development of product form design which improves the agility of product design process in the era of Industry 4.0.

Non-Full Rank Factorization of Finite Abelian Groups

Tilings of p-groups are closely associated with error-correcting codes. In [1], M. Dinitz, attempting to generalize full-rank tilings of ?Zn2??to arbitrary finite abelian groups, was able to show that if p ≥5, then?Znp? admits full-rank tiling and left the case p=3, as an open question. The result proved in this paper the settles of the question for the case p=3.

An Iterative Power Allocation Algorithm for Group-wise Space-Time Block Coding Systems

An iterative transmit power allocation (PA) algorithm was proposed for group-wise space-time block coding (G-STBC) systems with group-wise successive interference cancellation (GSIC) receivers. Group-wise interference suppression (GIS) filters are employed to separate each group's transmit signals from other interferences and noise. While the total power on all transmit symbols is constrained, all transmit PA coefficients are updated jointly according to the channel information at each iteration. Through PA, each detection symbol has the same post-detection signal to interference-and-noise ratio (SINR). The simulation results verify that the proposed PA algorithm converges at the equilibrium quickly after few iterations, and it achieves much lower bit error rates than the previous single symbol SIC PA and the fixed ratio PA algorithms for G-STBC systems with GSIC receivers .

Topological Dynamics in Tandem with Permutation Groups

The purpose of this study was to delve into the aspects of abstract algebra that has a link with topological dynamics in terms of permutation and symmetric groups. This would aid users to appreciate the role it plays in the theory and application of topological dynamics. The usage of matlab programming to carry out the permutations was carried out. The study contributes to the literature by providing candid explanation and usage of data-based evidence documenting the extent to which topological dynamics operates.

A Novel Decoding Method for Non-Binary TCM Codes

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.

GROUP CORRELATION PROPERTIES OF THE BINARY SEQUENCE SETS

The group correlation properties of binary sequences is studied, and a conclusion is drawn that not only the group correlation function of a binary sequence itself is ideal, but also some of its subsets, which code length N is even, is ideal. Finally a general formula of the group correlation of a binary sequence set is derived.

基于组稀疏卡尔曼滤波的多步轨迹预测方法

提出一种基于组稀疏卡尔曼滤波的机动轨迹多步预测方法。首先引入组稀疏编码,通过一次学习建立简单的多步线性回归预测模型,克服了传统方法未能充分利用历史数据而导致预测精度降低的问题;再利用最小角回归算法来计算该模型的稀疏系数,进一步改善模型系数估计的准确性;然后改进了卡尔曼滤波算法,并结合上述组稀疏编码算法,来确保预测结果的精确性;最后通过与传统BP、长短时记忆网络和组稀疏编码方法的仿真比较,验证了所提方法的有效性。

HMGB1、lncRNA H19与脓毒症患者预后的关系

目的分析血清高迁移率族蛋白B1(HMGB1)、长链非编码RNA H19(lncRNA H19)与脓毒症患者预后的关系。方法选取2020年1月—2022年3月新疆维吾尔自治区人民医院重症医学科诊治的脓毒症患者128例为研究对象,根据其28 d临床结局分为生存组87例和死亡组41例。比较2组血清HMGB1、lncRNA H19水平。Logistic多因素回归分析脓毒症患者预后的影响因素;绘制受试者工作特征曲线(ROC)分析血清HMGB1、lncRNA H19评估患者预后的价值,并采用决策曲线分析(DCA)血清HMGB1、lncRNA H19单独与联合评估的临床获益率。结果死亡组血清HMGB1水平高于生存组,lncRNA H19水平低于生存组(t/P=5.212/<0.001,5.487/<0.001)。Logistic多因素回归分析结果显示,血清HMGB1升高是脓毒症患者预后的独立危险因素[OR(95%CI)=3.710(1.965~7.004)],血清lncRNA H19升高为其独立保护因素[OR(95%CI)=0.331(0.117~0.935)]。ROC曲线结果显示,血清HMGB1、lncRNA H19及二者联合评估脓毒症患者预后的曲线下面积(AUC)分别为0.760、0.788、0.867,二者联合评估预后价值大于单项预测(Z/P=3.245/<0.001、2.641/0.008)。绘制DCA曲线结果显示,在阈值0.23~0.73范围内,血清HMGB1、lncRNA H19联合评估模型评估脓毒症患者预后的净受益率优于单独检测。结论血清HMGB1升高、lncRNA H19降低可增加脓毒症患者28 d死亡风险,检测二者水平可用于患者预后评估,且联合评估可提高净受益率。