The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yanxun Chang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yanxun Chang
    The spectra for two classes of graph designs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:65, n:, pp:- [Journal]
  2. Yanxun Chang, Guihua Yang, Qingde Kang
    The spectrum of self-converse MTS. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:44, n:, pp:- [Journal]
  3. Xin Wang, Yanxun Chang
    The spectrum for self-converse directed BIBDs with block size four. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:75, n:, pp:- [Journal]
  4. Yanxun Chang
    A construction of holey perfect Mendelsohn designs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:47, n:, pp:- [Journal]
  5. Yanxun Chang, Gennian Ge
    Some new large sets of KTS(v). [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:51, n:, pp:- [Journal]
  6. Yanxun Chang, Ying Miao
    General Constructions for Double Group Divisible Designs and Double Frames. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2002, v:26, n:1-3, pp:155-168 [Journal]
  7. Tao Feng, Yanxun Chang
    Existence of Z-cyclic 3PTWh (p) for any Prime p congruent 1 (mod 4). [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:39, n:1, pp:39-49 [Journal]
  8. Yanxun Chang, Cunsheng Ding
    Constructions of External Difference Families and Disjoint Difference Families. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:40, n:2, pp:167-185 [Journal]
  9. Frank E. Bennett, Yanxun Chang, Gennian Ge, Malcolm Greig
    Existence of (v, {5, wstar}, 1)-PBDs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:279, n:1-3, pp:61-105 [Journal]
  10. Yanxun Chang
    The existence of resolvable BIBD with k even and lambda=1. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:9-23 [Journal]
  11. Yanxun Chang, Giovanni Lo Faro
    Existence of DBIBDs with block size not divided by four. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:27-40 [Journal]
  12. Yanxun Chang, Giovanni Lo Faro
    The existence of directed BIBDs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:272, n:2-3, pp:155-169 [Journal]
  13. Yanxun Chang, Ying Miao
    Constructions for optimal optical orthogonal codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:127-139 [Journal]
  14. Yanxun Chang, Jianxing Yin
    Further results on optimal optical orthogonal codes with weight 4. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:279, n:1-3, pp:135-151 [Journal]
  15. Wenjie He, Yufa Shen, Lixin Wang, Yanxun Chang, Qingde Kang, Xinkai Yu
    The integral sum number of complete bipartite graphs Kr, s. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:137-146 [Journal]
  16. Jianguo Lei, Qingde Kang, Yanxun Chang
    The spectrum for large set of disjoint incomplete Latin squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:238, n:1-3, pp:89-98 [Journal]
  17. Yunqing Xu, Yanxun Chang
    On the spectrum of r-self-orthogonal Latin squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:279, n:1-3, pp:479-498 [Journal]
  18. Yunqing Xu, Yanxun Chang
    Existence of r-self-orthogonal Latin squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:124-146 [Journal]
  19. Jing Zhang, Yanxun Chang
    The spectrum of cyclic BSEC with block size three. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:305, n:1-3, pp:312-322 [Journal]
  20. Xin Wang, Yanxun Chang
    Self-Converse Directed BIBDs with Block Size Four. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:4, pp:567-575 [Journal]
  21. Yanxun Chang, Giovanni Lo Faro
    Intersection Numbers of Kirkman Triple Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:86, n:2, pp:348-361 [Journal]
  22. Qingde Kang, Yanxun Chang
    A Completion of the Spectrum for Large Sets of Disjoint Transitive Triple Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:60, n:2, pp:287-294 [Journal]
  23. Yanxun Chang, Ryoh Fuji-Hara, Ying Miao
    Combinatorial constructions of optimal optical orthogonal codes with weight 4. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:5, pp:1283-1292 [Journal]
  24. Jingjing Gao, Yanxun Chang
    New upper bounds for impulse radio sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:5, pp:2255-2260 [Journal]
  25. Siu Lun Ma, Yanxun Chang
    A New Class of Optimal Optical Orthogonal Codes With Weight Five. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:8, pp:1848-1850 [Journal]
  26. Qingde Kang, Yanxun Chang
    Further results about large sets of disjoint Mendelsohn triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:118, n:1-3, pp:263-268 [Journal]

  27. (K3+e, lambda)-group divisible designs of type gtu1. [Citation Graph (, )][DBLP]


  28. New results on large sets of Kirkman triple systems. [Citation Graph (, )][DBLP]


  29. Tight blocking sets in some maximum packings of lambdaKn. [Citation Graph (, )][DBLP]


  30. Determining the spectrum of Meta(K4+e>K4, lambda) for any lambda. [Citation Graph (, )][DBLP]


  31. The spectrum for large sets of pure Mendelsohn triple systems. [Citation Graph (, )][DBLP]


  32. Two types of switchable lambda-fold (K4-e)-designs. [Citation Graph (, )][DBLP]


  33. Frame self-orthogonal Mendelsohn triple systems of type hn. [Citation Graph (, )][DBLP]


  34. Existence of good large sets of Steiner triple systems. [Citation Graph (, )][DBLP]


  35. Transitive resolvable idempotent quasigroups and large sets of resolvable Mendelsohn triple systems. [Citation Graph (, )][DBLP]


  36. Existence of r-fold perfect (v, K, 1)-Mendelsohn designs with K SUBSET OF OR EQUAL TO {4, 5, 6, 7}. [Citation Graph (, )][DBLP]


  37. Further results on (v, 4, 1)-perfect difference families. [Citation Graph (, )][DBLP]


  38. The triangle intersection numbers of a pair of disjoint S(2, 4, v)s. [Citation Graph (, )][DBLP]


  39. The triangle intersection problem for S(2, 4, v) designs. [Citation Graph (, )][DBLP]


Search in 0.022secs, Finished in 0.023secs
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