"A fast test for unique decipherability based on suffix trees."

Michael Rodeh (1982)

> Home

Details and statistics

DOI: 10.1109/TIT.1982.1056535

access: closed

type: Journal Article

metadata version: 2020-03-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tit/Rodeh82
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/Rodeh82
Michael Rodeh:
A fast test for unique decipherability based on suffix trees. IEEE Trans. Inf. Theory 28(4): 648-651 (1982)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.