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

  • Authors:

  • M. Rodeh

  • Affiliations:

  • -

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.84

Visualization

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 isO(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.