On breaking a Huffman code

DOI10.1109/18.490558zbMATH Open0856.94021OpenAlexW2142090582MaRDI QIDQ4887072FDOQ4887072

Mojdeh Mohtashemi, Ronald L. Rivest, David Gillman

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

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.)

zbMATH Keywords

cryptographyHuffman codeMarkov sourcesindependent sources

Mathematics Subject Classification ID

Cryptography (94A60) Source coding (94A29)

Cited In (6)

• Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation
• Lightweight compression with encryption based on asymmetric numeral systems
• Randomized data partitioning with efficient search, retrieval and privacy-preservation
• Optimal synchronous coding
• Title not available (Why is that?)
• Optimal Prefix Codes And Huffman Codes

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)