Pages that link to "Item:Q1336967"
From MaRDI portal
The following pages link to Complexity aspects of guessing prefix codes (Q1336967):
Displaying 6 items.
- Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation (Q2003332) (← links)
- Integrated encryption in dynamic arithmetic compression (Q2042727) (← links)
- Optimal Prefix Codes And Huffman Codes (Q4464415) (← links)
- (Q5140715) (← links)
- Integrated Encryption in Dynamic Arithmetic Compression (Q5738993) (← links)
- Randomized data partitioning with efficient search, retrieval and privacy-preservation (Q6591482) (← links)