Author:
Apostolico A.,Giancarlo R.
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference6 articles.
1. Efficient string matching: An aid to bibliographic search;Aho;Comm. ACM,1975
2. Tests for unique decipherability;Even;IEEE Trans. Information Theory IT-9,1963
3. Graph Algorithms;Even,1973
4. A space economical suffix tree construction algorithm;McCreight;J. ACM,1976
5. A fast test for unique decipherability based on suffix trees;Rodeh;IEEE Trans. Information Theory IT-28,1982
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Deciding Whether two Codes Have the Same Ambiguities is in co-NP;2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2022-09
2. A novel test for unique decipherability of codes;Publicationes Mathematicae Debrecen;2011-04-01
3. Parsing with a finite dictionary;Theoretical Computer Science;2005-06
4. On unique, multiset, and set decipherability of three-word codes;IEEE Transactions on Information Theory;2001-07
5. Multiset and set decipherable codes;Computers & Mathematics with Applications;2001-05