Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Complexity aspects of guessing prefix codes

  • Published:
Algorithmica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Fraenkel, A. S., Mor, M., and Perl, Y., Is text compression by prefixes and suffixes practical?Acta Inform.,20 (1983), 371–389.

    Article  MathSciNet  Google Scholar 

  2. Garey, M. R., and Johnson, D. S.,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.

    MATH  Google Scholar 

  3. Huffman, D., A method for the construction of minimum redundancy codes,Proc. IRE,40 (1952), 1098–1101.

    Article  Google Scholar 

  4. Klein, S. T., Bookstein, A., and Deerwester, S., Storing text retrieval systems on CD-ROM: compression and encryption considerations,ACM Trans. Inform. Systems,7 (1989), 230–245.

    Article  Google Scholar 

  5. Rubin, F., Experiments in text file compression,Comm. ACM,19 (1976), 617–623.

    Article  Google Scholar 

  6. Rubin, F., Cryptographic aspects of data compression codes,Cryptologia,3 (1979), 202–205.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, 76100, Rehovot, Israel

    A. S. Fraenkel

  2. Department of Mathematics and Computer Science, Bar-Ilan University, 52900, Ramat Gan, Israel

    S. T. Klein

Authors
  1. A. S. Fraenkel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. T. Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Alberto Apostolico.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fraenkel, A.S., Klein, S.T. Complexity aspects of guessing prefix codes. Algorithmica 12, 409–419 (1994). https://doi.org/10.1007/BF01185434

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01185434

Key words

Search

Navigation