• DocumentCode
    2003832
  • Title

    Separabilities of binary Gray codes designed over Z4

  • Author

    Park, Jung Pil ; Bose, Bella

  • Author_Institution
    Sch. of Electr. Eng. & Comput. Sci., Oregon State Univ., Corvallis, OR, USA
  • fYear
    2003
  • fDate
    29 June-4 July 2003
  • Firstpage
    187
  • Abstract
    Binary Gray codes can be designed from the Lee distance Gray codes over Z4 with the mapping: 0/00, 1/01, 2/11 and 3/10. For these codes of length n if the Hamming distance between the Gray codes g(i) and g(j) is d, where i and j are integers, then it is proved that |i-j|>(4/15)2d and |i-j|<2n-(4/15)2d for d odd, and |i-j|>(7/15)2d and |i-j|<(7/15)2d for d even.
  • Keywords
    Gray codes; Hamming codes; binary codes; Hamming distance; Lee distance; binary Gray code; Computer science; Hamming distance; Reflective binary codes; Upper bound; Yttrium; Zinc;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2003. Proceedings. IEEE International Symposium on
  • Print_ISBN
    0-7803-7728-1
  • Type

    conf

  • DOI
    10.1109/ISIT.2003.1228201
  • Filename
    1228201
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2003832