Jianxing Yin

,

Finite Fields Their Appl., 2016

Multilength Optical Orthogonal Codes: New Upper Bounds and Optimal Constructions.

[BibT_eX]

[DOI]

Xizhao Luo

,

,

Fei Yue

IEEE Trans. Inf. Theory, 2015

Two series of equitable symbol weight codes meeting the Plotkin bound.

[BibT_eX]

[DOI]

Peipei Dai

,

,

Des. Codes Cryptogr., 2015

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

[BibT_eX]

[DOI]

Ce Shi

,

Des. Codes Cryptogr., 2014

Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property.

[BibT_eX]

[DOI]

Peipei Dai

,

,

Des. Codes Cryptogr., 2014

Maximum Distance Separable Codes for Symbol-Pair Read Channels.

[BibT_eX]

[DOI]

,

,

,

,

IEEE Trans. Inf. Theory, 2013

Further results on the existence of nested orthogonal arrays.

[BibT_eX]

[DOI]

Kun Wang

,

Des. Codes Cryptogr., 2013

The equivalence between optimal detecting arrays and super-simple OAs.

[BibT_eX]

[DOI]

Ce Shi

,

Yu Tang

,

Des. Codes Cryptogr., 2012

Constructions of covering arrays of strength five.

[BibT_eX]

[DOI]

Lijun Ji

,

Yang Li

,

Des. Codes Cryptogr., 2012

A Note on General Neighbor-Distinguishing Total Coloring of Graphs.

[BibT_eX]

Danjun Huang

,

Weifan Wang

,

Ars Comb., 2012

On the existence of orthogonal arrays OA(3, 5, 4n+2).

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory A, 2011

Some 20-regular CDP(5, 1;20u) and their applications.

[BibT_eX]

[DOI]

,

Xiaoke Yang

,

Yang Li

Finite Fields Their Appl., 2011

List decodability at small radii.

[BibT_eX]

[DOI]

,

,

,

,

Des. Codes Cryptogr., 2011

Two-dimensional optical orthogonal codes and semicyclic group divisible designs.

[BibT_eX]

[DOI]

,

IEEE Trans. Inf. Theory, 2010

Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization.

[BibT_eX]

[DOI]

Yeow Meng Chee

,

Alan C. H. Ling

,

IEEE Trans. Inf. Theory, 2010

Constructions of new orthogonal arrays and covering arrays of strength three.

[BibT_eX]

[DOI]

Lijun Ji

,

J. Comb. Theory A, 2010

On constructions for optimal two-dimensional optical orthogonal codes.

[BibT_eX]

[DOI]

,

Xiuling Shan

,

Des. Codes Cryptogr., 2010

Kirkman covering designs with even-sized holes.

[BibT_eX]

[DOI]

,

Chengmin Wang

Discret. Math., 2009

A class of optimal constant composition codes from GDRPs.

[BibT_eX]

[DOI]

,

Des. Codes Cryptogr., 2009

Optimal grid holey packings with block size 3 and 4.

[BibT_eX]

[DOI]

Bin Wen

,

,

Des. Codes Cryptogr., 2009

Covering arrays of strength 3 and 4 from holey difference matrices.

[BibT_eX]

[DOI]

Yang Li

,

Lijun Ji

,

Des. Codes Cryptogr., 2009

Sets of Optimal Frequency-Hopping Sequences.

[BibT_eX]

[DOI]

,

IEEE Trans. Inf. Theory, 2008

Constructions of partitioned difference families.

[BibT_eX]

[DOI]

,

Xiuling Shan

,

Zihong Tian

Eur. J. Comb., 2008

Constructions of almost difference families.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

Generalized balanced tournament designs and related codes.

[BibT_eX]

[DOI]

,

,

Chengmin Wang

Des. Codes Cryptogr., 2008

Constructions of optimal GDRP(n, lambda;v)'s of type lambda1µm-1.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2008

Signal Sets From Functions With Optimum Nonlinearity.

[BibT_eX]

[DOI]

,

IEEE Trans. Commun., 2007

Constructions for Perfect 5-Deletion-Correcting Codes of Length 7.

[BibT_eX]

[DOI]

,

IEEE Trans. Inf. Theory, 2006

A Construction of Optimal Constant Composition Codes.

[BibT_eX]

[DOI]

,

Des. Codes Cryptogr., 2006

Combinatorial constructions of optimal constant-composition codes.

[BibT_eX]

[DOI]

,

IEEE Trans. Inf. Theory, 2005

Algebraic constructions of constant composition codes.

[BibT_eX]

[DOI]

,

IEEE Trans. Inf. Theory, 2005

Lower bounds for wrap-around L2-discrepancy and constructions of symmetrical uniform designs.

[BibT_eX]

[DOI]

Kai-Tai Fang

,

Yu Tang

,

J. Complex., 2005

Cyclic Difference Packing and Covering Arrays.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2005

Constructions of uniform designs by using resolvable packings and coverings.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2004

Further results on optimal optical orthogonal codes with weight 4.

[BibT_eX]

[DOI]

Yanxun Chang

,

Discret. Math., 2004

Preface.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2004

Constructions of difference covering arrays.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2003

A new proof of a Colbourn-Rosa problem.

[BibT_eX]

[DOI]

Discret. Math., 2003

Maximum Complementary P3-Packings of Kv.

[BibT_eX]

,

Ars Comb., 2003

A General Construction for Optimal Cyclic Packing Designs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2002

Existence of Perfect 4-Deletion-Correcting Codes with Length Six.

[BibT_eX]

,

,

Des. Codes Cryptogr., 2002

A survey on maximum distance holey packings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Constructions for optimal (v, 4, 1) optical orthogonal codes.

[BibT_eX]

[DOI]

Gennian Ge

,

IEEE Trans. Inf. Theory, 2001

Optimal (9v, 4, 1) Optical Orthogonal Codes.

[BibT_eX]

[DOI]

Ryoh Fuji-Hara

,

Ying Miao

,

SIAM J. Discret. Math., 2001

Directed packing and covering designs with block size four.

[BibT_eX]

[DOI]

Ahmed M. Assaf

,

,

Discret. Math., 2001

A Combinatorial Construction for Perfect Deletion-Correcting Codes.

[BibT_eX]

Des. Codes Cryptogr., 2001

On group divisible covering designs.

[BibT_eX]

[DOI]

Katherine Heinrich

,

Discret. Math., 1999

Some combinatorial constructions for optical orthogonal codes.

[BibT_eX]

[DOI]

Discret. Math., 1998

Nested Optimal -Packings and -Coverings of Pairs with Triples.

[BibT_eX]

[DOI]

,

Des. Codes Cryptogr., 1998

Perfect Mendelsohn Packing Designs with Block Size Five.

[BibT_eX]

[DOI]

,

,

,

Des. Codes Cryptogr., 1998

On Directed Incomplete Transversal Designs with Block Size Five.

[BibT_eX]

Charles J. Colbourn

,

Ars Comb., 1998

Directed packings with block size 5.

[BibT_eX]

[DOI]

Ahmed M. Assaf

,

,

Australas. J Comb., 1998

Existence of Incomplete Transversal Designs with Block Size Five and Any Index lambda.

[BibT_eX]

[DOI]

,

,

,

Des. Codes Cryptogr., 1997

Directed packings with block size 5 and odd v.

[BibT_eX]

[DOI]

,

,

,

Australas. J Comb., 1996

Directed Packings with Block Size 5 and Even v.

[BibT_eX]

[DOI]

,