Alan C. H. Ling

According to our database1, Alan C. H. Ling authored at least 98 papers between 1997 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Access balancing in storage systems by labeling partial Steiner systems.
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
Relative Difference Sets Partitioned by Cosets.
Electron. J. Comb., 2017

2016
Matching divisible designs with block size four.
Discret. Math., 2016

Resolvable Group Divisible Designs with Large Groups.
Electron. J. Comb., 2016

Thickly-resolvable block designs.
Australas. J Comb., 2016

2015
Graph Divisible Designs and Packing Constructions.
Graphs Comb., 2015

A finite embedding theorem for partial Steiner 3-designs.
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
Pairwise Balanced Designs with Prescribed Minimum Dimension.
Discret. Comput. Geom., 2014

A Construction of Modular Generalized Sidon Sets.
Ars Comb., 2014

2013
Covering and packing for pairs.
J. Comb. Theory, Ser. A, 2013

2012
Grooming traffic to minimize load.
Discret. Math., 2012

Optimal equitable symbol weight codes for power line communications.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Optical grooming with grooming ratio nine.
Discret. Math., 2011

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

Linear size optimal q-ary constant-weight codes and constant-composition codes.
IEEE Trans. Inf. Theory, 2010

Spectrum of Sizes for Perfect Deletion-Correcting Codes.
SIAM J. Discret. Math., 2010

On the existence of well-ordered Steiner triple systems.
Ars Comb., 2010

2009
Limit on the Addressability of Fault-Tolerant Nanowire Decoders.
IEEE Trans. Computers, 2009

The Existence of r<sup>×</sup>4 Grid-Block Designs with r=3, 4.
SIAM J. Discret. Math., 2009

The Existence of N<sub>2</sub> Resolvable Latin Squares.
SIAM J. Discret. Math., 2009

A recursive construction for perfect hash families.
J. Math. Cryptol., 2009

Linear spaces with small generated subspaces.
J. Comb. Theory, Ser. A, 2009

Minimum embedding of Steiner triple systems into (K<sub>4</sub>-e)-designs II.
Discret. Math., 2009

Maximum uniformly resolvable designs with block sizes 2 and 4.
Discret. Math., 2009

Graph designs for the eight-edge five-vertex graphs.
Discret. Math., 2009

Further results on (v, {5, w<sup>*</sup>}, 1)-PBDs.
Discret. Math., 2009

Linear hash families and forbidden configurations.
Des. Codes Cryptogr., 2009

Optical grooming with grooming ratio eight.
Discret. Appl. Math., 2009

2008
A Systematic Construction for Radar Arrays.
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

Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven.
SIAM J. Discret. Math., 2008

Mining partial periodic correlations in time series.
Knowl. Inf. Syst., 2008

The Fine Intersection Problem for Steiner Triple Systems.
Graphs Comb., 2008

Resolvable balanced incomplete block designs with subdesigns of block size 4.
Discret. Math., 2008

Minimum embedding of Steiner triple systems into (K<sub>4</sub>-e)-designs I.
Discret. Math., 2008

Constructing strength three covering arrays with augmented annealing.
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
The PBD-Closure of Constant-Composition Codes.
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

On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges.
SIAM J. Discret. Math., 2007

Perfect hash families from transversal designs.
Australas. J Comb., 2007

2006
Fault-tolerant routings with minimum optical index.
Networks, 2006

Scheduling <i>CCRR</i> tournaments.
J. Comb. Theory, Ser. A, 2006

A Fast Algorithm for the Constrained Multiple Sequence Alignment Problem.
Acta Cybern., 2006

Location-aware key predistribution scheme for wide area wireless sensor networks.
Proceedings of the 4th ACM Workshop on Security of ad hoc and Sensor Networks, 2006

Optimal memoryless encoding for low power off-chip data buses.
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

Constructions of Quad-Rooted Double Covers.
Graphs Comb., 2005

Embedding path designs into kite systems.
Discret. Math., 2005

Resolvable Maximum Packings with Quadruples.
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

A combinatorial error bound for t-point-based sampling.
Theor. Comput. Sci., 2004

A systematic approach to some block design constructions.
J. Comb. Theory, Ser. A, 2004

Splitting systems and separating systems.
Discret. Math., 2004

A survey on resolvable group divisible designs with block size four.
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

Grooming in unidirectional rings: <i>K</i><sub>4</sub>-<i>e</i> designs.
Discret. Math., 2004

Cover-Free Families and Topology-Transparent Scheduling for MANETs.
Des. Codes Cryptogr., 2004

Super-simple (v, 5, 2)-designs.
Discret. Appl. Math., 2004

2003
Constrained Ramsey numbers of graphs.
J. Graph Theory, 2003

Sets of three pairwise orthogonal Steiner triple systems.
J. Comb. Theory, Ser. A, 2003

An application of splittable 4-frames to coloring of <i>K<sub>n, n</sub></i>.
Discret. Math., 2003

A note on {4}-GDDs of type 2<sup>10</sup>.
Discret. Math., 2003

Complementary partial resolution squares for Steiner triple systems.
Discret. Math., 2003

Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs.
Discret. Math., 2003

A new construction for Z-cyclic whist tournaments.
Discret. Appl. Math., 2003

Skolem-type Difference Sets for Cycle Systems.
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

Augmenting Simulated Annealing to Build Interaction Test Suites.
Proceedings of the 14th International Symposium on Software Reliability Engineering (ISSRE 2003), 2003

Topology-transparent scheduling for MANETs using orthogonal arrays.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2003

Steiner Systems for Topology-Transparent Access Control in MANETs.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, 2003

2002
Difference triangle sets from affine planes.
IEEE Trans. Inf. Theory, 2002

Kirkman triple systems of order 21 with nontrivial automorphism group.
Math. Comput., 2002

Uniform Group Divisible Designs with Block Sizes Three and n.
Graphs Comb., 2002

Totally magic graphs.
Discret. Math., 2002

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

Construction of optimal quality control for oligo arrays.
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
Equireplicate Balanced Binary Codes for Oligo Arrays.
SIAM J. Discret. Math., 2001

Slope packings and coverings, and generic algorithms for the discrete logarithm problem.
IACR Cryptol. ePrint Arch., 2001

The existence of referee squares.
Discret. Math., 2001

(M, S)-optimal designs with block size three.
Australas. J Comb., 2001

2000
Quorums from difference covers.
Inf. Process. Lett., 2000

Modified group divisible designs with block size four.
Discret. Math., 2000

Asymptotically optimal erasure-resilient codes for large disk arrays.
Discret. Appl. Math., 2000

1999
Kirkman school project designs.
Discret. Math., 1999

Balanced sampling plans with block size four excluding contiguous units.
Australas. J Comb., 1999

1998
Point Code Minimum Steiner Triple Systems.
Des. Codes Cryptogr., 1998

Deleting Lines in Projective Planes.
Ars Comb., 1998

1997
Pairwise Balanced Designs with Block Sizes 8, 9, and 10.
J. Comb. Theory, Ser. A, 1997

Pairwise Balanced Designs with Consecutive Block Sizes.
Des. Codes Cryptogr., 1997

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


  Loading...