1 Ocak 2016 Dergi makalesi Açık Erişim

Demirkale, Fatih; Donovan, Diane M.; Kucukcifci, Selda; Yazici, Emine Sule

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<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:creator>Demirkale, Fatih</dc:creator>
  <dc:creator>Donovan, Diane M.</dc:creator>
  <dc:creator>Kucukcifci, Selda</dc:creator>
  <dc:creator>Yazici, Emine Sule</dc:creator>
  <dc:date>2016-01-01</dc:date>
  <dc:description>This work provides an orthogonal trade for all possible volumes N is an element of Z(+) \ {1, 2, 3, 4, 5, 7} for block size 4. All orthogonal trades of volume N &lt;= 15 are classified up to isomorphism for this block size. The intersection problem for orthogonal arrays with block size 4 is solved for all but finitely many possible exceptions.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/57879</dc:identifier>
  <dc:identifier>oai:zenodo.org:57879</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:source>GRAPHS AND COMBINATORICS 32(3) 903-912</dc:source>
  <dc:title>Orthogonal Trades and the Intersection Problem for Orthogonal Arrays</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>