| 2009 |
|---|
| 33 | EE | Jie Yan,
Jianxing Yin:
A class of optimal constant composition codes from GDRPs.
Des. Codes Cryptography 50(1): 61-76 (2009) |
| 32 | EE | Yang Li,
Lijun Ji,
Jianxing Yin:
Covering arrays of strength 3 and 4 from holey difference matrices.
Des. Codes Cryptography 50(3): 339-350 (2009) |
| 31 | EE | Bin Wen,
Jianmin Wang,
Jianxing Yin:
Optimal grid holey packings with block size 3 and 4.
Des. Codes Cryptography 52(1): 107-124 (2009) |
| 2008 |
|---|
| 30 | EE | Jianxing Yin,
Jie Yan,
Chengmin Wang:
Generalized balanced tournament designs and related codes.
Des. Codes Cryptography 46(2): 211-230 (2008) |
| 29 | EE | Jie Yan,
Jianxing Yin:
Constructions of optimal GDRP(n, lambda;v)'s of type lambda1µm-1.
Discrete Applied Mathematics 156(14): 2666-2678 (2008) |
| 28 | EE | Cunsheng Ding,
Jianxing Yin:
Constructions of almost difference families.
Discrete Mathematics 308(21): 4941-4954 (2008) |
| 27 | EE | Jianxing Yin,
Xiuling Shan,
Zihong Tian:
Constructions of partitioned difference families.
Eur. J. Comb. 29(6): 1507-1519 (2008) |
| 26 | EE | Cunsheng Ding,
Jianxing Yin:
Sets of Optimal Frequency-Hopping Sequences.
IEEE Transactions on Information Theory 54(8): 3741-3745 (2008) |
| 2006 |
|---|
| 25 | EE | Cunsheng Ding,
Jianxing Yin:
A Construction of Optimal Constant Composition Codes.
Des. Codes Cryptography 40(2): 157-165 (2006) |
| 2005 |
|---|
| 24 | EE | Jianxing Yin:
Cyclic Difference Packing and Covering Arrays.
Des. Codes Cryptography 37(2): 281-292 (2005) |
| 23 | EE | Cunsheng Ding,
Jianxing Yin:
Combinatorial constructions of optimal constant-composition codes.
IEEE Transactions on Information Theory 51(10): 3671-3674 (2005) |
| 22 | EE | Cunsheng Ding,
Jianxing Yin:
Algebraic constructions of constant composition codes.
IEEE Transactions on Information Theory 51(4): 1585-1589 (2005) |
| 21 | EE | Kai-Tai Fang,
Yu Tang,
Jianxing Yin:
Lower bounds for wrap-around L2-discrepancy and constructions of symmetrical uniform designs.
J. Complexity 21(5): 757-771 (2005) |
| 2004 |
|---|
| 20 | EE | Kai-Tai Fang,
Xuan Lu,
Yu Tang,
Jianxing Yin:
Constructions of uniform designs by using resolvable packings and coverings.
Discrete Mathematics 274(1-3): 25-40 (2004) |
| 19 | EE | Frank E. Bennett,
Charles J. Colbourn,
Ruizhong Wei,
Jianxing Yin:
Preface.
Discrete Mathematics 279(1-3): 1-2 (2004) |
| 18 | EE | Yanxun Chang,
Jianxing Yin:
Further results on optimal optical orthogonal codes with weight 4.
Discrete Mathematics 279(1-3): 135-151 (2004) |
| 2003 |
|---|
| 17 | | Nabil Shalaby,
Jianxing Yin:
Maximum Complementary P3-Packings of Kv.
Ars Comb. 66: (2003) |
| 16 | EE | Jianxing Yin:
A new proof of a Colbourn-Rosa problem.
Discrete Mathematics 261(1-3): 451-458 (2003) |
| 15 | EE | Jianxing Yin:
Constructions of difference covering arrays.
J. Comb. Theory, Ser. A 104(2): 327-339 (2003) |
| 2002 |
|---|
| 14 | | Nabil Shalaby,
Jianmin Wang,
Jianxing Yin:
Existence of Perfect 4-Deletion-Correcting Codes with Length Six.
Des. Codes Cryptography 27(1-2): 145-156 (2002) |
| 13 | | Jianxing Yin:
A survey on maximum distance holey packings.
Discrete Applied Mathematics 121(1-3): 279-294 (2002) |
| 12 | EE | Jianxing Yin:
A General Construction for Optimal Cyclic Packing Designs.
J. Comb. Theory, Ser. A 97(2): 272-284 (2002) |
| 2001 |
|---|
| 11 | | Jianxing Yin:
A Combinatorial Construction for Perfect Deletion-Correcting Codes.
Des. Codes Cryptography 23(1): 99-110 (2001) |
| 10 | EE | Ahmed M. Assaf,
Nabil Shalaby,
Jianxing Yin:
Directed packing and covering designs with block size four.
Discrete Mathematics 238(1-3): 3-17 (2001) |
| 9 | | Gennian Ge,
Jianxing Yin:
Constructions for optimal (v, 4, 1) optical orthogonal codes.
IEEE Transactions on Information Theory 47(7): 2998-3004 (2001) |
| 8 | EE | Ryoh Fuji-Hara,
Ying Miao,
Jianxing Yin:
Optimal (9v, 4, 1) Optical Orthogonal Codes.
SIAM J. Discrete Math. 14(2): 256-266 (2001) |
| 1999 |
|---|
| 7 | EE | Katherine Heinrich,
Jianxing Yin:
On group divisible covering designs.
Discrete Mathematics 202(1-3): 101-112 (1999) |
| 1998 |
|---|
| 6 | | Charles J. Colbourn,
Jianxing Yin:
On Directed Incomplete Transversal Designs with Block Size Five.
Ars Comb. 50: (1998) |
| 5 | | Frank E. Bennett,
Jianxing Yin,
Hantao Zhang,
R. Julian R. Abel:
Perfect Mendelsohn Packing Designs with Block Size Five.
Des. Codes Cryptography 14(1): 5-22 (1998) |
| 4 | | Nabil Shalaby,
Jianxing Yin:
Nested Optimal -Packings and -Coverings of Pairs with Triples.
Des. Codes Cryptography 15(3): 271-278 (1998) |
| 3 | EE | Jianxing Yin:
Some combinatorial constructions for optical orthogonal codes.
Discrete Mathematics 185(1-3): 201-219 (1998) |
| 1997 |
|---|
| 2 | | R. Julian R. Abel,
Charles J. Colbourn,
Jianxing Yin,
Hantao Zhang:
Existence of Incomplete Transversal Designs with Block Size Five and Any Index lambda.
Des. Codes Cryptography 10(3): 275-307 (1997) |
| 1995 |
|---|
| 1 | | Nabil Shalaby,
Jianxing Yin:
Directed Packings with Block Size 5 and Even v.
Des. Codes Cryptography 6(2): 133-142 (1995) |
