导航

  • 个人简介
  • 学习经历
  • 工作经历
  • 研究方向
  • 主要论文
  • 主要著作
  • 承担课题

个人信息

头像

姓名： 陈豪

部门： 信息科学技术学院

性别： 男

职务：

职称： 教授

学位：

毕业院校：

联系电话：

电子邮箱：

办公地址：

通讯地址：

邮编：

传真：

荣誉奖励： 国家杰出青年科学基金获得者

联系方式

个人简介

国家基金委杰出青年科学基金获得者、“新世纪百千万人才工程”国家级人选。长期从事编码、密码与信息安全、 量子信息、代数几何、格构造与格算法等领域的研究，作为负责人承担国家基金委重点项目、国际合作(重大)项目、军工项目和国家基金面上项目等项目的研究。在Crypto, Eurocrypt, IEEE Transactions on Information Theory等顶级国际会议和国际期刊发表系列论文。2002年获得国家杰出青年科学基金资助，2004年入选为新世纪百千万人才工程国家级人选，2002年获得政府特殊津贴，2025年被提名列入中国科学院院士增选有效候选人。

学习经历

工作经历

研究方向

编码、密码与信息安全、 量子信息、代数几何、格构造与格算法

主要论文

1. H. Chen, C. Xie, and C. Ding, Repeated-root cyclic codes with optimal parameters or best parameters known, IEEE Transactions on Information Theory, early access, 2026.

2. H. Chen, S. Liu, C. Xie, and H. Liu, Optimal CIS codes, optimal t-CIS codes and their applications in cryptography, Designs, Codes and Cryptography, early access, 2025.

3. H. Chen, Z. Cheng, and Y. Qi, Construction and fast decoding of binary linear sum-rank-metric codes, IEEE Transactions on Information Theory, vol. 71, no. 12, pp. 9319-9329, Dec. 2025.

4. H. Chen, Griesmer and optimal linear codes from the affine Solomon-Stiffler construction, IEEE Transactions on Information Theory, vol. 71, no. 9, pp. 6834-6843, Sept. 2025.

5. H. Chen and C. Xie, Projective linear codes and their simplex complementary codes, Journal of Algebra, vol. 673, pp. 304-320, Jul. 2025.

6. C. Xie, H. Chen, H. Zhou, Y. Li, and H. Lao, Optimal, almost optimal few-weight linear codes and related quantum codes, IEEE Transactions on Information Theory, vol. 71, no. 6, pp. 4250-4259, Jun. 2025.

7. C. Xie, H. Chen, C. Li, and S. Mesnager, Constructions of self-orthogonal linear codes and dual-containing BCH codes, IEEE Transactions on Information Theory, vol. 71, no. 7, pp. 5049-5062, Jul. 2025.

8. F. Li, Y. Chen, H. Chen, and Y. Niu, Non-Reed-Solomon type cyclic MDS codes, IEEE Transactions on Information Theory, vol. 71, no. 5, pp. 3489-3496, May 2025.

9. X. Pan, H. Chen, C. Tang, and X. Chen, New bounds for generalized column distances and construction of convolutional codes, IEEE Transactions on Information Theory, vol. 71, no. 4, pp. 2576-2590, Apr. 2025.

10. X. Pan, H. Chen, H. Liu, and S. Lyu, Griesmer type bounds for nonlinear codes and their applications, IEEE Transactions on Information Theory, vol. 71, no. 4, pp. 2550-2563, Apr. 2025.

11. H. Chen and C. Ding, Self-dual cyclic codes with square-root-like lower bounds on their minimum distances, IEEE Transactions on Information Theory, vol. 71, no. 4, pp. 2389-2396, Apr. 2025.

12. H. Chen, Covering b-Symbol metric codes and the generalized singleton bound, IEEE Transactions on Information Theory, vol. 71, no. 3, pp. 1585-1592, Mar. 2025.

13. X. Pan, H. Chen, H. Liu, and S. Liu, Optimal few-SSW linear codes and their subcode support weight distributions, IEEE Transactions on Information Theory, vol. 71, no. 2, pp. 1028-1042, Feb. 2025.

14. C. Xie, H. Chen, and C. Li, New ternary LCD cyclic and BCH codes, Advances in Mathematics of Communications, vol. 19, no. 2, pp. 748-754, Apr. 2025.

15. H. Chen and C.Xie, A new upper bound for linear codes and vanishing partial weight distributions,  IEEE Transactions on Information Theory, vol. 70, no. 12, pp. 8713-8722, Dec. 2024.

16. C. Xie, H. Chen, and C. Yuan, Explicit cyclic and quasi-cyclic codes with optimal, best known parameters and large relative minimum distances, IEEE Transactions on Information Theory, vol. 70, no. 12, pp. 8688-8697, Dec. 2024.

17. T. Chen, Z. Sun, C., H. Chen, and C. Ding, Two classes of constacyclic codes with a square-root-like lower bound, IEEE Transactions on Information Theory, vol. 70, no. 12, pp. 8734-8745, Dec. 2024.

18. H. Chen and Y. Wu, Cyclic and negacyclic codes with optimal and best known minimum distances, IEEE Transactions on Information Theory, vol. 70, no. 12, pp. 8628-8635, Dec. 2024.

19. C. Xie, H. Chen, C. Ding, and Z. Sun, Self-dual negacyclic codes with variable lengths and square-root-like lower bounds on the minimum distances, IEEE Transactions on Information Theory, vol. 70, no. 7, pp. 4879-4888, Jul. 2024.

20. H. Chen, Many non-Reed-Solomon type MDS codes from arbitrary genus algebraic curves, IEEE Transactions on Information Theory, vol. 70, no. 7, pp. 4856-4864, Jul. 2024.

21. H. Chen, L. Qu, C. Li, S. Lyu, L. Xu, and M. Zhou, Generalized Singleton type upper bounds, IEEE Transactions on Information Theory, vol. 70, no. 5, pp. 3298-3308, May 2024.

22. C. Xie, H. Chen, L. Qu, and L. Liu, New dimension-independent upper bounds on linear insdel codes, Advances in Mathematics of Communications, vol. 18, no. 6, pp. 1575-1589, Dec. 2024.

23. H. Chen, New explicit good linear sum-rank-metric codes, IEEE Transactions on Information Theory, vol. 69, no. 10, pp. 6303-6313, Oct. 2023.

24. H. Lao, H. Chen, F. Li, and S. Lyu, New constant dimension subspace codes from the mixed dimension construction, IEEE Transactions on Information Theory, vol. 69, no. 7, pp. 4333-4344, Jul. 2023.

25. Q. Ji, D. Zheng, H. Chen and X. Wang, Strict half-Singleton bound, strict direct upper bound for linear insertion-deletion codes and optimal codes, IEEE Transactions on Information Theory, vol. 69, no. 5, pp. 2900-2910, May 2023.

26. H. Chen, On the hull-variation problem of equivalent linear codes, IEEE Transactions on Information Theory, vol. 69, no. 5, pp. 2911-2922, May 2023

27. H. Chen, Coordinate-ordering-free upper bounds for linear insertion-deletion codes, IEEE Transactions on Information Theory, vol. 68, no. 8, pp. 5126-5132, Aug. 2022.

28. H. Chen, J. Weng, W. Luo, and L. Xu, Long optimal and small-defect LRC codes with unbounded minimum distances, IEEE Transactions on Information Theory, vol. 67, no. 5, pp. 2786-2792, May 2021.

29. H. Chen, X. He, J. Weng, and L. Xu, New constructions of subspace codes using subsets of MRD codes in several blocks, IEEE Transactions on Information Theory, vol. 66, no. 9, pp. 5317-5321, Sept. 2020.

30. L. Xu and H. Chen, New constant-dimension subspace codes from maximum rank distance codes, IEEE Transactions on Information Theory, vol. 64, no. 9, pp. 6315-6319, Sept. 2018.

31. H. Chen, Reducing the computation of linear complexities of periodic sequences over GF(pm), IEEE Transactions on Information Theory, vol. 52, no. 12, pp. 5537-5539, Dec. 2006.

32. H. Chen and R. Cramer, Algebraic geometric secret sharing schemes and securemulti-party computations over small fields, in Annual International Cryptology Conference, Springer, Berlin, Heidelberg, pp. 521-536, Aug. 2006.

33. H. Chen, S. Ling, and C. Xing, Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound, IEEE Transactions on Information Theory, vol. 47, no. 5, pp. 2055-2058, Jul. 2001.

34. H. Chen, C. Seeley, and S. S. T. Yau, Algebraic determination of isomorphism classes of the moduli algebras of E6 singularities, Mathematische Annalen,vol. 318, no. 4, pp. 637-666, Oct. 2000.

35. H. Chen, On the minimum distances of Schubert codes, IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1535-1538, Jul. 2000.

36. H. Chen, Nonexistence of negative weight derivations on Graded artin algebras: A conjecture of Halperin, Journal of Algebra, vol. 216, no. 1, pp. 1-12, Jun. 1999.

37. H. Chen, On minimum Lee weights of Hensel lifts of some binary BCH codes, IEEE Transactions on Information Theory, vol. 45, no. 6, pp. 2157-2162, Sept. 1999.

38. H. Chen, Necessary conditions for the efficient simulation of Hamiltonians using localunitary operations, 2001.arXiv preprint quant-ph/0109115.

39. H. Chen, R., Cramer, S. Goldwasser, R. De Haan, and V. Vaikuntanathan, Secure computation from random error correcting codes, in Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, Berlin, Heidelberg, pp. 291-310, May, 2007.


主要著作

承担课题

发明专利

讲授课程

荣誉奖励

国家杰出青年科学基金获得者

社会职务