Alan C. H. Ling

发表

Optimal Memoryless Encoding for Low Power Off-Chip Data Buses

Charles J. Colbourn, Yeow Meng Chee, Alan C. H. Ling, 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.

Linear spaces with small generated subspaces

Alan C. H. Ling, Peter Dukes, P. Dukes, 2009, J. Comb. Theory, Ser. A.

Super-simple (v, 5, 2)-designs

Donald L. Kreher, Alan C. H. Ling, Hans-Dietrich O. F. Gronau, 2004, Discret. Appl. Math..

Sets of three pairwise orthogonal Steiner triple systems

Alan C. H. Ling, Peter Dukes, Jeffrey H. Dinitz, 2003, J. Comb. Theory, Ser. A.

Resolvable Group Divisible Designs with Large Groups

Alan C. H. Ling, Peter Dukes, Esther R. Lamken, 2016, Electron. J. Comb..

Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio C = 6

David Coudert, Gennian Ge, Charles J. Colbourn, 2005, SIAM J. Discret. Math..

Resolvable balanced incomplete block designs with subdesigns of block size 4

Gennian Ge, Alan C. H. Ling, Malcolm Greig, 2008, Discret. Math..

Optical grooming with grooming ratio nine

Gennian Ge, Charles J. Colbourn, Alan C. H. Ling, 2011, Discret. Math..

Augmenting simulated annealing to build interaction test suites

Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling, 2003, 14th International Symposium on Software Reliability Engineering, 2003. ISSRE 2003..

Decompositions of edge-colored digraphs: A new technique in the construction of constant-weight codes and related families

Hui Zhang, Yeow Meng Chee, Alan C. H. Ling, 2014, 2014 IEEE International Symposium on Information Theory.

Optical grooming with grooming ratio eight

Gennian Ge, Charles J. Colbourn, Alan C. H. Ling, 2009, Discret. Appl. Math..

A survey on resolvable group divisible designs with block size four

Alan C. H. Ling, Gennian Ge, G. Ge, 2004, Discret. Math..

Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization

Yeow Meng Chee, Alan C. H. Ling, Jianxing Yin, 2010, IEEE Transactions on Information Theory.

Graph Divisible Designs and Packing Constructions

Alan C. H. Ling, Peter Dukes, 2015, Graphs Comb..

Constrained Ramsey numbers of graphs

Alan C. H. Ling, Robert E. Jamison, Tao Jiang, 2003, J. Graph Theory.

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

Yeow Meng Chee, Alan C. H. Ling, San Ling, 2008, IEEE Transactions on Information Theory.

Kirkman school project designs

Charles J. Colbourn, Alan C. H. Ling, C. Colbourn, 1999, Discret. Math..

Group Divisible Designs with Block Size Four and Group Type gum1 with Minimum m

Gennian Ge, Alan C. H. Ling, G. Ge, 2005, Des. Codes Cryptogr..

Optimal equitable symbol weight codes for power line communications

Yeow Meng Chee, Alan C. H. Ling, Han Mao Kiah, 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

Permutation arrays for powerline communication and mutually orthogonal latin squares

Torleiv Kløve, Charles J. Colbourn, Alan C. H. Ling, 2004, IEEE Transactions on Information Theory.

Asymptotically optimal erasure-resilient codes for large disk arrays

Charles J. Colbourn, Yeow Meng Chee, Alan C. H. Ling, 2000, Discret. Appl. Math..

Optimal Memoryless Encoding for Low Power Off-Chip Data Buses

Charles J. Colbourn, Yeow Meng Chee, Alan C. H. Ling, 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.

Decompositions of edge-colored digraphs: A new technique in the construction of constant-weight codes and related families

Hui Zhang, Yeow Meng Chee, Alan C. H. Ling, 2014, 2014 IEEE International Symposium on Information Theory.

A finite embedding theorem for partial Steiner 3-designs

Tao Feng, Alan C. H. Ling, Peter Dukes, 2015, Finite Fields Their Appl..

Location-aware key predistribution scheme for wide area wireless sensor networks

Alan C. H. Ling, Xiaoyang Sean Wang, Katerina Simonova, 2006, SASN '06.

Modified group divisible designs with block size four

Charles J. Colbourn, Alan C. H. Ling, C. Colbourn, 2000, Discret. Math..

Relative Difference Sets Partitioned by Cosets

Alan C. H. Ling, Peter Dukes, P. Dukes, 2017, Electron. J. Comb..

Topology-transparent scheduling for MANETs using orthogonal arrays

Charles J. Colbourn, Alan C. H. Ling, Violet R. Syrotiuk, 2003, DIALM-POMC '03.

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

Alan C. H. Ling, Douglas R. Stinson, M. A. Chateauneuf, 2001, IACR Cryptol. ePrint Arch..

Minimum embedding of Steiner triple systems into (K4-e)-designs II

Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi, 2009, Discret. Math..

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

Hui Zhang, Charles J. Colbourn, Yeow Meng Chee, 2015, Des. Codes Cryptogr..

Íëìêêääëááae Âçíêaeaeä Ç Çååáaeaeìçêááë Îóðùññ ¿½´¾¼¼¼µ¸è× ½½½ß¾¼¼

Alan C. H. Ling, Douglas R. Stinson, Jeffrey H. Dinitz, 2022 .

A Construction of Modular Generalized Sidon Sets

Alan C. H. Ling, Charles C. Y. Lam, 2014, Ars Comb..

On the Existence of K5 \setminuse-Designs with Application to Optical Networks

Gennian Ge, Alan C. H. Ling, G. Ge, 2007, SIAM J. Discret. Math..

Equireplicate Balanced Binary Codes for Oligo Arrays

Noga Alon, Charles J. Colbourn, Alan C. H. Ling, 2001, SIAM J. Discret. Math..

Linear Size Optimal $q$-ary Constant-Weight Codes and Constant-Composition Codes

Yeow Meng Chee, Alan C. H. Ling, San Ling, 2010, IEEE Transactions on Information Theory.

Embedding path designs into kite systems

Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi, 2005, Discret. Math..

Quorums from difference covers

Charles J. Colbourn, Alan C. H. Ling, C. Colbourn, 2000, Inf. Process. Lett..

Graph designs for the eight-edge five-vertex graphs

Gennian Ge, Charles J. Colbourn, Alan C. H. Ling, 2009, Discret. Math..

Limit on the Addressability of Fault-Tolerant Nanowire Decoders

Yeow Meng Chee, Alan C. H. Ling, Y. M. Chee, 2009, IEEE Transactions on Computers.

A new construction for Z-cyclic whist tournaments

Alan C. H. Ling, Gennian Ge, 2003, Discret. Appl. Math..

Minimum embedding of Steiner triple systems into (K4-e)-designs I

Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi, 2008, Discret. Math..

Pairwise Balanced Designs with Consecutive Block Sizes

Charles J. Colbourn, Alan C. H. Ling, Ronald C. Mullin, 1997, Des. Codes Cryptogr..

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

Alan C. H. Ling, 2002, Ars Comb..

Group divisible designs with block size four and group type gum1 for small g

Gennian Ge, Alan C. H. Ling, G. Ge, 2004, Discret. Math..

A recursive construction for perfect hash families

Charles J. Colbourn, Alan C. H. Ling, C. Colbourn, 2009, J. Math. Cryptol..

Grooming traffic to minimize load

Charles J. Colbourn, Alan C. H. Ling, Violet R. Syrotiuk, 2012, Discret. Math..

Kirkman triple systems of order 21 with nontrivial automorphism group

Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling, 2002, Math. Comput..

Balanced sampling plans with block size four excluding contiguous units

Charles J. Colbourn, Alan C. H. Ling, 1999, Australas. J Comb..

A note on {4}-GDDs of type 210

Donald L. Kreher, Alan C. H. Ling, Rolf S. Rees, 2003, Discret. Math..

Point Code Minimum Steiner Triple Systems

Charles J. Colbourn, Alan C. H. Ling, 1998, Des. Codes Cryptogr..

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

R. Julian R. Abel, Alan C. H. Ling, Ronald C. Mullin, 1997, Ars Comb..

On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges

Yeow Meng Chee, Alan C. H. Ling, Y. Chee, 2007, SIAM J. Discret. Math..

An application of splittable 4-frames to coloring of Kn, n

Alan C. H. Ling, A. Ling, 2003, Discret. Math..

The PBD-Closure of Constant-Composition Codes

Hao Shen, Yeow Meng Chee, Alan C. H. Ling, 2007, IEEE Transactions on Information Theory.

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

Gennian Ge, Yeow Meng Chee, Alan C. H. Ling, 2008, IEEE Transactions on Information Theory.

Maximum uniformly resolvable designs with block sizes 2 and 4

Alan C. H. Ling, Peter Danziger, J. H. Dinitz, 2009, Discret. Math..

(M, S)-optimal designs with block size three

Charles J. Colbourn, Alan C. H. Ling, C. Colbourn, 2001, Australas. J Comb..

A combinatorial error bound for t-point-based sampling

Alan C. H. Ling, Peter Dukes, 2004, Theor. Comput. Sci..

Some applications of combinatorial designs to extremal graph theory

Alan C. H. Ling, 2003, Ars Comb..

Spectrum of Sizes for Perfect Deletion-Correcting Codes pdf

Gennian Ge, Yeow Meng Chee, Alan C. H. Ling, 2010, SIAM J. Discret. Math..

Scheduling CCRR tournaments

Gennian Ge, Alan C. H. Ling, Esther R. Lamken, 2006, J. Comb. Theory, Ser. A.

Fault‐tolerant routings with minimum optical index

Alan C. H. Ling, Douglas R. Stinson, Jeffrey H. Dinitz, 2006, Networks.

Skolem-type Difference Sets for Cycle Systems

Alan C. H. Ling, Darryn E. Bryant, Heather Gavlas, 2003, Electron. J. Comb..

Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven

Gennian Ge, Charles J. Colbourn, Alan C. H. Ling, 2008, SIAM J. Discret. Math..

Splitting systems and separating systems

Pak Ching Li, Alan C. H. Ling, G. H. John van Rees, 2004, Discret. Math..

Pairwise Balanced Designs with Block Sizes 8, 9, and 10

Charles J. Colbourn, Alan C. H. Ling, 1997, J. Comb. Theory, Ser. A.

Further results on (v, {5, w*}, 1)-PBDs

R. Julian R. Abel, Gennian Ge, Alan C. H. Ling, 2009, Discret. Math..

Constructions of Quad-Rooted Double Covers

Gennian Ge, Alan C. H. Ling, 2005, Graphs Comb..

Constructing strength three covering arrays with augmented annealing

Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling, 2003, Discret. Math..

Cover-Free Families and Topology-Transparent Scheduling for MANETs

Charles J. Colbourn, Alan C. H. Ling, Violet R. Syrotiuk, 2004, Des. Codes Cryptogr..

Covering and packing for pairs

Charles J. Colbourn, Yeow Meng Chee, Alan C. H. Ling, 2013, J. Comb. Theory, Ser. A.

Linear hash families and forbidden configurations

Charles J. Colbourn, Alan C. H. Ling, C. Colbourn, 2009, Des. Codes Cryptogr..

Complementary partial resolution squares for Steiner triple systems

Alan C. H. Ling, Jeffrey H. Dinitz, Esther R. Lamken, 2003, Discret. Math..

Note edge-colourings of Kn,n with no long two-coloured cycles

Alan C. H. Ling, Peter Dukes, 2008, Comb..

A Fast Algorithm for the Constrained Multiple Sequence Alignment Problem

Alan C. H. Ling, Dan He, Abdullah N. Arslan, 2006, Acta Cybern..

A direct construction of transversal covers using group divisible designs

Brett Stevens, Alan C. H. Ling, Eric Mendelsohn, 2002, Ars Comb..

The Existence of N2 Resolvable Latin Squares

Alan C. H. Ling, Jeffrey H. Dinitz, A. J. Wolfe, 2009, SIAM J. Discret. Math..

Thickly-resolvable block designs

Alan C. H. Ling, Peter Dukes, Amanda Malloch, 2016, Australas. J Comb..

Steiner Systems for Topology-Transparent Access Control in MANETs

Charles J. Colbourn, Alan C. H. Ling, Violet R. Syrotiuk, 2003, ADHOC-NOW.

Deleting Lines in Projective Planes

Charles J. Colbourn, Alan C. H. Ling, C. Colbourn, 1998, Ars Comb..

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

Charles J. Colbourn, Alan C. H. Ling, Esther R. Lamken, 2002, Des. Codes Cryptogr..

Difference triangle sets from affine planes

Alan C. H. Ling, 2002, IEEE Trans. Inf. Theory.

The Fine Intersection Problem for Steiner Triple Systems

Hao Shen, Yeow Meng Chee, Alan C. H. Ling, 2008, Graphs Comb..

Totally magic graphs

Alan C. H. Ling, Walter D. Wallis, Geoffrey Exoo, 2002, Discret. Math..

Uniform Group Divisible Designs with Block Sizes Three and n

Yeow Meng Chee, Alan C. H. Ling, Y. M. Chee, 2002, Graphs Comb..

On the existence of well-ordered Steiner triple systems

Alan C. H. Ling, 2010, Ars Comb..

A Systematic Construction for Radar Arrays

Gennian Ge, Alan C. H. Ling, Ying Miao, 2008, IEEE Transactions on Information Theory.

Resolvable Maximum Packings with Quadruples

Hao Shen, Clement W. H. Lam, Gennian Ge, 2005, Des. Codes Cryptogr..

The existence of referee squares

Alan C. H. Ling, Jeffrey H. Dinitz, 2001, Discret. Math..

Construction of optimal quality control for oligo arrays

Charles J. Colbourn, Alan C. H. Ling, Martin Tompa, 2002, Bioinform..

Pairwise Balanced Designs with Prescribed Minimum Dimension

Alan C. H. Ling, Peter Dukes, P. Dukes, 2014, Discret. Comput. Geom..

Mining partial periodic correlations in time series

Alan C. H. Ling, Zhen He, Xiaoyang Sean Wang, 2006, Knowledge and Information Systems.

Six New Constant Weight Binary Codes

Yeow Meng Chee, Alan C. H. Ling, Hui Kheng Aw, 2003, Ars Comb..

A systematic approach to some block design constructions

Alan C. H. Ling, Gennian Ge, G. Ge, 2004, J. Comb. Theory, Ser. A.

The Existence of r×4 Grid-Block Designs with r=3, 4

Gennian Ge, Alan C. H. Ling, Hung-Lin Fu, 2009, SIAM J. Discret. Math..

The secrets of Orion's great nebula.

Alan C. H. Ling, 1995 .

Matching divisible designs with block size four

Tao Feng, Alan C. H. Ling, Peter Dukes, 2016, Discret. Math..

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

Charles J. Colbourn, Alan C. H. Ling, C. Colbourn, 2003, Discret. Math..

Grooming in unidirectional rings: K4-e designs

Charles J. Colbourn, Jean-Claude Bermond, Alan C. H. Ling, 2004, Discret. Math..

Minimum embedding of P3‐designs into (K4—e)‐designs

Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi, 2003 .

The Hamilton-Waterloo problem with triangle-factors and Hamilton cycles: The case n 3 (mod 18)

Alan C. H. Ling, J. H. Dinitz, 2008 .

The Hamilton—Waterloo problem: The case of triangle‐factors and one Hamilton cycle

Alan C. H. Ling, Jeffrey H. Dinitz, J. Dinitz, 2009 .

The existence of uniform 5‐GDDs

Charles J. Colbourn, Alan C. H. Ling, Jianxing Yin, 1997 .

Some more 5-GDDs and optimal (v), 5, 1)-packings

Gennian Ge, Alan C. H. Ling, 2004 .

A direct product construction for 5‐sparse triple systems

Alan C. H. Ling, A. Ling, 1997 .

Further results on the maximum size of a hole in an incomplete t‐wise balanced design with specified minimum block size*

Donald L. Kreher, Alan C. H. Ling, Rolf S. Rees, 2002 .

The Asymptotic Existence of Resolvable Group Divisible Designs

Alan C. H. Ling, Esther R. Lamken, Justin H. C. Chan, 2012 .

Constrained Ramsey numbers of graphs

Alan C. H. Ling, Robert E. Jamison, Tao Jiang, 2003 .

The spectrum of cyclic group divisible designs with block size three

Alan C. H. Ling, Robert P. Gallant, Zhike Jiang, 1999 .

Construction Techniques for Anti‐Pasch Steiner Triple Systems

Charles J. Colbourn, Mike J. Grannell, Terry S. Griggs, 2000 .

Some New uniform frames with block size four and index one or three

Gennian Ge, Clement Lam, Alan C. H. Ling, 2004 .

Asymptotic Existence of Resolvable Graph Designs

Alan C. H. Ling, Peter J. Dukes, P. Dukes, 2007, Canadian Mathematical Bulletin.

Weakly union-free twofold triple systems

Charles J. Colbourn, Yeow Meng Chee, Alan C. H. Ling, 1997 .

Geometry, Combinatorial Designs and Related Structures: Rosa triple systems

Charles J. Colbourn, Alan C. H. Ling, C. Colbourn, 1997 .

Existence of balanced sampling plans avoiding cyclic distances

Alan C. H. Ling, Peter J. Dukes, P. Dukes, 2009 .

An Existence Theory for Incomplete Designs

Alan C. H. Ling, Esther R. Lamken, Peter J. Dukes, 2016, Canadian Mathematical Bulletin.

Asymptotic results on the existence of 4‐RGDDs and uniform 5‐GDDs

Gennian Ge, Alan C. H. Ling, G. Ge, 2005 .

A class of partial triple systems with applications in survey sampling

Charles J. Colbourn, Alan C. H. Ling, C. Colbourn, 1998 .

On the existence of resolvable K4 − e designs

Gennian Ge, Alan C. H. Ling, 2007 .

An Application of Permutation Arrays to Block Ciphers

Charles J. Colbourn, Alan C. H. Ling, A. U.S., 2007 .

Frames with block size four and index three

Alan C. H. Ling, Ying Miao, Sanpei Kageyama, 2002 .

The spectrum of ?-resolvable designs with block size four

Alan C. H. Ling, Troy Vasiga, Steven Furino, 2001 .