The dynamics of group codes defined on totally ordered sets is studied.The natural state realization of a group code is constructed and proved to be minimal.The trellis diagram of a group code is defined and studied.T...The dynamics of group codes defined on totally ordered sets is studied.The natural state realization of a group code is constructed and proved to be minimal.The trellis diagram of a group code is defined and studied.The natural input/state/outpe realization of a group code is also constructed and proved to be invertible and minimal.展开更多
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 lo...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.展开更多
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-lo...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.展开更多
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.展开更多
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.展开更多
Neuroscience (also known as neurobiology) is a science that studies the structure, function, development, pharmacology and pathology of the nervous system. In recent years, C. Cotardo has introduced coding theory into...Neuroscience (also known as neurobiology) is a science that studies the structure, function, development, pharmacology and pathology of the nervous system. In recent years, C. Cotardo has introduced coding theory into neuroscience, proposing the concept of combinatorial neural codes. And it was further studied in depth using algebraic methods by C. Curto. In this paper, we construct a class of combinatorial neural codes with special properties based on classical combinatorial structures such as orthogonal Latin rectangle, disjoint Steiner systems, groupable designs and transversal designs. These neural codes have significant weight distribution properties and large minimum distances, and are thus valuable for potential applications in information representation and neuroscience. This study provides new ideas for the construction method and property analysis of combinatorial neural codes, and enriches the study of algebraic coding theory.展开更多
目的利用人工智能构建基于疾病诊断相关分组(diagnosis related groups,DRG)/按病种分值付费(diagnosis-intervention packet,DIP)支付制度的国际疾病分类编码(international classification of diseases,ICD)质控体系,分析其在医院病...目的利用人工智能构建基于疾病诊断相关分组(diagnosis related groups,DRG)/按病种分值付费(diagnosis-intervention packet,DIP)支付制度的国际疾病分类编码(international classification of diseases,ICD)质控体系,分析其在医院病案质量管理中的应用效果,探索可持续、可推广的编码质量管理新模式。方法从梅州市人民医院2024年1—6月的电子病历系统中选取1200份住院病案以人工编码作为对照组,2024年7—12月的电子病历系统中选取1200份住院病案以人工智能质控平台结合人工编码作为试验组,邀请专家对试验组和对照组的编码质量进行人工质量检查,观察2组病案编码准确率、编码效率与医保结算时间、医疗费用结算损失减少金额、DIP核心病种入组率等指标进行比对。结果对照组的编码准确率为83.58%,低于试验组的99.08%,差异有统计学意义(P<0.05)。对照组医保费用结算损失为92万元(占医保费用基金不合理支付总额比约27.88%),高于试验组的21万元(占医保费用基金不合理支付总额比约12.73%)。对照组单份病历平均编码耗时为(28.61±5.74)min,高于试验组的(14.33±3.21)min,差异有统计学意义(P<0.05)。对照组的DIP核心病种入组率为83.84%,低于试验组的95.58%,差异有统计学意义(P<0.05)。结论基于人工智能下ICD编码质控模式可以快速提升编码质量和效率,为DRG/DIP支付制度的顺利推行提供了有力支撑,具有重要的应用价值。展开更多
Low-density parity-check (LDPC) codes were first presented by Gallager in 1962. They are linear block codes and their bit error rate (BER) performance approaches remarkably close to the Shannon limit. The LDPC cod...Low-density parity-check (LDPC) codes were first presented by Gallager in 1962. They are linear block codes and their bit error rate (BER) performance approaches remarkably close to the Shannon limit. The LDPC codes created much interest after the rediscovery by Mackay and Neal in 1995. This paper introduces some new LDPC codes by considering some combinatorial structures. We present regular LDPC codes based on group divisible designs which have Tanner graphs free of four-cycles.展开更多
摘要The dynamics of group codes defined on totally ordered sets is studied.The natural state realization of a group code is constructed and proved to be minimal.The trellis diagram of a group code is defined and studied.The natural input/state/outpe realization of a group code is also constructed and proved to be invertible and minimal.
基金National High Technology Research andDevelopment Program (863) of China( No. 003AA12331007 ) and NationalNatural Science Foundation of China(No. 60272079, 60332030)
摘要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.
摘要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.
摘要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 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.
摘要Neuroscience (also known as neurobiology) is a science that studies the structure, function, development, pharmacology and pathology of the nervous system. In recent years, C. Cotardo has introduced coding theory into neuroscience, proposing the concept of combinatorial neural codes. And it was further studied in depth using algebraic methods by C. Curto. In this paper, we construct a class of combinatorial neural codes with special properties based on classical combinatorial structures such as orthogonal Latin rectangle, disjoint Steiner systems, groupable designs and transversal designs. These neural codes have significant weight distribution properties and large minimum distances, and are thus valuable for potential applications in information representation and neuroscience. This study provides new ideas for the construction method and property analysis of combinatorial neural codes, and enriches the study of algebraic coding theory.
摘要目的利用人工智能构建基于疾病诊断相关分组(diagnosis related groups,DRG)/按病种分值付费(diagnosis-intervention packet,DIP)支付制度的国际疾病分类编码(international classification of diseases,ICD)质控体系,分析其在医院病案质量管理中的应用效果,探索可持续、可推广的编码质量管理新模式。方法从梅州市人民医院2024年1—6月的电子病历系统中选取1200份住院病案以人工编码作为对照组,2024年7—12月的电子病历系统中选取1200份住院病案以人工智能质控平台结合人工编码作为试验组,邀请专家对试验组和对照组的编码质量进行人工质量检查,观察2组病案编码准确率、编码效率与医保结算时间、医疗费用结算损失减少金额、DIP核心病种入组率等指标进行比对。结果对照组的编码准确率为83.58%,低于试验组的99.08%,差异有统计学意义(P<0.05)。对照组医保费用结算损失为92万元(占医保费用基金不合理支付总额比约27.88%),高于试验组的21万元(占医保费用基金不合理支付总额比约12.73%)。对照组单份病历平均编码耗时为(28.61±5.74)min,高于试验组的(14.33±3.21)min,差异有统计学意义(P<0.05)。对照组的DIP核心病种入组率为83.84%,低于试验组的95.58%,差异有统计学意义(P<0.05)。结论基于人工智能下ICD编码质控模式可以快速提升编码质量和效率,为DRG/DIP支付制度的顺利推行提供了有力支撑,具有重要的应用价值。
基金Supported by the National Natural Science Foundation of China(Grant Nos.1107105611201114)
摘要Low-density parity-check (LDPC) codes were first presented by Gallager in 1962. They are linear block codes and their bit error rate (BER) performance approaches remarkably close to the Shannon limit. The LDPC codes created much interest after the rediscovery by Mackay and Neal in 1995. This paper introduces some new LDPC codes by considering some combinatorial structures. We present regular LDPC codes based on group divisible designs which have Tanner graphs free of four-cycles.