Directed Packings with Block Size 5 and Even v. - Nabil Shalaby; Jianxing Yin (Des. Codes Cryptogr., 1995)

Directed packings with block size 5 and odd v. - Ahmed M. Assaf; A. Mahmoodi; Nabil Shalaby; Jianxing Yin (Australas. J Comb., 1996)

Existence of Incomplete Transversal Designs with Block Size Five and Any Index lambda. - R. Julian R. Abel; Charles J. Colbourn; Jianxing Yin; Hantao Zhang 001 (Des. Codes Cryptogr., 1997)

Directed packings with block size 5. - Ahmed M. Assaf; Nabil Shalaby; Jianxing Yin (Australas. J Comb., 1998)

On Directed Incomplete Transversal Designs with Block Size Five. - Charles J. Colbourn; Jianxing Yin (Ars Comb., 1998)

Perfect Mendelsohn Packing Designs with Block Size Five. - Frank E. Bennett; Jianxing Yin; Hantao Zhang 001; R. Julian R. Abel (Des. Codes Cryptogr., 1998)

Nested Optimal -Packings and -Coverings of Pairs with Triples. - Nabil Shalaby; Jianxing Yin (Des. Codes Cryptogr., 1998)

Some combinatorial constructions for optical orthogonal codes. - Jianxing Yin (Discret. Math., 1998)

On group divisible covering designs. - Katherine Heinrich; Jianxing Yin (Discret. Math., 1999)

A Combinatorial Construction for Perfect Deletion-Correcting Codes. - Jianxing Yin (Des. Codes Cryptogr., 2001)

Directed packing and covering designs with block size four. - Ahmed M. Assaf; Nabil Shalaby; Jianxing Yin (Discret. Math., 2001)

Optimal (9v, 4, 1) Optical Orthogonal Codes. - Ryoh Fuji-Hara; Ying Miao 001; Jianxing Yin (SIAM J. Discret. Math., 2001)

Constructions for optimal (v, 4, 1) optical orthogonal codes. - Gennian Ge; Jianxing Yin (IEEE Trans. Inf. Theory, 2001)

A survey on maximum distance holey packings. - Jianxing Yin (Discret. Appl. Math., 2002)

Existence of Perfect 4-Deletion-Correcting Codes with Length Six. - Nabil Shalaby; Jianmin Wang 003; Jianxing Yin (Des. Codes Cryptogr., 2002)

A General Construction for Optimal Cyclic Packing Designs. - Jianxing Yin (J. Comb. Theory A, 2002)

Maximum Complementary P3-Packings of Kv. - Nabil Shalaby; Jianxing Yin (Ars Comb., 2003)

A new proof of a Colbourn-Rosa problem. - Jianxing Yin (Discret. Math., 2003)

Constructions of difference covering arrays. - Jianxing Yin (J. Comb. Theory A, 2003)

Preface. - Frank E. Bennett; Charles J. Colbourn; Ruizhong Wei; Jianxing Yin (Discret. Math., 2004)

Further results on optimal optical orthogonal codes with weight 4. - Yanxun Chang; Jianxing Yin (Discret. Math., 2004)

Constructions of uniform designs by using resolvable packings and coverings. - Kai-Tai Fang; Xuan Lu; Yu Tang; Jianxing Yin (Discret. Math., 2004)

Cyclic Difference Packing and Covering Arrays. - Jianxing Yin (Des. Codes Cryptogr., 2005)

Lower bounds for wrap-around L2-discrepancy and constructions of symmetrical uniform designs. - Kai-Tai Fang; Yu Tang; Jianxing Yin (J. Complex., 2005)

Algebraic constructions of constant composition codes. - Cunsheng Ding; Jianxing Yin (IEEE Trans. Inf. Theory, 2005)

Combinatorial constructions of optimal constant-composition codes. - Cunsheng Ding; Jianxing Yin (IEEE Trans. Inf. Theory, 2005)

A Construction of Optimal Constant Composition Codes. - Cunsheng Ding; Jianxing Yin (Des. Codes Cryptogr., 2006)

Constructions for Perfect 5-Deletion-Correcting Codes of Length 7. - Jianmin Wang; Jianxing Yin (IEEE Trans. Inf. Theory, 2006)

Signal Sets From Functions With Optimum Nonlinearity. - Cunsheng Ding; Jianxing Yin (IEEE Trans. Commun., 2007)

Constructions of optimal GDRP(n, lambda;v)'s of type lambda1µm-1. - Jie Yan; Jianxing Yin (Discret. Appl. Math., 2008)

Generalized balanced tournament designs and related codes. - Jianxing Yin; Jie Yan; Chengmin Wang (Des. Codes Cryptogr., 2008)

Constructions of almost difference families. - Cunsheng Ding; Jianxing Yin (Discret. Math., 2008)

Constructions of partitioned difference families. - Jianxing Yin; Xiuling Shan; Zihong Tian (Eur. J. Comb., 2008)

Sets of Optimal Frequency-Hopping Sequences. - Cunsheng Ding; Jianxing Yin (IEEE Trans. Inf. Theory, 2008)

Covering arrays of strength 3 and 4 from holey difference matrices. - Yang Li; Lijun Ji; Jianxing Yin (Des. Codes Cryptogr., 2009)

Optimal grid holey packings with block size 3 and 4. - Bin Wen; Jianmin Wang 003; Jianxing Yin (Des. Codes Cryptogr., 2009)

A class of optimal constant composition codes from GDRPs. - Jie Yan; Jianxing Yin (Des. Codes Cryptogr., 2009)

Kirkman covering designs with even-sized holes. - Jianxing Yin; Chengmin Wang (Discret. Math., 2009)

On constructions for optimal two-dimensional optical orthogonal codes. - Jianmin Wang 003; Xiuling Shan; Jianxing Yin (Des. Codes Cryptogr., 2010)

Constructions of new orthogonal arrays and covering arrays of strength three. - Lijun Ji; Jianxing Yin (J. Comb. Theory A, 2010)

Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization. - Yeow Meng Chee; Alan C. H. Ling; Jianxing Yin (IEEE Trans. Inf. Theory, 2010)

Two-dimensional optical orthogonal codes and semicyclic group divisible designs. - Jianmin Wang 003; Jianxing Yin (IEEE Trans. Inf. Theory, 2010)

List decodability at small radii. - Yeow Meng Chee; Gennian Ge; Lijun Ji; San Ling; Jianxing Yin (Des. Codes Cryptogr., 2011)

Some 20-regular CDP(5, 1;20u) and their applications. - Jianxing Yin; Xiaoke Yang; Yang Li (Finite Fields Their Appl., 2011)

On the existence of orthogonal arrays OA(3, 5, 4n+2). - Jianxing Yin; Jianmin Wang 003; Lijun Ji; Yang Li (J. Comb. Theory A, 2011)

A Note on General Neighbor-Distinguishing Total Coloring of Graphs. - Danjun Huang; Weifan Wang 001; Jianxing Yin (Ars Comb., 2012)

Constructions of covering arrays of strength five. - Lijun Ji; Yang Li; Jianxing Yin (Des. Codes Cryptogr., 2012)

The equivalence between optimal detecting arrays and super-simple OAs. - Ce Shi; Yu Tang; Jianxing Yin (Des. Codes Cryptogr., 2012)

Further results on the existence of nested orthogonal arrays. - Kun Wang; Jianxing Yin (Des. Codes Cryptogr., 2013)

Maximum Distance Separable Codes for Symbol-Pair Read Channels. - Yeow Meng Chee; Lijun Ji; Han Mao Kiah; Chengmin Wang; Jianxing Yin (IEEE Trans. Inf. Theory, 2013)

Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property. - Peipei Dai; Jianmin Wang 003; Jianxing Yin (Des. Codes Cryptogr., 2014)

Existence of super-simple OA $$_{ lambda }(3, 5, v)^{ prime }$$ s. - Ce Shi; Jianxing Yin (Des. Codes Cryptogr., 2014)

Two series of equitable symbol weight codes meeting the Plotkin bound. - Peipei Dai; Jianmin Wang 003; Jianxing Yin (Des. Codes Cryptogr., 2015)

Multilength Optical Orthogonal Codes: New Upper Bounds and Optimal Constructions. - Xizhao Luo; Jianxing Yin; Fei Yue (IEEE Trans. Inf. Theory, 2015)

Resolvable generalized difference matrices: Existence and applications. - Chengmin Wang; Jie Yan; Jianxing Yin (Finite Fields Their Appl., 2016)