Complexity aspects of guessing prefix codes

@article{Fraenkel1994ComplexityAO,
  title={Complexity aspects of guessing prefix codes},
  author={Aviezri S. Fraenkel and Shmuel Tomi Klein},
  journal={Algorithmica},
  year={1994},
  volume={12},
  pages={409-419}
}
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. 

From This Paper

Topics from this paper.
13 Citations
6 References
Similar Papers

Similar Papers

Loading similar papers…