程民权,1981年9月出生,2012年博士毕业于(日本)筑波大学并获得筑波大学校长特别表彰. 现为广西师范大学计算机科学与信息工程学院教授、博士生导师。中国保密协会隐私保护专业委员会委员。首批入选广西高校引进海外高层次人才“百人计划”。广西杰出青年基金获得者。

     主要研究领域为无线网络通信中的编码密码、信息安全、多媒体版权保护等问题。目前已发表SCI学术论文39篇,其中7篇发表在信息论国际顶级期刊《IEEE Trans. Inform. Theory》上,9篇发表通信领域顶级期刊《IEEE Trans. Commun.》上,6篇发表在国际密码学报《Des. Codes Crytogr.》上。共主持8个基金项目,其中国家自然科学基金2项,广西自然科学基金3项。
      Email: chengqinshi@hotmail.com

 

主持基金项目:

[1] 国家自然科学地区基金项目“动态编码缓存方案中若干重要问题研究”(62061004)负责人(2021.1-2024.12,39万);

[2] 广西自然科学基金面上项目“编码缓存方案的相关研究”(2018GXNSFAA138152)负责人(2018.71-2020.7.1, 20万

[3] 广西自然科学杰出青年基金项目“组合设计及其相关的编码、密码、版权保护等问题”( 2016GXNSFFA380009)负责人(2016.9-2020.8, 40万)

[4] 国家自然科学基金“抗合谋攻击码的构造及其追踪算法设计”(11301098)负责人(2014.1-2016.12, 23万)

[5] 教育部留学回国人员科研启动基金 “可分码及其应用研究”(教外司留(2013)693号文件)负责人(2012.9-2015, 3万)

[6] 广西自然科学基金项目“组合设计在版权保护中的应用”(2013GXNSFCA019 001)负责人(2013.4-2016.3, 10万)

[7] 广西教育自然科学技术研究项目“两类多媒体指纹的构造”(2013YB039),负责人(2013.1-2014.12, 3万)

[8] 广西师范大学自然科学基金重点项目 “最优防诬陷码的构造”(2012ZD001)负责人(2013.1-2015.12, 3万)

主要论文:

2021年

[1]  M.Cheng, Q. Liang, K. Wan, M. Zhang, G. Caire, A novel transformationapproach of shared-link coded caching schemes for multi-access networks, IEEE Trans. Commun., vol. 69, no. 11, pp. 7376-7389, Nov. 2021.  (SCI 1区, IF: 5.69  Top)

[2] M. Cheng, J. Wang, X. Zhong, and Q. Wang, A framework of constructing placement delivery arraysfor centralized coded caching, IEEE Trans. Inform. Theory, vol. 67, no. 11, pp. 7121-7131.Oct.,2021.(SCI Top, CCF A类, IF: 3.215)

[3] X. Li, Q. Zhang, M. Cheng, and K. Wan, An approach to reduce the redundancy of placement delivery array schemesfor random demands, IEEE Wireless Communications Letters, vol. 10, no. 6, pp. 1314-1318, June, 2021. (SCI 3区, IF:4.66)

[4] Q. Chen, M. Cheng andB. Bai, Matroidalentropy functions:A quartet of theories of information,matroid, design andcoding, Entropy, vol. 23, no. 3, 323, DOI: 10.3390/e23030323,  Mar., 2021. (SCI, 3区, IF:2.53)

[5] X. Zhong, M. Cheng and R. Wei, Codedcachingschemeswith linear subpacketizations, IEEE Trans. Commun.,  vol. 69, no. 6, pp. 3628-3637, June, 2021.  (SCI 1区, IF: 5.69  Top

[6] M.Cheng, J. Li and X. Tang, R. Wei, Linear codedcaching scheme for centralizednetworks, IEEE Trans. Inform. Theory, vol.67,   no. 3, 1732-1742, Feb., 2021. (SCI Top, CCF A类, IF: 3.215)

[7] Y. Li, Y.Chang, M. Cheng, and T. Feng,Multi-valueprivate information retrieval with colluding databases via tracefunctions, Information Sciences,  vol. 543,425-436,2021.  (中科院分区一区,SCI,2区, IF:5.91) 


2020年

[1] M. Zhang, M.Cheng, J. Wang, X. Zhong and Y. Chen, Improving placement delivery array coded cachingschemes with coded placement, IEEE Access, vol.8, 217456-217462, Nov. 07, 2020. (SCI)

[2] M.Cheng, Y. Li, X. Zhong, and R. Wei, Improved constructions of coded caching schemes for combination networks, IEEE Trans. Commun.,vol. 68, no. 10, 5965-5975, Oct. 2020. (SCI 1, IF: 5.69  Top) 

[3]M. Cheng, W. Zhang and J. Jiang, Some new coded caching schemes with smaller subpacketization via some known results, IEEE Access, vol. 8, no. 1, pp. 86305- 86315, 21 May 2020. (SCI)   

[4] X. Zhong, M. Cheng, and J. Jiang, Placement delivery array based on concatenating construction, IEEE Commun. Letters,  vol. 24, no. 6, pp. 1216-1220, Jun. 2020.(SCIIF3.457)

[5] J. Jiang and M. Cheng, Regular (k,R,1)-packings with max(R)=3 and their locally repairable codes, Cryptogr. Commun., DOI: 10.1007/s12095-020-00424-4. Feb. 2020 (SCI)

[6] Q. Zhang, L. Zheng, M. Cheng, Q. Chen, On the dynamic centralized coded caching design, IEEE Trans. Commun., 68(4): 2118-128, April. 2020. (SCI 1 , IF: 5.69 Top)

[7] J. Jiang, Y. Gu, and M. Cheng, Multimedia IPP codes with efficient tracing, Des. Codes Cryptogr., DOI:‪10.1007/s10623-‪020-00717-y, Jan. 2020. (SCI, CCF B, IF: 1.224)

[8] M. Cheng, J. Jiang, X. Tang, and Q. Yan, Some variant coded caching schemes with good performance, IEEE Trans. Commun., 68(3): 1370-1377, Mar. 2020. (SCI  1 , IF: 5.69 Top)


2019年

[1] Y. Gu, M. Cheng, G. Kabatiansky, Y. Miao, Probabilistic existence results for parent- identifying schemes, IEEE Trans. Inform. Theory, 65(10). 6160-6170, Oct. 2019 (SCI Top, CCF A, IF: 3.215)

[2] M. Cheng, J. Jiang, Q. Yan, X.Tang, Coded caching schemes for flexible memory sizes, IEEE Trans. Commun., 67(6): 4166-4176, June. 2019. (SCI, 2 , IF: 4.671, Top)

[3] M. Cheng, J. Jiang, Q. Wang, Y. Yao,A generalized grouping scheme in coded caching, IEEE Trans.  Commun.,67(5): 3422-3430, May 2019. (SCI, 2 , IF: 4.671, Top)

[4] J. Wang, M. Cheng, Q. Yan, and X. Tang, On the placement delivery array design for coded caching scheme in D2D networks, IEEE Trans. Commun., 67(5): 3388-3395, May 2019.(SCI, 2 区, IF: 4.671, Top)

[5] H. Cai, M. Cheng, C. Fan, X. Tang, Optimal locally repairable systematic codes based on packings, IEEE  Trans. Commun., 67(1): 39-49,Jan. 2019. (SCI, 2 , IF: 4.671, Top)

[6] M. Cheng, J. Jiang, Q. Wang, Improved bounds on 2-frameproof codes with length 4, Des., Codes, Cryptogr., 87(1): 97-106, Jan. 2019.(SCI, CCF B, IF: 1.224)


2018年

[1] H. Wang, M. Cheng, Q. Chen, X. Tang and Q. Huang, Enhanced adaptive network coded cooperation for wireless networks, IEEE Trans. Vehicular Technology, 67(12): 11988-12002, Dec. 2018. (SCI, 2 , IF: 4.432)

[2] D. Niu, H. Wang, M. Cheng and C. Shi, Reference sharing mechanism-based self-embedding watermarking scheme with deterministic content reconstruction, Security and Commun. Networks, 2018: 1-12, 2018. (SCI)

[3] Q. Yan, X. Tang, Q. Chen, M. Cheng, Placement delivery array design through strong edge coloring of bipartite graphs, IEEE Commun. Letters,  22(2): 236-239, Feb. 2018.(SCI)

[4] X. Zhang, J. Jiang, M. Cheng, Bounds and constructions for 3-strongly separable codes with length 3, Cryptogr., Commun., 10(3): 555-565, May, 2018.(SCI)


2011年-2017年

[1] Q. Yan, M. Cheng, X. Tang and Q. Chen, On the placement delivery array design for centralized coded caching scheme, IEEE Trans. Inform. Theory,  63(9): 5821-5833, Sep. 2017.(SCI Top, CCF A, IF: 3.215)

[2] M. Cheng, H. Fu, J. Jiang, Y. Lo and Y. Miao, Codes with the identifiable parent property for multimedia fingerprinting, Des., Codes, Cryptogr., 83(1): 71-82, April 2017.(SCI, CCF B, IF: 1.224)

[3] M. Cheng, J. Jiang and X. Tang, Asymptotically optimal 2-separable codes with length 4, Cryptogr., Commun., 9(3): 397-405, May 2017.  (SCI)

[4] M. Cheng, J. Jiang, H. Li, Y.Miao and Xiaohu Tang, Bounds and constructions for 3-separable codes of length 3, Des. Codes Cryptogr., 81(2): 317-335, November 2016.(SCI, CCF B, IF: 1.224)

[5] J. Jiang, M. Cheng and Y. Miao, Strongly separable codes, Des. Codes Cryptogr., 79(2): 303-318, May, 2016. (SCI, CCF B, IF: 1.224)

[6] M. Cheng, H-L. Fu, J. Jiang, Y-H. Lo, and Y. Miao, New bounds on 2-separable codes of length 2, Des. Codes Cryptogr., 74(1): 31-40, Jan. 2015.(SCI, CCF B, IF: 1.224)

[7] X. Wang, Y. Miao and M. Cheng, Finding motifs in DNA sequences using Low-Dispersion sequences, Journal of Computational Biology, 21( 4):. 320-329. 2014.  (SCI)

[8] M. Cheng, J. Jiang, and D. Wu, Bounds and constructions for two-dimensional variable-weight optical orthogonal codes, Journal of Combinatorial Designs,22(9): 391-408, 2014. (SCI)

[9] M. Cheng, L. Ji and Y. Miao, Separable codes, IEEE Trans. Inform. Theory, 58(3): 1791- 1803, 2012. (SCI Top, CCF A, IF: 3.215)

[10] M. Cheng and Y. Miao, On anti-collusion codes and detection algorithms for multimedia fingerprinting, IEEE Trans. Inform. Theory,57(7): 4843-4851, 2011.(SCI Top, CCF A, IF:3.215)

[11] M. Buratti, Y. Wei, D. Wu, P. Fan, M. Cheng, Relative difference families with variable block sizes and their related OOCs, IEEE Trans. Inform. Theory, 57(11): 7489-7497, 2011.(SCI Top, CCF A, IF: 3.215)