Complexity aspects of guessing prefix codes

DOI10.1007/BF01185434zbMath0844.94008MaRDI QIDQ1336967

Shmuel T. Klein, Aviezri S. Fraenkel

Publication date: 13 October 1997

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

complexityNP-completenessprefix codesencryptionHuffman codes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Prefix, length-variable, comma-free codes (94A45)

Related Items

Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation ⋮ Integrated Encryption in Dynamic Arithmetic Compression ⋮ Integrated encryption in dynamic arithmetic compression ⋮ Optimal Prefix Codes And Huffman Codes ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Is text compression by prefixes and suffixes practical?
• CRYPTOGRAPHIC ASPECTS OF DATA COMPRESSION CODES
• A Method for the Construction of Minimum-Redundancy Codes