On breaking a Huffman code

DOI10.1109/18.490558MaRDI QIDQ4887072zbMATH OpenOpenAlexFDO

Authors David Gillman, Mojdeh Mohtashemi, Ronald L. Rivest

Publication date 31 July 1996

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/88cc4fd10a1b32eafc9c7478976bedb1f79c5e6e

zbMATH Keywords

cryptographyHuffman codeindependent sourcesMarkov sources

Mathematics Subject Classification ID

Source coding (94A29) Cryptography (94A60)

Recommendations

• Complexity aspects of guessing prefix codes
• Optimal Prefix Codes And Huffman Codes
• Self-synchronizing Huffman codes (Corresp.)
• On the redundancy of binary Huffman codes (Corresp.)

Cited in

(6)

• Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation
• Optimal Prefix Codes And Huffman Codes
• Optimal synchronous coding
• An ambiguous coding scheme for selective encryption of high entropy volumes
• Lightweight compression with encryption based on asymmetric numeral systems
• Randomized data partitioning with efficient search, retrieval and privacy-preservation

This page was built for publication: On breaking a Huffman code

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