Jianxing Yin

Publication Activity (10 Years)

Years Active: 1995-2016
Publications (10 Years): 3

Top Topics

Maximum Distance

Eigenvalue Problems

Error Correcting

Top Venues

Des. Codes Cryptogr.

IEEE Trans. Inf. Theory

Publications

Chengmin Wang, Jie Yan, Jianxing Yin
Resolvable generalized difference matrices: Existence and applications. Finite Fields Their Appl. 42 (2016)
Xizhao Luo, Jianxing Yin, Fei Yue
Multilength Optical Orthogonal Codes: New Upper Bounds and Optimal Constructions. IEEE Trans. Inf. Theory 61 (6) (2015)
Peipei Dai, Jianmin Wang, Jianxing Yin
Two series of equitable symbol weight codes meeting the Plotkin bound. Des. Codes Cryptogr. 74 (1) (2015)
Peipei Dai, Jianmin Wang, Jianxing Yin
Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property. Des. Codes Cryptogr. 71 (2) (2014)
Ce Shi, Jianxing Yin
Existence of super-simple OA $$_{\lambda }(3, 5, v)^{\prime }$$ s. Des. Codes Cryptogr. 72 (2) (2014)
Kun Wang, Jianxing Yin
Further results on the existence of nested orthogonal arrays. Des. Codes Cryptogr. 67 (2) (2013)
Yeow Meng Chee, Lijun Ji, Han Mao Kiah, Chengmin Wang, Jianxing Yin
Maximum Distance Separable Codes for Symbol-Pair Read Channels. IEEE Trans. Inf. Theory 59 (11) (2013)
Yeow Meng Chee, Lijun Ji, Han Mao Kiah, Chengmin Wang, Jianxing Yin
Maximum Distance Separable Codes for Symbol-Pair Read Channels CoRR (2012)
Lijun Ji, Yang Li, Jianxing Yin
Constructions of covering arrays of strength five. Des. Codes Cryptogr. 62 (2) (2012)
Danjun Huang, Weifan Wang, Jianxing Yin
A Note on General Neighbor-Distinguishing Total Coloring of Graphs. Ars Comb. 107 (2012)
Ce Shi, Yu Tang, Jianxing Yin
The equivalence between optimal detecting arrays and super-simple OAs. Des. Codes Cryptogr. 62 (2) (2012)
Jianxing Yin, Jianmin Wang, Lijun Ji, Yang Li
On the existence of orthogonal arrays OA(3, 5, 4n+2). J. Comb. Theory, Ser. A 118 (1) (2011)
Jianxing Yin, Xiaoke Yang, Yang Li
Some 20-regular CDP(5, 1;20u) and their applications. Finite Fields Their Appl. 17 (4) (2011)
Yeow Meng Chee, Gennian Ge, Lijun Ji, San Ling, Jianxing Yin
List decodability at small radii. Des. Codes Cryptogr. 61 (2) (2011)
Yeow Meng Chee, Gennian Ge, Lijun Ji, San Ling, Jianxing Yin
List Decodability at Small Radii CoRR (2010)
Lijun Ji, Jianxing Yin
Constructions of new orthogonal arrays and covering arrays of strength three. J. Comb. Theory, Ser. A 117 (3) (2010)
Yeow Meng Chee, Alan C. H. Ling, Jianxing Yin
Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization CoRR (2010)
Jianmin Wang, Xiuling Shan, Jianxing Yin
On constructions for optimal two-dimensional optical orthogonal codes. Des. Codes Cryptogr. 54 (1) (2010)
Jianmin Wang, Jianxing Yin
Two-dimensional optical orthogonal codes and semicyclic group divisible designs. IEEE Trans. Inf. Theory 56 (5) (2010)
Yeow Meng Chee, Alan C. H. Ling, Jianxing Yin
Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization. IEEE Trans. Inf. Theory 56 (11) (2010)
Bin Wen, Jianmin Wang, Jianxing Yin
Optimal grid holey packings with block size 3 and 4. Des. Codes Cryptogr. 52 (1) (2009)
Yang Li, Lijun Ji, Jianxing Yin
Covering arrays of strength 3 and 4 from holey difference matrices. Des. Codes Cryptogr. 50 (3) (2009)
Jianxing Yin, Chengmin Wang
Kirkman covering designs with even-sized holes. Discret. Math. 309 (6) (2009)
Jie Yan, Jianxing Yin
A class of optimal constant composition codes from GDRPs. Des. Codes Cryptogr. 50 (1) (2009)
Cunsheng Ding, Jianxing Yin
Constructions of almost difference families. Discret. Math. 308 (21) (2008)
Jianxing Yin, Jie Yan, Chengmin Wang
Generalized balanced tournament designs and related codes. Des. Codes Cryptogr. 46 (2) (2008)
Cunsheng Ding, Jianxing Yin
Sets of Optimal Frequency-Hopping Sequences. IEEE Trans. Inf. Theory 54 (8) (2008)
Jianxing Yin, Xiuling Shan, Zihong Tian
Constructions of partitioned difference families. Eur. J. Comb. 29 (6) (2008)
Jie Yan, Jianxing Yin
. Discret. Appl. Math. 156 (14) (2008)
Cunsheng Ding, Jianxing Yin
Signal Sets From Functions With Optimum Nonlinearity. IEEE Trans. Commun. 55 (5) (2007)
Cunsheng Ding, Jianxing Yin
A Construction of Optimal Constant Composition Codes. Des. Codes Cryptogr. 40 (2) (2006)
Jianmin Wang, Jianxing Yin
Constructions for Perfect 5-Deletion-Correcting Codes of Length 7. IEEE Trans. Inf. Theory 52 (8) (2006)
Cunsheng Ding, Jianxing Yin
Combinatorial constructions of optimal constant-composition codes. IEEE Trans. Inf. Theory 51 (10) (2005)
Kai-Tai Fang, Yu Tang, Jianxing Yin
-discrepancy and constructions of symmetrical uniform designs. J. Complex. 21 (5) (2005)
Jianxing Yin
Cyclic Difference Packing and Covering Arrays. Des. Codes Cryptogr. 37 (2) (2005)
Cunsheng Ding, Jianxing Yin
Algebraic constructions of constant composition codes. IEEE Trans. Inf. Theory 51 (4) (2005)
Kai-Tai Fang, Xuan Lu, Yu Tang, Jianxing Yin
Constructions of uniform designs by using resolvable packings and coverings. Discret. Math. 274 (1-3) (2004)
Yanxun Chang, Jianxing Yin
Further results on optimal optical orthogonal codes with weight 4. Discret. Math. 279 (1-3) (2004)
Frank E. Bennett, Charles J. Colbourn, Ruizhong Wei, Jianxing Yin
Preface. Discret. Math. 279 (1-3) (2004)
Nabil Shalaby, Jianxing Yin
Maximum Complementary P3-Packings of Kv. Ars Comb. 66 (2003)
Jianxing Yin
A new proof of a Colbourn-Rosa problem. Discret. Math. 261 (1-3) (2003)
Jianxing Yin
Constructions of difference covering arrays. J. Comb. Theory, Ser. A 104 (2) (2003)
Jianxing Yin
A survey on maximum distance holey packings. Discret. Appl. Math. 121 (1-3) (2002)
Nabil Shalaby, Jianmin Wang, Jianxing Yin
Existence of Perfect 4-Deletion-Correcting Codes with Length Six. Des. Codes Cryptogr. 27 (1-2) (2002)
Jianxing Yin
A General Construction for Optimal Cyclic Packing Designs. J. Comb. Theory, Ser. A 97 (2) (2002)
Ryoh Fuji-Hara, Ying Miao, Jianxing Yin
, 4, 1) Optical Orthogonal Codes. SIAM J. Discret. Math. 14 (2) (2001)
Ahmed M. Assaf, Nabil Shalaby, Jianxing Yin
Directed packing and covering designs with block size four. Discret. Math. 238 (1-3) (2001)
Jianxing Yin
A Combinatorial Construction for Perfect Deletion-Correcting Codes. Des. Codes Cryptogr. 23 (1) (2001)
Gennian Ge, Jianxing Yin
Constructions for optimal (v, 4, 1) optical orthogonal codes. IEEE Trans. Inf. Theory 47 (7) (2001)
Katherine Heinrich, Jianxing Yin
On group divisible covering designs. Discret. Math. 202 (1-3) (1999)
Frank E. Bennett, Jianxing Yin, Hantao Zhang, R. Julian R. Abel
Perfect Mendelsohn Packing Designs with Block Size Five. Des. Codes Cryptogr. 14 (1) (1998)
Charles J. Colbourn, Jianxing Yin
On Directed Incomplete Transversal Designs with Block Size Five. Ars Comb. 50 (1998)
Nabil Shalaby, Jianxing Yin
Nested Optimal -Packings and -Coverings of Pairs with Triples. Des. Codes Cryptogr. 15 (3) (1998)
Jianxing Yin
Some combinatorial constructions for optical orthogonal codes. Discret. Math. 185 (1-3) (1998)
Ahmed M. Assaf, Nabil Shalaby, Jianxing Yin
Directed packings with block size 5. Australas. J Comb. 17 (1998)
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 Cryptogr. 10 (3) (1997)
Ahmed M. Assaf, A. Mahmoodi, Nabil Shalaby, Jianxing Yin
Directed packings with block size 5 and odd v. Australas. J Comb. 13 (1996)
Nabil Shalaby, Jianxing Yin
Directed Packings with Block Size 5 and Even v. Des. Codes Cryptogr. 6 (2) (1995)