The following pages link to On breaking a Huffman code (Q4887072):
Displaying 6 items.
- Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation (Q2003332) (← links)
- Optimal Prefix Codes And Huffman Codes (Q4464415) (← links)
- Optimal synchronous coding (Q4828660) (← links)
- (Q5140715) (← links)
- Lightweight compression with encryption based on asymmetric numeral systems (Q6100062) (← links)
- Randomized data partitioning with efficient search, retrieval and privacy-preservation (Q6591482) (← links)