Complexity aspects of guessing prefix codes |
| |
| Authors: | A. S. Fraenkel S. T. Klein |
| |
| Affiliation: | (1) Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, 76100 Rehovot, Israel;(2) Department of Mathematics and Computer Science, Bar-Ilan University, 52900 Ramat Gan, Israel |
| |
| Abstract: | Given a natural language cleartext and a ciphertext obtained by Huffman coding, the problem of guessing the code is shown to be NP-complete for various variants of the encoding process. |
| |
| Keywords: | Prefix codes Huffman codes Encryption Complexity NP-completeness |
| 本文献已被 SpringerLink 等数据库收录！ |
