• DocumentCode
    935104
  • Title

    A fast test for unique decipherability based on suffix trees (Corresp.)

  • Author

    Rodeh, Michael

  • Volume
    28
  • Issue
    4
  • fYear
    1982
  • fDate
    7/1/1982 12:00:00 AM
  • Firstpage
    648
  • Lastpage
    651
  • Abstract
    The classical algorithm for testing unique decipherability of codes is improved by using McCreight\´s algorithm for constructing suffix trees. The complexity of the algorithm is O(nm) where n is the number of codewords and m is their total length. Efficiency is gained by avoiding repeatedly comparing subwords of the codewords.
  • Keywords
    Trees; Binary sequences; Block codes; Decoding; Encoding; Hafnium; Notice of Violation; Table lookup; Testing;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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