• DocumentCode
    569424
  • Title

    Some Disjoint Golomb Rectangles

  • Author

    Luo, Liang ; Zhao, Taiyin

  • Author_Institution
    Sch. of Transp., Wuhan Univ. of Technol., Wuhan, China
  • fYear
    2012
  • fDate
    17-19 Aug. 2012
  • Firstpage
    609
  • Lastpage
    611
  • Abstract
    A Golomb rectangle is an N × M array of ones and zeros such that the differences between the positions of every pair of ones in the rectangle, considered as vector, are distinct. Given a rectangle N × M, if a coloring c is used with N colors, of which each coloring induces a Golomb Rectangle, it is called an (N, M)-Golomb rectangle. In this note, by computer search, we obtain some (N, M)-Golomb rectangles for various parameters N, M.
  • Keywords
    geometry; graph colouring; sequences; set theory; vectors; Golomb ruler; Sidon set; computer search; disjoint Golomb rectangles; numerical graphs; numerical sequences; vector; Arrays; Computers; Educational institutions; Heuristic algorithms; Information theory; Strontium; Transforms; clique search; disjoint Golomb rectangle; heuristic search;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational and Information Sciences (ICCIS), 2012 Fourth International Conference on
  • Conference_Location
    Chongqing
  • Print_ISBN
    978-1-4673-2406-9
  • Type

    conf

  • DOI
    10.1109/ICCIS.2012.285
  • Filename
    6300588