| 姓 名 | 邢朝平 | 性 别 | 男 | 出生年月 |
|---|---|---|---|---|
| 所在院校 | 中国科学技术大学 | 所在院系 | 数学系 | |
| 职称 | 教授 | 招生专业 | ||
| 研究领域 | 1 Coding Theory 2 Cryptography 3 Number Theory 4 Algebraic Curves over Finite Fields 5 Quasi Monte Carlo Methods 6 Computer Security |
| 联系方式 | xingcp@ustc.edu.cn | 电 话 | 0551******* | 邮 编 | 230026 | |
|---|---|---|---|---|---|---|
| 地 址 | 中国科学技术大学数学系 |
| 个人简介 |
邢朝平，安徽无为人，2000年入选“中国科学院百人计划”博士生导师，主要从事代数数论，编码，密码，计算机安全的研究，在国外重要杂志上发表的论文有五十多篇。其在编码上的研究成果处于国际领先地位，在国际会议发表论文有十多篇，专著五本，由剑桥出版社出版的CodingTheory -- A Fisrt Course一书已在欧洲多所大学作为教材使用，曾获洪堡奖学金和新加坡国家科学奖，并受邀在欧洲数学家大会和海外华人数学家大会上作特邀报告，承担过中国国家自然科学基金项目，新加坡国家科学技术基金，新加坡国防部基金，新加坡教育部基金等项目，培养研究生数人，主讲得课目有数论，代数几何，编码,密码等。 工作简历 1 6/1990 - 12/1991: Lecturer and Associate Professor, University of 邢朝平，安徽无为人，2000年入选“中国科学院百人计划”博士生导师，主要从事代数数论，编码，密码，计算机安全的研究，在国外重要杂志上发表的论文有五十多篇。其在编码上的研究成果处于国际领先地位，在国际会议发表论文有十多篇，专著五本，由剑桥出版社出版的CodingTheory -- A Fisrt Course一书已在欧洲多所大学作为教材使用，曾获洪堡奖学金和新加坡国家科学奖，并受邀在欧洲数学家大会和海外华人数学家大会上作特邀报告，承担过中国国家自然科学基金项目，新加坡国家科学技术基金，新加坡国防部基金，新加坡教育部基金等项目，培养研究生数人，主讲得课目有数论，代数几何，编码,密码等。 工作简历 1 6/1990 - 12/1991: Lecturer and Associate Professor, University of |
| 获得奖项 |
| 1993-1995: Alexander von Humboldt Fellowship (Germany) 2001: Hundrend Talents Pragram (China) 2003: National Science Award (Singapore) 1993-1995: Alexander von Humboldt Fellowship (Germany) 2001: Hundrend Talents Pragram (China) 2003: National Science Award (Singapore) |
| 著作及论文 |
| Recent Publications (Since 1991) Publications on International Journals 2. Hyperelliptic function fields and codes, J. of Pure and Appl. Algebra, Vol. 74(1991), 109-118. 3. When are two geometric Goppa codes equal?, IEEE Inform. Theory, Vol.38(1992), 1140-1142. 4. Multiple Kummer extensions and the number of prime divisors of degree one in function fields, J. of Pure and Appl. Algebra, Vol.84(1993), 85-93. 5. The structure of the rational point groups of simple abelian varieties of dimension two over finite fields, Arch. Math., Vol.63(1994), 427-430. 6. On automorphism groups of Hermitian codes, IEEE Inform. Theory, Vol.41(1995), 1629-1635. 7.(with H. Niederreiter), Low-discrepancy sequences obtained from algebraic function fields over finite fields, Acta Arith., Vol.72(1995), 281-298. 8. On automorphism group of elliptic codes, Comm. in Algebra, Vol.23(1995), 4061-4072. 9. (with H. Niederreiter), A construction of low-discrepancy sequences using global function fields, Acta Arith., Vol.73(1995), 87-102. 10. (with H. Stichtenoth), The genus of maximal function fields over finite fields, Manuscripta Math.,Vol.86(1995), 217-224. 11. (with H. Stichtenoth), On the structure of divisor class group ... Recent Publications (Since 1991) Publications on International Journals 2. Hyperelliptic function fields and codes, J. of Pure and Appl. Algebra, Vol. 74(1991), 109-118. 3. When are two geometric Goppa codes equal?, IEEE Inform. Theory, Vol.38(1992), 1140-1142. 4. Multiple Kummer extensions and the number of prime divisors of degree one in function fields, J. of Pure and Appl. Algebra, Vol.84(1993), 85-93. 5. The structure of the rational point groups of simple abelian varieties of dimension two over finite fields, Arch. Math., Vol.63(1994), 427-430. 6. On automorphism groups of Hermitian codes, IEEE Inform. Theory, Vol.41(1995), 1629-1635. 7.(with H. Niederreiter), Low-discrepancy sequences obtained from algebraic function fields over finite fields, Acta Arith., Vol.72(1995), 281-298. 8. On automorphism group of elliptic codes, Comm. in Algebra, Vol.23(1995), 4061-4072. 9. (with H. Niederreiter), A construction of low-discrepancy sequences using global function fields, Acta Arith., Vol.73(1995), 87-102. 10. (with H. Stichtenoth), The genus of maximal function fields over finite fields, Manuscripta Math.,Vol.86(1995), 217-224. 11. (with H. Stichtenoth), On the structure of divisor class group of a class of curves over finite fields, Arch. Math., Vol.65(1995), 141-150. 12. (with H. Niederreiter), Low-discrepancy sequences and global function fields with many rational places, Finite Fields and Their Applications, 2(1996), 241-273. 13. (with H. Niederreiter), Modules de Drinfeld et courbes algebriques ayant beaucoup de points rationnels, C. R. Acad. Sci. Paris Ser. I Math., 322(1996), 651-654. 14. (with H. Niederreiter), Explicit global function fields over the binary field with many rational places, Acta Arith. 75(1996), 383-396. 15. On supersingular abelian varieties of dimension two over finite fields, Finite Fields and Their Applications, 2(1996), 407-421. 16. (with H. Niederreiter), Cyclotomic function fields, Hilbert class fields, and global function fields with many rational places, Acta Arith., 79(1997), 59-76. 17. (with H. Niederreiter), Drinfeld modules of rank 1 and curves with many rational points II, Acta Arith., 81(1997), 81-100. 18. (with H. Niederreiter), Global function fields with many rational places over the quinary field, Demonstratio Mathematica, 30(1997) 919-930. 19. (with H. Niederreiter), Global function fields with many rational places over the ternary field, Acta Arith., 83(1998), 65-86. 20. (with H. Niederreiter), Towers of global function fields with asymptotically many rational places and an improvement on the Gilbert-Varshamov bound, Math. Nachr., 195, 171-186 (1998). 21. (with H. Niederreiter), Global function fields with many rational places over the quinary field II, Acta Arith. 86, 277-188 (1998). 22. (with H. Niederreiter), Drinfeld modules of rank 1 and algebraic curves with many rational points, Monat. Math., Vol.127 (1999), 219-241. 23. (with K. Y. Lam), Sequences with almost perfect linear complexity and curves over finite fields, IEEE IT Inform. Theory, Vol.45 (1999), 1267-1270. 24. (with H. Niederreiter and K. Y. Lam), Constructions of algebraic geometry codes, IEEE IT Inform. Theory, Vol. 45 (1999), 1186-1193. 25. (with H. Niederreiter and K. Y. Lam), A new Construction of algebraic geometry codes, Appl. Algebra Engrg. Comm. Comput., Vol. 9 (1999), 373-381. 26. (with M. Huang), Some computational problems of cryptographic significance concerning elliptic curves over rings, Information and Computation, Vol. 151(1999), 92-99. 27. (with C. Ding and K. Y. Lam), Construction and enumeration of all binary duadic codes of length p^m, Fundamenta Informaticae, Vol. 38, No.1( 1999), 149--161. 28. (with H. Niederreiter), A counterexample to Perret's conjecture on infinite class field towers for global function fields, Finite Fields and Their Applications, 5(1999), 240-245. 29. (with H. Niederreiter, K. Y. Lam and C. Ding), Constructions of sequences with almost perfect linear complexity from curves over finite fields, Finite Fields and Their Applications, 5(1999), 301-313. 30. (with H. Niederreiter and K. Y. Lam), A generalization of algebraic geometry codes, IEEE Trans. on Inform. Theory, Vol. 45 (1999), 2498-2501. 31. (with A. Garcia, H. Stichtenoth), On subfields of the Hermitian function fields, Compositio Mathematica, Vol. 120 (2): (2000), 137-170. 32. (with Wang H. X. and Lam K. Y.), Constructions of authentication codes from algebraic curves over finite fields, IEEE Trans. Inform. Theory, Vol.46(2000), 886-892. 33. (with H. Niederreiter), A propagation rule of linear codes, Appl. Algebra Engrg. Comm. Comput., Vol.10(2000), 425-432. 34. (with Ling San), A class of linear codes with good parameters from algebraic curves, IEEE Trans. on Inform. Theory, Vol. 46(2000), 1527-1532. 35. (with Ling San), A class of linear codes with good parameters, IEEE Trans. on Inform. Theory, Vol. 46(2000), 2184-2188. 36. Multi-sequences with almost perfect linear complexity profile and function fields over finite fields, Journal of Complexity, Vol.16 (2000), 661-675. 37. (with C. S. Ding and H. Niederreiter), Some new codes from algebraic curves, IEEE Trans. Inform. Theory, Vol.46 (2000), 2638-2643. 38. (with Ling San and H. Niederreiter), Symmetric polynomials and some good codes, Finite Fields and Their Applications, 39. (with H. X. Wang), Explicit Constructions of perfect hash families from algebraic curves over finite fields, Journal of Combinatorial Theory - Series A, 93(2001), 112-124. 40. Algebraic geometry codes with asymptotic parameters better than the Gilbert-Vrashmov and the Tsfasman-Vladut-Zink bounds, IEEE Trans. Inform. Theory, 47(2001), 347-352. 41. (with H. Chan and S. Ling), Asymptotically good quantum codes exceeding the Ashikhmm-Litsyn-Tsfasman bound, IEEE IT Inform. Theory, Vol 47(2001), 2055-2058. 42. (with K. H. Leung and S. Ling), New binary linear codes from algebraic curves, IEEE Trans. on Inform. Theory, vol.48(2001),285-287. 43. (with Chen Hao), Improvements on parameters of one-point AG codes from Hermitian curves, IEEE Trans. on Inform. Theory, Vol. 48 (2002), 535-537. 44. (with C. S. Ding, T. Hellleseth and H. Niederreiter), The minimum distance of the duals of binary irreducible cyclic codes, IEEE Trans. on Information Theory, vol.48(2002), 2679-2689. 45. Asymptotic bounds on frameproof codes, IEEE Trans. on Information Theory, vol.48(2002), 2991-2995. 46. Constructions of codes from residue rings of polynomials, IEEE Trans. on Information Theory, vol.48(2002), 2995-2998. 47. (with H. Niederreiter), Constructions of digital nets, Acta Arith., 102(2002), 189-197. 48. (with V. Kumar and C. S. Ding), Low correlation, large linear span sequences from function fields, IEEE Trans. on Information Theory, vol.49(2003), 1439-1446. 49. ( with Ding). Several Classes of (2^m-1,w,2) Optical Orthogonal Codes, Discrete Applied Mathematics, 128 (2003), 103-120. 50. Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound, IEEE Trans. on Information Theory, vol.49(2003), 1653-1657. 51. (with F. W. Fu and S. Ling), New Lower Bounds and Constructions for Binary Codes Correcting Asymmetric Errors, IEEE Trans. on Information Theory, 49(2003), 3294-3299.55. (with C. S. Ding), Cyclotomic optical orthogonal codes of composite lengths, IEEE Trans. Communications, 52(2004), 263-268. 52. (with Ling San), Polyadic codes revisited, IEEE Trans. on Information Theory, 50(2004), 200-207. 53. Linear codes from narrow ray class groups of algebraic curves, IEEE Trans. on Information Theory, 50(2004), 541-543. 54. (with Y. Fang), A class of Polynomial codes, IEEE Trans. on Information Theory, to appear. 55. (with H. Niederreiter), Disjoint linear codes from algebraic function fields, IEEE Trans. on Information Theory, to appear.
1. (with K. Y. Lam and E. Okamoto, eds.), Advances in Cryptology - Asiacrypt'99, Lecture Notes in Computer Sciences, Vol. 1716, Springer, 1999. 2. (with H. Niederreiter), Rational points on curves over finite fields: Theory and Applications, LMS 285, Cambridge, 2001. 3. (with K. Y. Lam, I. Shparlinski and H. X. Wang, eds.), Cryptography and Computational Number Theory, Birkhauser, 2001. 4. (with Ling San), Coding Theory -- A Fisrt Course, Cambridge, 2004. 5. (with K. Q. Feng and H. Niederreiter, eds.), Coding, Cryptography and Combinatorics, Birkhauser, to appear. Publications in Refereed Proceedings of International Conferences 1. (with H. Niederreiter) , The algebraic-geometry approach to low-discrepancy sequences, Monte Carlo and Quasi-Monte Carlo Methods'96 (H. Niederreiter et al., eds.), Lecture Notes in Statistics, Vol. 127, 139-160, Springer, New York, 1997. (invited talk) 2. (with H. Niederreiter), Algebraic curves over finite fields with many rational points, in: Number Theory, K. Gyory, P. Petho and V. T. Sos (eds), W. de Gruyter, Berlin, 1998, 423-443. (invited talk) 3. (with H. Niederreiter), A general method of constructing global function fields with many rational places, in: Algorithmic Number Theory, Lecture Notes in Computer Science 1423, Springer, Berlin, 1998, 555-566. 4. (with H. Niederreiter), Global function fields with many rational places and their applications, Proceedings of Finite Fields Appl., Waterloo, Canada, Finite Fields: Theory, Applications, and Algorithms (R. C. Mullin and G. L. Mullen, eds.), Contemporary Math., Vol. 225, pp. 87-111, American Math. Soc., Providence, 1998. (invited talk) 5. (with H. Niederreiter), Nets, (t,s)-sequences and algebraic geometry, Pseudo- and Quasi-Random Point sets, (P. Hellekalek and G. Larcher, eds.), Lecture Notes in Statistics, Vol. 138, 267-362, Springer Verlag, New York, 1998. (invited chapter) 6. (with H. Niederreiter), Algebraic curves with many rational points over finite fields of characteristic 2, Number Theory in Progress ( K. Gyory, H. Iwaniec and J. Urbanowicz eds.), pp. 359-380, w. de Gruyter, Berlin, 1999. 7. (with D. Kohel and S. Ling), Explicit sequence expansions, Sequences and Applications (C. Ding, T. Helleseth, H. Niederreiter, eds.), pp-308-317, 1999, Springer, London. 8. (with K. Lam and Z. Wei), A class of explicit perfect multi- sequences, Advanced in Cryptology --Asiacrypt'99 (K. Y. Lam, E. Okamoto, C. P. Xing, eds.), Lecture Notes in Computer Science, Vol. 1716, pp. 299-305, Springer-Verlag, Berlin, 1999. 9. (with H. Niederreiter), Curve sequences with asymptotically many rational points, Proceedings of Curves and Applications, (M. D. Fried, ed.), Contemporary Math., Vol. 245, pp. 3-14, American Math. Society, Providence, RI, 1999. 10. (with H. Niederreiter), Algebraic curves over finite fields with many rational points and their applications, Number Theory (R.P. Bambah, V.C. Dumir, and R.J. Hans-Gill, eds.), pp. 287-300, Birkh"auser, Basel, 2000. (invited chapter) 11. (with H. Niederreiter), Applications of algebraic curves to constructions of codes and almost perfect sequences, Proceedings of the 5th Intenational Conference on Finite Fields and Applications, Springer-Verlag, pp.479-489, 2001. 12. (with R. Safavi-Naini, H. Wang), Linear Authentication Codes: Bounds and Constructions, Progress in Indocrypt 2001, C. Pandu Rangan and Cunsheng Ding (Eds.), Lecture Notes in Computer Science, vol 2247, 2001, 127--135. 13. Authentication codes and algebraic curves, Proceedings of the 3rd European Congress 14. Constructions of sequences from algebraic curves over finite feilds, Proceedings of SETA'01 (eds. T. Helleseth, V. Kumar and K. Yang), Springer, 88-100, 2002. (invited talk) 15. Introduction to algebraic geometry codes, in Coding Theory and Cryptography (ed. H. Niederreiter), Lecture Notes Series, Vol. 1, World Scientific, 435-446. (invited tutorial) |