151 results on '"Ling, Alan C.H."'
Search Results
2. Grooming traffic to minimize load
3. Optical grooming with grooming ratio nine
4. Graph designs for the eight-edge five-vertex graphs
5. Maximum uniformly resolvable designs with block sizes 2 and 4
6. Further results on [formula omitted]-PBDs
7. Minimum embedding of Steiner triple systems into [formula omitted]-designs II
8. Constructing strength three covering arrays with augmented annealing
9. Resolvable balanced incomplete block designs with subdesigns of block size 4
10. Optimal partitioned cyclic difference packings for frequency hopping and code synchronization
11. Linear size optimal q-ary constant-weight codes and constant-composition codes
12. Limit on the addressability of fault tolerant nanowire decoders
13. Group divisible codes and their application in the construction of optimal constant-composition codes of weight three
14. The sizes of optimal q-ary codes of weight three and distance four: a complete solution
15. A systematic construction for radar arrays
16. The PBD-closure of constant-composition codes
17. Linear programming bounds for balanced arrays
18. On PBIBD Designs Based on Triangular Schemes
19. Uniform Group Divisible Designs with Block Sizes Three and n
20. Scheduling CCRR tournaments
21. Point Code Minimum Steiner Triple Systems
22. Embedding path designs into kite systems
23. A systematic approach to some block design constructions
24. Group divisible designs with block size four and group type gum1 for small g
25. Grooming in unidirectional rings: K4− e designs
26. Splitting systems and separating systems
27. A survey on resolvable group divisible designs with block size four
28. Rosa triple systems
29. Sets of three pairwise orthogonal Steiner triple systems
30. An application of splittable 4-frames to coloring of Kn, n
31. Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs
32. Totally magic graphs
33. Permutation arrays for powerline communication and mutually orthogonal Latin squares
34. Asymptotically optimal erasure-resilient codes for large disk arrays
35. Modified group divisible designs with block size four
36. Relative Difference Sets Partitioned by Cosets
37. Kirkman school project designs
38. Resolvable Group Divisible Designs with Large Groups
39. Matching divisible designs with block size four
40. A finite embedding theorem for partial Steiner 3-designs
41. Difference triangle sets from affine planes
42. A Three-Factor Product Construction for Mutually Orthogonal Latin Squares
43. Linear spaces with small generated subspaces
44. Minimum embedding of Steiner triple systems into [formula omitted]-designs I
45. The Asymptotic Existence of Resolvable Group Divisible Designs
46. Optical grooming with grooming ratio nine
47. Optical grooming with grooming ratio eight
48. Further results on (v,{5,w∗},1)-PBDs
49. The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
50. Minimum embedding of Steiner triple systems into (K4−e)-designs II
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.