Jianxing Yin

According to our database1, Jianxing Yin authored at least 55 papers between 1995 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
Resolvable generalized difference matrices: Existence and applications.
Finite Fields Their Appl., 2016

2015
Multilength Optical Orthogonal Codes: New Upper Bounds and Optimal Constructions.
IEEE Trans. Inf. Theory, 2015

Two series of equitable symbol weight codes meeting the Plotkin bound.
Des. Codes Cryptogr., 2015

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

Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property.
Des. Codes Cryptogr., 2014

2013
Maximum Distance Separable Codes for Symbol-Pair Read Channels.
IEEE Trans. Inf. Theory, 2013

Further results on the existence of nested orthogonal arrays.
Des. Codes Cryptogr., 2013

2012
The equivalence between optimal detecting arrays and super-simple OAs.
Des. Codes Cryptogr., 2012

Constructions of covering arrays of strength five.
Des. Codes Cryptogr., 2012

A Note on General Neighbor-Distinguishing Total Coloring of Graphs.
Ars Comb., 2012

2011
On the existence of orthogonal arrays OA(3, 5, 4n+2).
J. Comb. Theory, Ser. A, 2011

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

List decodability at small radii.
Des. Codes Cryptogr., 2011

2010
Two-dimensional optical orthogonal codes and semicyclic group divisible designs.
IEEE Trans. Inf. Theory, 2010

Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization.
IEEE Trans. Inf. Theory, 2010

Constructions of new orthogonal arrays and covering arrays of strength three.
J. Comb. Theory, Ser. A, 2010

On constructions for optimal two-dimensional optical orthogonal codes.
Des. Codes Cryptogr., 2010

2009
Kirkman covering designs with even-sized holes.
Discret. Math., 2009

A class of optimal constant composition codes from GDRPs.
Des. Codes Cryptogr., 2009

Optimal grid holey packings with block size 3 and 4.
Des. Codes Cryptogr., 2009

Covering arrays of strength 3 and 4 from holey difference matrices.
Des. Codes Cryptogr., 2009

2008
Sets of Optimal Frequency-Hopping Sequences.
IEEE Trans. Inf. Theory, 2008

Constructions of partitioned difference families.
Eur. J. Comb., 2008

Constructions of almost difference families.
Discret. Math., 2008

Generalized balanced tournament designs and related codes.
Des. Codes Cryptogr., 2008

Constructions of optimal GDRP(n, lambda;v)'s of type lambda<sup>1</sup>µ<sup>m-1</sup>.
Discret. Appl. Math., 2008

2007
Signal Sets From Functions With Optimum Nonlinearity.
IEEE Trans. Commun., 2007

2006
Constructions for Perfect 5-Deletion-Correcting Codes of Length 7.
IEEE Trans. Inf. Theory, 2006

A Construction of Optimal Constant Composition Codes.
Des. Codes Cryptogr., 2006

2005
Combinatorial constructions of optimal constant-composition codes.
IEEE Trans. Inf. Theory, 2005

Algebraic constructions of constant composition codes.
IEEE Trans. Inf. Theory, 2005

Lower bounds for wrap-around <i>L</i><sub>2</sub>-discrepancy and constructions of symmetrical uniform designs.
J. Complex., 2005

Cyclic Difference Packing and Covering Arrays.
Des. Codes Cryptogr., 2005

2004
Constructions of uniform designs by using resolvable packings and coverings.
Discret. Math., 2004

Further results on optimal optical orthogonal codes with weight 4.
Discret. Math., 2004

Preface.
Discret. Math., 2004

2003
Constructions of difference covering arrays.
J. Comb. Theory, Ser. A, 2003

A new proof of a Colbourn-Rosa problem.
Discret. Math., 2003

Maximum Complementary P3-Packings of Kv.
Ars Comb., 2003

2002
A General Construction for Optimal Cyclic Packing Designs.
J. Comb. Theory, Ser. A, 2002

Existence of Perfect 4-Deletion-Correcting Codes with Length Six.
Des. Codes Cryptogr., 2002

A survey on maximum distance holey packings.
Discret. Appl. Math., 2002

2001
Constructions for optimal (v, 4, 1) optical orthogonal codes.
IEEE Trans. Inf. Theory, 2001

Optimal (9<i>v</i>, 4, 1) Optical Orthogonal Codes.
SIAM J. Discret. Math., 2001

Directed packing and covering designs with block size four.
Discret. Math., 2001

A Combinatorial Construction for Perfect Deletion-Correcting Codes.
Des. Codes Cryptogr., 2001

1999
On group divisible covering designs.
Discret. Math., 1999

1998
Some combinatorial constructions for optical orthogonal codes.
Discret. Math., 1998

Nested Optimal -Packings and -Coverings of Pairs with Triples.
Des. Codes Cryptogr., 1998

Perfect Mendelsohn Packing Designs with Block Size Five.
Des. Codes Cryptogr., 1998

On Directed Incomplete Transversal Designs with Block Size Five.
Ars Comb., 1998

Directed packings with block size 5.
Australas. J Comb., 1998

1997
Existence of Incomplete Transversal Designs with Block Size Five and Any Index lambda.
Des. Codes Cryptogr., 1997

1996
Directed packings with block size 5 and odd v.
Australas. J Comb., 1996

1995
Directed Packings with Block Size 5 and Even v.
Des. Codes Cryptogr., 1995


  Loading...