#### Filter Results:

- Full text PDF available (33)

#### Publication Year

1985

2017

- This year (0)
- Last 5 years (13)
- Last 10 years (40)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling
- Discrete Mathematics
- 2008

A covering array CA(N ; t, k, v) is an N Ã— k array such that every N Ã— t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. One application of theseâ€¦ (More)

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

We develop a connection between permutation arrays that are used in powerline communication and well-studied combinatorial objects, mutually orthogonal latin squares (MOLS). From this connection,â€¦ (More)

- Myra B. Cohen, Charles J. Colbourn, Alan C. H. Ling
- ISSRE
- 2003

Component based software development is prone to unexpected interaction faults. The goal is to test as many potential interactions as is feasible within time and budget constraints. Two combinatorialâ€¦ (More)

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

In this paper, we generalize the known topology-transparent medium access control protocols for mobile ad hoc networks by observing that their transmission schedule corresponds to an orthogonalâ€¦ (More)

Key predistribution in wireless sensor networks refers to the problem of distributing secret keys among sensors prior to deployment. Solutions appeared in the literature can be classified into twoâ€¦ (More)

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

We examine the combinatorial requirements of topology-transparent transmission schedules in a mobile ad hoc network (MANET). Specifically, if each of the N nodes has at mostD active neighbors, weâ€¦ (More)

- Yeow Meng Chee, Charles J. Colbourn, Alan C. H. Ling
- Discrete Applied Mathematics
- 2000

Reliability is a major concern in the design of large disk arrays. Hellerstein et al. pioneered the study of erasure-resilient codes that allow one to reconstruct the original data even in theâ€¦ (More)

- Alan C. H. Ling
- IEEE Trans. Information Theory
- 2002

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

Maekawa considered a simple but suboptimal grid-based quorum generation scheme in which N sites in the network are logically organized in the form of a âˆš N Ã—âˆšN grid, and the quorum sets areâ€¦ (More)

- Geoffrey Exoo, Alan C. H. Ling, John P. McSorley, Nicholas C. K. Phillips, Walter D. Wallis
- Discrete Mathematics
- 2002

A total labeling of a graph with v vertices and e edges is defined as a one-to-one map taking the vertices and edges onto the integers 1, 2, Â· Â· Â· , v+e. Such a labeling is vertex magic if the sum ofâ€¦ (More)