An efficient algorithm for testing immutability of variable-length codes

No abstract is available for this paper.

• Publication year

  1989

• Venue

  IEEE Transactions on Information Theory

• Publication date

  1989-11-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/18.45290
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On testing for immutability of codes

  1987cited by this paper
• Efficient balanced codes

  1986cited by this paper
• Algorithms for Factorizing and Testing Subsemigroups

  1985cited by this paper
• Data Integrty in Digital Optical Disks

  1984cited by this paper
• A Note on Unique Decipherability

  1984cited by this paper
• A fast test for unique decipherability based on suffix trees

  1982cited by this paper
• How to Reuse a "Write-Once" Memory

  1982cited by this paper
• Tests for unique decipherability

  1963cited by this paper

• Deciding Code Related Properties by Means of Finite Transducers

  1993cites this paper
• Efficient q-ary immutable codes

  1991cites this paper
• Unidirectional error-detecting codes

  1990cites this paper
• Deciding the Immutability of Regular Codes and Languages Under Finite Transductions

  1989cites this paper