
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:title>DISJUNCTNESS PROPERTIES RESULTING FROM CONCATENATION OF GROUP TESTING MATRICES</dc:title>
  <dc:creator>Clardy, Melinda Bulin</dc:creator>
  <dc:description>This thesis discusses matrix properties as they relate to the idea of non-adaptive group testing. This is accomplished by first considering the history of group testing and then exploring existing results. The next chapter of this thesis discusses taking a given binary matrix and using this as an inner code with some symbol matrix as an outer code to create a new binary matrix. The process is called a concatenation construction and we will cover a few types including the orthogonal array construction, a 𝜆-separating hash family construction, code concatenation, and DNA Sudoku. We conclude by elaborating on primary results coming from orthogonal array construction and 𝜆-separating hash family constructions. These give results pertaining specifically to Steiner systems and cover-free families.</dc:description>
  <dc:description>M.S. in Applied Mathematics, May 2015</dc:description>
  <dc:contributor>Ellis, Robert</dc:contributor>
  <dc:date>2015</dc:date>
  <dc:date>2015-05</dc:date>
  <dc:type>Thesis</dc:type>
  <dc:format>application/pdf</dc:format>
  <dc:identifier>islandora:8021</dc:identifier>
  <dc:identifier>http://hdl.handle.net/10560/3502</dc:identifier>
  <dc:source>MATH / Applied Mathematics</dc:source>
  <dc:source>Illinois Institute of Technology</dc:source>
  <dc:language>en</dc:language>
  <dc:rights>In Copyright</dc:rights>
  <dc:rights>http://rightsstatements.org/page/InC/1.0/</dc:rights>
  <dc:rights>Restricted Access</dc:rights>
</oai_dc:dc>
