• DocumentCode
    745812
  • Title

    Codes for a long silence

  • Author

    Fachini, Emanuela ; Körner, János

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Rome "La Sapienza", Italy
  • Volume
    49
  • Issue
    8
  • fYear
    2003
  • Firstpage
    2020
  • Lastpage
    2023
  • Abstract
    We determine the exact exponential asymptotics of the maximum number of n-length binary strings any two of which differ in the following strong sense: there must be a coordinate in which one of them has a 1 in correspondence with a predetermined position within a "long run" of zeros in the other string. We discuss some generalizations and implications of this result.
  • Keywords
    binary codes; block codes; error correction codes; binary block codes; coordinate; correspondence; error correction; exact exponential asymptotics; generalizations; n-length binary strings; predetermined position; zero-error capacity; Binary sequences; Block codes; Computer science; Error correction codes; Information theory; Set theory;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2003.814933
  • Filename
    1214079
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=745812