ISSN:
1432-0541
Schlagwort(e):
Prefix codes
;
Huffman codes
;
Encryption
;
Complexity
;
NP-completeness
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Informatik
,
Mathematik
Notizen:
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.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01185434
Permalink