The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Chaoping Xing: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Harald Niederreiter, Chaoping Xing
    A General Method of Constructing Global Function Fields. [Citation Graph (0, 0)][DBLP]
    ANTS, 1998, pp:555-566 [Conf]
  2. Chaoping Xing, Kwok-Yan Lam, Zhenghong Wei
    A Class of Explicit Perfect Multi-sequences. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1999, pp:299-305 [Conf]
  3. Reihaneh Safavi-Naini, Huaxiong Wang, Chaoping Xing
    Linear Authentication Codes: Bounds and Constructions. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2001, pp:127-135 [Conf]
  4. Josef Pieprzyk, Huaxiong Wang, Chaoping Xing
    Multiple-Time Signature Schemes against Adaptive Chosen Message Attacks. [Citation Graph (0, 0)][DBLP]
    Selected Areas in Cryptography, 2003, pp:88-100 [Conf]
  5. Harald Niederreiter, Chaoping Xing
    A Propagation Rule for Linear Codes. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2000, v:10, n:6, pp:425-432 [Journal]
  6. Harald Niederreiter, Chaoping Xing, Kwok-Yan Lam
    A New Construction of Algebraic Geometry Codes. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1999, v:9, n:5, pp:373-381 [Journal]
  7. Cunsheng Ding, Chaoping Xing
    Several Classes of (2m-1, w, 2) Optical Orthogonal Codes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:128, n:1, pp:103-120 [Journal]
  8. Fang-Wei Fu, San Ling, Chaoping Xing
    On the variance of average distance of subsets in the Hamming space. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:3, pp:465-478 [Journal]
  9. San Ling, Chaoping Xing, Ferruh Özbudak
    An explicit class of codes with good parameters and their duals. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:2, pp:346-356 [Journal]
  10. Cunsheng Ding, Kwok-Yan Lam, Chaoping Xing
    Construction and Enumeration of All Binary Duadic Codes of Length pm. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:1-2, pp:149-161 [Journal]
  11. Ming-Deh A. Huang, Chaoping Xing
    Some Computational Problems of Cryptographic Significance Concerning Elliptic Curves over Rings. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:151, n:1-2, pp:92-99 [Journal]
  12. Cunsheng Ding, Chaoping Xing
    Special issue on cryptography and coding theory. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2004, v:20, n:2-3, pp:133-0 [Journal]
  13. Cunsheng Ding, Chaoping Xing
    A short biography of Harald Niederreiter. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2004, v:20, n:2-3, pp:134-136 [Journal]
  14. Chaoping Xing
    Multi-sequences with Almost Perfect Linear Complexity Profile and Function Fields over Finite Fields. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2000, v:16, n:4, pp:661-675 [Journal]
  15. Huaxiong Wang, Chaoping Xing
    Explicit Constructions of Perfect Hash Families from Algebraic Curves over Finite Fields. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:93, n:1, pp:112-124 [Journal]
  16. Cunsheng Ding, Chaoping Xing
    Cyclotomic Optical Orthogonal Codes of Composite Lengths. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2004, v:52, n:2, pp:263-268 [Journal]
  17. Hao Chen, San Ling, Chaoping Xing
    Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:2055-2058 [Journal]
  18. Hao Chen, San Ling, Chaoping Xing
    Quantum codes from concatenated algebraic-geometric codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:8, pp:2915-2920 [Journal]
  19. Cunsheng Ding, Tor Helleseth, Harald Niederreiter, Chaoping Xing
    The minimum distance of the duals of binary irreducible cyclic codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:10, pp:2679-2689 [Journal]
  20. Cunsheng Ding, Harald Niederreiter, Chaoping Xing
    Some new codes from algebraic curves. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2638-2642 [Journal]
  21. Keqin Feng, San Ling, Chaoping Xing
    Asymptotic bounds on quantum codes from algebraic geometry codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:3, pp:986-991 [Journal]
  22. Fang-Wei Fu, San Ling, Chaoping Xing
    New lower bounds and constructions for binary codes correcting asymmetric errors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:12, pp:3294-3299 [Journal]
  23. Ka Hin Leung, San Ling, Chaoping Xing
    New binary linear codes from algebraic curves. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:1, pp:285-287 [Journal]
  24. San Ling, Chaoping Xing
    Polyadic codes revisited. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:1, pp:200-207 [Journal]
  25. Harald Niederreiter, Chaoping Xing
    Disjoint Linear Codes From Algebraic Function Fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:9, pp:2174-2177 [Journal]
  26. Henning Stichtenoth, Chaoping Xing
    Excellent nonlinear codes from algebraic function fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:4044-4046 [Journal]
  27. Huaxiong Wang, Chaoping Xing, Reihaneh Safavi-Naini
    Linear authentication codes: bounds and constructions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:4, pp:866-872 [Journal]
  28. Chaoping Xing
    Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:1, pp:347-352 [Journal]
  29. Chaoping Xing
    Asymptotic bounds on frameproof codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:11, pp:2991-2995 [Journal]
  30. Chaoping Xing
    Constructions of codes from residue rings of polynomials. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:11, pp:2995-2997 [Journal]
  31. Chaoping Xing
    Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:7, pp:1653-1657 [Journal]
  32. Chaoping Xing
    Linear codes from narrow ray class groups of algebraic curves. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:20, n:3, pp:541-543 [Journal]
  33. Chaoping Xing
    Goppa geometric codes achieving the Gilbert-Varshamov bound. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:259-264 [Journal]
  34. Chaoping Xing
    On Automorphism Groups of the Hermitian Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:1629-1635 [Journal]
  35. Chaoping Xing, Hao Chen
    Improvements on parameters of one-point AG Codes from Hermitian curves. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:2, pp:535-537 [Journal]
  36. Chaoping Xing, Yang Fang
    A class of polynomial codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:5, pp:884-887 [Journal]
  37. Chaoping Xing, P. Vijay Kumar, Cunsheng Ding
    Low-correlation, large linear span sequences from function fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:6, pp:1439-1446 [Journal]
  38. Chaoping Xing, San Ling
    A class of linear codes with good parameters from algebraic curves. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1527-1532 [Journal]
  39. Chaoping Xing, San Ling
    A class of linear codes with good parameters. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:6, pp:2184-2188 [Journal]
  40. Chaoping Xing, Jie Ling
    A construction of binary constant-weight codes from algebraic curves over finite fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:10, pp:3674-3678 [Journal]
  41. Chaoping Xing, Kwok-Yan Lam
    Sequences with Almost Perfect Linear Complexity Profiles and Curves Over Finite Fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:4, pp:1267-1270 [Journal]
  42. Chaoping Xing, Harald Niederreiter, Kwok-Yan Lam
    Constructions of Algebraic-Geometry Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:4, pp:1186-1193 [Journal]
  43. Chaoping Xing, Harald Niederreiter, Kwok-Yan Lam
    A generalization of algebraic-geometry codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2498-2501 [Journal]
  44. Chaoping Xing, Huaxiong Wang, Kwok-Yan Lam
    Constructions of authentication codes from algebraic curves over finite fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:886-892 [Journal]

  45. Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field. [Citation Graph (, )][DBLP]


  46. Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes. [Citation Graph (, )][DBLP]


  47. Function-field codes. [Citation Graph (, )][DBLP]


  48. Cyclic Codes and Sequences from a Class of Dembowski-Ostrom Functions [Citation Graph (, )][DBLP]


  49. Cyclic Codes and Sequences from Kasami-Welch Functions [Citation Graph (, )][DBLP]


  50. New Constant-Weight Codes from Propagation Rules [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002