MSpace - DSpace at UofM >
Faculty of Graduate Studies (Electronic Theses and Dissertations) >
FGS - Electronic Theses & Dissertations (Public) >

Please use this identifier to cite or link to this item:

Title: Improvement to lotto design tables
Authors: Karim, Lutful
Supervisor: Dr. John van Rees,Computer Science
Examining Committee: Dr. P.C. Li, Computer Science Dr. R. Padmanabhan, Mathematics
Graduation Date: May 2005
Keywords: Lotto, Backtracking, Isomorphism
Issue Date: 31-Jan-2005
Abstract: An (n, k, p, t) lotto design is a collection of k-subsets of a set X of n numbers wherein every p-subset of X must intersect at least one k-subset in t or more elements. L(n,k,p,t) is the minimum number of k-subsets which guarantees an intersection of at least t numbers between any p-subset of X and at least one of the k-subsets. To determine L(n,k,p,t) is the main goal of lotto design research. In previous work on lotto designs, other researchers used sequential algorithms to find bounds for L(n,k,p,t). We will determine the number of non-isomorphic optimal lotto designs on 5 or 6 blocks for n,k,p,t <= 20 and also improve lower bounds for L(n,k,p,t) >= 6 if possible by a more efficient implementation of a backtracking algorithm.
Type: Electronic Thesis or Dissertation
Appears in Collection(s):FGS - Electronic Theses & Dissertations (Public)

Files in This Item:

File Description SizeFormat
removal_note.txt86 BTextView/Open
View Statistics

Items in MSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! MSpace Software Copyright © 2002-2010  Duraspace - Feedback