Beiliang Du

According to our database, Beiliang Du authored at least 44 papers between 1990 and 2018.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2018

A construction for optimal c-splitting authentication and secrecy codes.

Mingchao Li, Miao Liang, Beiliang Du, Jingyuan Chen

Des. Codes Cryptogr., 2018

2016

A new class of 2-fold perfect 4-splitting authentication codes.

Miao Liang, Sufang Jiang, Beiliang Du

Ars Comb., 2016

2015

A construction of t-fold perfect splitting authentication codes with equal deception probabilities.

Mingchao Li, Miao Liang, Beiliang Du

Cryptogr. Commun., 2015

2014

Some new results on mutually orthogonal frequency squares.

Mingchao Li, Yan Zhang, Beiliang Du

Discret. Math., 2014

A construction for t-fold perfect authentication codes with arbitration.

Miao Liang, Mingchao Li, Beiliang Du

Des. Codes Cryptogr., 2014

P_2k+1-factorization of symmetric complete bipartite multi-digraphs.

Jian Wang, Beiliang Du

Ars Comb., 2014

2013

The Existence of Augmented Resolvable Candelabra Quadruple Systems with Three Even Groups.

Zhaoping Meng, Beiliang Du

Graphs Comb., 2013

On bipartite factorization of complete bipartite multigraphs.

Jing Shi, Jian Wang, Beiliang Du

Ars Comb., 2013

2012

(1, 2)-resolvable candelabra quadruple systems and Steiner quadruple systems.

Zhaoping Meng, Jian Wang, Beiliang Du

Discret. Math., 2012

The last twenty orders of (1, 2)-resolvable Steiner quadruple systems.

Zhaoping Meng, Beiliang Du

Discret. Math., 2012

A new class of 3-fold perfect splitting authentication codes.

Miao Liang, Beiliang Du

Des. Codes Cryptogr., 2012

2011

The Spectrum of Tetrahedral Quadruple Systems.

Jian Wang, Miao Liang, Beiliang Du

Graphs Comb., 2011

Support sizes of threefold quadruple systems.

Miao Liang, Jian Wang, Beiliang Du

Discret. Math., 2011

A new class of splitting 3-designs.

Miao Liang, Beiliang Du

Des. Codes Cryptogr., 2011

2010

The existence of augmented resolvable Steiner quadruple systems.

Zhaoping Meng, Lijun Ji, Beiliang Du

Discret. Math., 2010

2009

Uniformly resolvable three-wise balanced designs with block sizes four and six.

Zhaoping Meng, Lijun Ji, Beiliang Du

Discret. Math., 2009

2008

P₅-factorization of complete bipartite graphs.

Jian Wang, Beiliang Du

Discret. Math., 2008

2006

Existence of resolvable optimal strong partially balanced designs.

Beiliang Du

Discret. Appl. Math., 2006

2005

Resolvable optimal strong partially balanced designs with block size four.

Beiliang Du

Discret. Math., 2005

The existence of resolvable Mendelsohn designs RMD({3, s^*}, v).

Yan Zhang, Beiliang Du

Australas. J Comb., 2005

Splitting balanced incomplete block designs.

Beiliang Du

Australas. J Comb., 2005

2004

<i>K_{p, q}</i>-factorization of the complete bipartite graph <i>K_{m, n}</i>.

Jian Wang, Beiliang Du

Discret. Math., 2004

Existence of optimal strong partially balanced designs with block size five.

Beiliang Du

Discret. Math., 2004

The spectrum of optimal strong partially balanced designs with block size five.

Beiliang Du

Discret. Math., 2004

Kirkman packing designs KPD ({w, s^ast}, v) and related threshold schemes.

Haitao Cao, Beiliang Du

Discret. Math., 2004

2003

Existence of self-orthogonal diagonal Latin squares with a missing subsquare.

Frank E. Bennett, Beiliang Du, Hantao Zhang

Discret. Math., 2003

The existence of three idempotent IMOLS.

R. Julian R. Abel, Beiliang Du

Discret. Math., 2003

2002

<i>K</i>l, <i>_k</i>-factorization of complete bipartite graphs.

Beiliang Du, Jian Wang

Discret. Math., 2002

K_{1, pq}-factorization of complete bipartite graphs.

Beiliang Du

Australas. J Comb., 2002

2001

The existence of bimatching designs.

Beiliang Du

Australas. J Comb., 2001

2000

P_2k-factorization of complete bipartite multigraphs.

Beiliang Du

Australas. J Comb., 2000

1999

The Existence of Self-Conjugate Self-Orthogonal Idempotent Diagonal Latin Squares.

Beiliang Du, W. D. Wallis

Ars Comb., 1999

P₃-factorization of complete bipartite symmetric digraphs.

Beiliang Du

Australas. J Comb., 1999

1998

K_{1, p²}-factorization of complete bipartite graphs.

Beiliang Du

Discret. Math., 1998

1996

The existence of orthogonal diagonal Latin squares with subsquares.

Beiliang Du

Discret. Math., 1996

1995

On the existence of three incomplete idempotent MOLS.

Beiliang Du

Australas. J Comb., 1995

On complementary path decompositions of the complete multigraph.

Beiliang Du

Australas. J Comb., 1995

1994

On the existence of incomplete transversal designs with block size five.

Beiliang Du

Discret. Math., 1994

A few more BIBDs with k=8 or 9.

Beiliang Du

Australas. J Comb., 1994

On the existence of self-orthogonal diagonal Latin squares.

Beiliang Du

Australas. J Comb., 1994

1993

New bounds for pairwise orthogonal diagonal Latin squares.

Beiliang Du

Australas. J Comb., 1993

1992

More mutually orthogonal Latin squares.

Beiliang Du

Australas. J Comb., 1992

1991

A few more RBIBDs with k = 5 and lambda = 1.

Lie Zhu, Beiliang Du, Xuebin Zhang

Discret. Math., 1991

1990

On the existence of (v, 7, 1)-perfect Mendelsohn designs.

Frank E. Bennett, Beiliang Du, Lie Zhu

Discret. Math., 1990