# Alan C. H. Ling

According to our database

Collaborative distances:

^{1}, Alan C. H. Ling authored at least 98 papers between 1997 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Des. Codes Cryptogr., 2020

2019

Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families.

SIAM J. Discret. Math., 2019

2017

Electron. J. Comb., 2017

2016

Discret. Math., 2016

Electron. J. Comb., 2016

Australas. J Comb., 2016

2015

Graphs Comb., 2015

Finite Fields Their Appl., 2015

Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses.

Des. Codes Cryptogr., 2015

2014

Discret. Comput. Geom., 2014

A Construction of Modular Generalized Sidon Sets.

Ars Comb., 2014

2013

J. Comb. Theory, Ser. A, 2013

2012

Discret. Math., 2012

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Discret. Math., 2011

2010

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

IEEE Trans. Inf. Theory, 2010

IEEE Trans. Inf. Theory, 2010

SIAM J. Discret. Math., 2010

On the existence of well-ordered Steiner triple systems.

Ars Comb., 2010

2009

IEEE Trans. Computers, 2009

SIAM J. Discret. Math., 2009

SIAM J. Discret. Math., 2009

J. Math. Cryptol., 2009

J. Comb. Theory, Ser. A, 2009

Discret. Math., 2009

Discret. Math., 2009

Discret. Math., 2009

Discret. Math., 2009

Des. Codes Cryptogr., 2009

Discret. Appl. Math., 2009

2008

IEEE Trans. Inf. Theory, 2008

Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three.

IEEE Trans. Inf. Theory, 2008

The Sizes of Optimal q -Ary Codes of Weight Three and Distance Four: A Complete Solution.

IEEE Trans. Inf. Theory, 2008

SIAM J. Discret. Math., 2008

Knowl. Inf. Syst., 2008

Graphs Comb., 2008

Discret. Math., 2008

Discret. Math., 2008

Discret. Math., 2008

Note edge-colourings of <i>K</i> <sub> <i>n, n</i> </sub> with no long two-coloured cycles.

Comb., 2008

2007

IEEE Trans. Inf. Theory, 2007

On the Existence of K<sub>5 \setminuse</sub>-Designs with Application to Optical Networks.

SIAM J. Discret. Math., 2007

SIAM J. Discret. Math., 2007

Australas. J Comb., 2007

2006

Networks, 2006

J. Comb. Theory, Ser. A, 2006

Acta Cybern., 2006

Proceedings of the 4th ACM Workshop on Security of ad hoc and Sensor Networks, 2006

Proceedings of the 2006 International Conference on Computer-Aided Design, 2006

2005

Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio <i>C</i> = 6.

SIAM J. Discret. Math., 2005

Graphs Comb., 2005

Discret. Math., 2005

Des. Codes Cryptogr., 2005

Group Divisible Designs with Block Size Four and Group Type <i>g</i><sup><i>u</i></sup><i>m</i><sup>1</sup> with Minimum <i>m</i>.

Des. Codes Cryptogr., 2005

2004

Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares.

IEEE Trans. Inf. Theory, 2004

Theor. Comput. Sci., 2004

J. Comb. Theory, Ser. A, 2004

Discret. Math., 2004

Discret. Math., 2004

Group divisible designs with block size four and group type <i>g<sup>u</sup>m</i><sup>1</sup> for small <i>g</i>.

Discret. Math., 2004

Discret. Math., 2004

Des. Codes Cryptogr., 2004

Discret. Appl. Math., 2004

2003

J. Graph Theory, 2003

J. Comb. Theory, Ser. A, 2003

Discret. Math., 2003

Discret. Math., 2003

Discret. Math., 2003

Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs.

Discret. Math., 2003

Discret. Appl. Math., 2003

Electron. J. Comb., 2003

Some applications of combinatorial designs to extremal graph theory.

Ars Comb., 2003

Six New Constant Weight Binary Codes.

Ars Comb., 2003

Proceedings of the 14th International Symposium on Software Reliability Engineering (ISSRE 2003), 2003

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2003

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, 2003

2002

IEEE Trans. Inf. Theory, 2002

Math. Comput., 2002

Graphs Comb., 2002

Discret. Math., 2002

The Existence of Kirkman Squares-Doubly Resolvable (v, 3, 1)-BIBDs.

Des. Codes Cryptogr., 2002

Bioinform., 2002

A direct construction of transversal covers using group divisible designs.

Ars Comb., 2002

Packings with block size five and index one: v \equiv 2 (mod 4).

Ars Comb., 2002

2001

SIAM J. Discret. Math., 2001

Slope packings and coverings, and generic algorithms for the discrete logarithm problem.

IACR Cryptol. ePrint Arch., 2001

Discret. Math., 2001

Australas. J Comb., 2001

2000

Inf. Process. Lett., 2000

Discret. Math., 2000

Discret. Appl. Math., 2000

1999

Discret. Math., 1999

Australas. J Comb., 1999

1998

Des. Codes Cryptogr., 1998

Deleting Lines in Projective Planes.

Ars Comb., 1998

1997

J. Comb. Theory, Ser. A, 1997

Des. Codes Cryptogr., 1997

On the Closure of Subsets of {4, 5, ..., 9} which contain {4}.

Ars Comb., 1997