• Title of article

    Enumeration of balanced ternary designs Original Research Article

  • Author/Authors

    Petteri Kaski، نويسنده , , Patric R.J. ostergard، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2004
  • Pages
    9
  • From page
    133
  • To page
    141
  • Abstract
    A (V,B;ρ1,ρ2,R;K,Λ) balanced ternary design is a pair image, where image is a V-set of points and image is a collection of B K-multisubsets of image called blocks, such that each point appears R times in the blocks and no block contains a point with multiplicity greater than two. Each point must appear in ρ1 blocks with multiplicity one and in ρ2 blocks with multiplicity two. Additionally, every pair of distinct points must appear exactly Λ times in the blocks of the design. A backtrack search algorithm with isomorph rejection is described and employed to enumerate the balanced ternary designs with V⩽10, B⩽30, and R⩽15 for all but 12 of the 155 possible design classes with these parameters.
  • Keywords
    Balanced ternary design , Orderly algorithm , Enumeration
  • Journal title
    Discrete Applied Mathematics
  • Serial Year
    2004
  • Journal title
    Discrete Applied Mathematics
  • Record number

    885838