• DocumentCode
    962774
  • Title

    Counting Sequences with Large Local Distance

  • Author

    Cohn, Martin

  • Author_Institution
    Department of Computer Science, Brandeis University, Waltham, MA 02254.
  • Issue
    6
  • fYear
    1985
  • fDate
    6/1/1985 12:00:00 AM
  • Firstpage
    562
  • Lastpage
    562
  • Abstract
    The 2n n-bit vectors can be ordered so that any vector in the sequence has some minimum Hamming distance from any vector near it in the sequence.
  • Keywords
    Computer errors; Computer science; Counting circuits; Electrons; Hamming distance; Redundancy; Code; Hamming distance; counter; sequence;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1985.5009410
  • Filename
    5009410
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=962774