On breaking a Huffman code
From MaRDI portal
Publication:4887072
DOI10.1109/18.490558zbMath0856.94021OpenAlexW2142090582MaRDI QIDQ4887072
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
Related Items (5)
Optimal synchronous coding ⋮ Lightweight compression with encryption based on asymmetric numeral systems ⋮ Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation ⋮ Optimal Prefix Codes And Huffman Codes ⋮ Unnamed Item
This page was built for publication: On breaking a Huffman code