• DocumentCode
    1197622
  • Title

    Lower bounds on achievable rates for limited bitshift correcting codes

  • Author

    Kolesnik, Victor D. ; Krachkovsky, Victor Yu

  • Author_Institution
    St. Petersburg Acad. of Aerospace Instrum., Russia
  • Volume
    40
  • Issue
    5
  • fYear
    1994
  • fDate
    9/1/1994 12:00:00 AM
  • Firstpage
    1443
  • Lastpage
    1458
  • Abstract
    Limited codes (runlength-limited, charge constrained, and so on) capable of correcting shifts of their symbols are considered. The error-correction ability is characterized by the minimal bitshift distance dBS of a code. For a given δ=dBS/n, where n is the code length, the achievable code rate Rα is lower bounded. We prove the existence of codes of rate R⩾Rα
  • Keywords
    encoding; error correction codes; achievable code rate; charge constrained codes; code length; limited bitshift correcting codes; lower bounds; minimal bitshift distance; runlength-limited codes; Binary sequences; Block codes; Data communication; Digital recording; Eigenvalues and eigenfunctions; Hamming distance; Mutual information; Narrowband; Optical recording; Passband;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.333860
  • Filename
    333860
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1197622