学科信息

 2011年获得复旦大学计算机专业博士学位，2017年2月加入东莞理理工学院。目前以第一作者身份在国内外会议及期刊发表论文20余篇，主持国家自然科学青年基金，面上项目已经结题, 作为合作单位参与一项国家自然科学基金重点项目。

主要研究方向

• 1）在网络编码中子空间码构造研究,  网站http://subspacecodes.uni-bayreuth.de/ 公布目前研究的最新进展, 目前我们已经改进了这个网站上的很多结果。

• 2）基于知识图谱的问答系统。

科研成果

一、网络编码

1） C. Hao, H. Xianmang, J. Wen, and L. Xu, “New Constructions of Subspace Codes Using Subsets of MRD codes in Several Blocks,”  IEEE Transactions on Information Theory, 2019.   accepted

2） Parallel Sub-code Construction for Constant-Dimension Code， Xianmang He etc,  DESIGNS CODES AND CRYPTOGRAPHY,   accepted

3) Construction of Constant Dimension Code from Two Parallel Versions of Linkage Construction,  Xianmang He. etc.  IEEE communication Letter, accepted

4) New Construction for Constant Dimension Subspace Codes via a Composite Structure,Xianmang He. etc.  IEEE communication Letter, accepted

5) Enhancing Echelon-Ferrers Construction for Constant Dimension Code, Xianmang He,  JAMC, Accepted.

6) A Construction for Constant Dimension Codes from the Known Codes,   Kunxiao Zhou, etc.  WASA2021, Accepted.

7) Improving the Linkage Construction with Echelon-Ferrers for Constant-Dimension Code， Xianmang He. etc. IEEE communication Letter, accepted

8)Combining  linkage construction and echelon-Ferrers construction for Constant-Dimension Code, Xianmang He.etc.  CoRR

9)A Hierarchical-based Greedy Algorithm for Echelon-Ferrers Construction.  CoRR

10)Construction of Const Dimension Codes from Serval Parallel Lift MRD Code. CoRR

二、量子纠错码构造

1)  He X, Xu L, Hao C. New q -ary quantum MDS codes with distances bigger than q/2 [J]. Quantum Information Processing, 2016, 15(7):1-14.

2)Xianmang He: Constructing new q-ary quantum MDS codes with distances bigger than q/2 from generator matrices. Quantum Information & Computation 18(3&4): 225-232 (2018)

3)Hu L, Yue Q, He X. Quantum MDS codes from BCH constacyclic codes[J]. Quantum Information Processing, 2018, 17(12):323.

三、序列密码

1）He X ,  Hu L ,  Li D . On the GF(p) linear complexity of Hall’s sextic sequences and some cyclotomic-set-based sequences[J]. Chinese Annals of Mathematics, Series B, 2016, 37(4):515-522.

2）HXM. Legendre序列在GF(p)上的线性复杂度[J]. 通信学报, 2008, 29(3):16-22.

3)HXM, 陈银冬, 赵杆. 广义割圆序列的p+1/2-错线性复杂度[C]// 中国密码学会年会. 2008.  （证明这类割圆序列容易被低次多项式逼近)

四、隐私保护

1) Xianmang He, Xiaoyang Sean Wang, Dong Li, Yanni Hao: Semi-Homogenous Generalization: Improving Homogenous Generalization for Privacy Preservation in Cloud Computing. J. Comput. Sci. Technol. 31(6): 1124-1135 (2016)

2）Dong Li, Xianmang He, Longbing Cao, HuaHui Chen:Permutation anonymization. J. Intell. Inf. Syst. 47(3): 427-445 (2016)

3）Xianmang He, Yanghua Xiao, Yujia Li, Qing Wang, Wei Wang, Baile Shi:Dynamic Anonymization for Marginal Publication. SSDBM 2011: 451-460

4)Xianmang He, Hongyuan, Yindongchen, Exploring the Privacy Bound for Differential Privacy: From Theory to Practice,EAI Endorsed Transactions on Security and Safety, 2018