Complexity aspects of guessing prefix codes

DOI10.1007/BF01185434MaRDI QIDQ1336967zbMATH OpenFDO

Authors Aviezri S. Fraenkel, Shmuel T. Klein

Publication date 13 October 1997

Published in Algorithmica (Search for Journal in Brave)

zbMATH Keywords

complexityNP-completenessHuffman codesencryptionprefix codes

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3910298
• On the decomposition of prefix codes
• scientific article; zbMATH DE number 3878842
• scientific article; zbMATH DE number 3896325
• scientific article; zbMATH DE number 3930882
• Bounding the inefficiency of length-restricted prefix codes
• scientific article; zbMATH DE number 4077126
• scientific article; zbMATH DE number 1004582
• scientific article; zbMATH DE number 1284420
• scientific article; zbMATH DE number 2032371

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• CRYPTOGRAPHIC ASPECTS OF DATA COMPRESSION CODES
• Is text compression by prefixes and suffixes practical?

Cited in

(6)

• Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation
• An ambiguous coding scheme for selective encryption of high entropy volumes
• Randomized data partitioning with efficient search, retrieval and privacy-preservation
• Integrated encryption in dynamic arithmetic compression
• Integrated encryption in dynamic arithmetic compression
• Optimal Prefix Codes And Huffman Codes

This page was built for publication: Complexity aspects of guessing prefix codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336967)