The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jianxing Yin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Charles J. Colbourn, Jianxing Yin
    On Directed Incomplete Transversal Designs with Block Size Five. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:50, n:, pp:- [Journal]
  2. Nabil Shalaby, Jianxing Yin
    Maximum Complementary P3-Packings of Kv. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:66, n:, pp:- [Journal]
  3. Jianxing Yin
    A survey on maximum distance holey packings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:121, n:1-3, pp:279-294 [Journal]
  4. R. Julian R. Abel, Charles J. Colbourn, Jianxing Yin, Hantao Zhang
    Existence of Incomplete Transversal Designs with Block Size Five and Any Index lambda. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1997, v:10, n:3, pp:275-307 [Journal]
  5. Frank E. Bennett, Jianxing Yin, Hantao Zhang, R. Julian R. Abel
    Perfect Mendelsohn Packing Designs with Block Size Five. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:14, n:1, pp:5-22 [Journal]
  6. Nabil Shalaby, Jianmin Wang, Jianxing Yin
    Existence of Perfect 4-Deletion-Correcting Codes with Length Six. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2002, v:27, n:1-2, pp:145-156 [Journal]
  7. Nabil Shalaby, Jianxing Yin
    Directed Packings with Block Size 5 and Even v. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1995, v:6, n:2, pp:133-142 [Journal]
  8. Nabil Shalaby, Jianxing Yin
    Nested Optimal -Packings and -Coverings of Pairs with Triples. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1998, v:15, n:3, pp:271-278 [Journal]
  9. Jianxing Yin
    A Combinatorial Construction for Perfect Deletion-Correcting Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:23, n:1, pp:99-110 [Journal]
  10. Jianxing Yin
    Cyclic Difference Packing and Covering Arrays. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:37, n:2, pp:281-292 [Journal]
  11. Cunsheng Ding, Jianxing Yin
    A Construction of Optimal Constant Composition Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:40, n:2, pp:157-165 [Journal]
  12. Ahmed M. Assaf, Nabil Shalaby, Jianxing Yin
    Directed packing and covering designs with block size four. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:238, n:1-3, pp:3-17 [Journal]
  13. Frank E. Bennett, Charles J. Colbourn, Ruizhong Wei, Jianxing Yin
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:279, n:1-3, pp:1-2 [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. Kai-Tai Fang, Xuan Lu, Yu Tang, Jianxing Yin
    Constructions of uniform designs by using resolvable packings and coverings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:274, n:1-3, pp:25-40 [Journal]
  16. Jianxing Yin
    A new proof of a Colbourn-Rosa problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:451-458 [Journal]
  17. Kai-Tai Fang, Yu Tang, Jianxing Yin
    Lower bounds for wrap-around L2-discrepancy and constructions of symmetrical uniform designs. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:5, pp:757-771 [Journal]
  18. Jianxing Yin
    A General Construction for Optimal Cyclic Packing Designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2002, v:97, n:2, pp:272-284 [Journal]
  19. Jianxing Yin
    Constructions of difference covering arrays. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:104, n:2, pp:327-339 [Journal]
  20. Ryoh Fuji-Hara, Ying Miao, Jianxing Yin
    Optimal (9v, 4, 1) Optical Orthogonal Codes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:2, pp:256-266 [Journal]
  21. Cunsheng Ding, Jianxing Yin
    Algebraic constructions of constant composition codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:4, pp:1585-1589 [Journal]
  22. Cunsheng Ding, Jianxing Yin
    Combinatorial constructions of optimal constant-composition codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:10, pp:3671-3674 [Journal]
  23. Gennian Ge, Jianxing Yin
    Constructions for optimal (v, 4, 1) optical orthogonal codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2998-3004 [Journal]
  24. Katherine Heinrich, Jianxing Yin
    On group divisible covering designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:202, n:1-3, pp:101-112 [Journal]
  25. Jianxing Yin
    Some combinatorial constructions for optical orthogonal codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:185, n:1-3, pp:201-219 [Journal]

  26. Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization [Citation Graph (, )][DBLP]


  27. Constructions of optimal GDRP(n, lambda;v)'s of type lambda1µm-1. [Citation Graph (, )][DBLP]


  28. Generalized balanced tournament designs and related codes. [Citation Graph (, )][DBLP]


  29. A class of optimal constant composition codes from GDRPs. [Citation Graph (, )][DBLP]


  30. Covering arrays of strength 3 and 4 from holey difference matrices. [Citation Graph (, )][DBLP]


  31. Optimal grid holey packings with block size 3 and 4. [Citation Graph (, )][DBLP]


  32. On constructions for optimal two-dimensional optical orthogonal codes. [Citation Graph (, )][DBLP]


  33. Constructions of almost difference families. [Citation Graph (, )][DBLP]


  34. Kirkman covering designs with even-sized holes. [Citation Graph (, )][DBLP]


  35. Constructions of partitioned difference families. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
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