• DocumentCode
    969205
  • Title

    Sliding block codes between constrained systems

  • Author

    Ashley, Jonathan

  • Author_Institution
    IBM Almaden Res. Center, San Jose, CA, USA
  • Volume
    39
  • Issue
    4
  • fYear
    1993
  • fDate
    7/1/1993 12:00:00 AM
  • Firstpage
    1303
  • Lastpage
    1309
  • Abstract
    The construction of finite-state codes between constrained systems called sofic systems introduced by R. Karabed and B. Marcus (1988) is continued. It is shown that if Σ is a shift of finite type and S is a sofic system with k/n=h(S )/h(Σ), where h denotes entropy, there is a noncatastrophic finite-state invertible code from Σ to S at rate k:n if Σ and S satisfy a certain algebraic condition involving dimension groups, and Σ and S satisfy a certain condition on their periodic points. Moreover, if S is an almost finite type sofic system, then the decoder can be sliding block
  • Keywords
    block codes; directed graphs; finite state machines; constrained systems; decoder; dimension groups; directed graph; finite-state codes; noncatastrophic finite-state invertible code; periodic points; sliding block codes; sofic systems; Block codes; Decoding; Entropy; Information theory; Labeling;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.243447
  • Filename
    243447