CRYPTOGRAPHIC ASPECTS OF DATA COMPRESSION CODES

DOI10.1080/0161-117991854061zbMATH Open0416.94014OpenAlexW1973977583MaRDI QIDQ3206867FDOQ3206867

Authors: F. Rubin 

Publication date: 1979

Published in: Cryptologia (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0161-117991854061

zbMATH Keywords

cryptographyHuffman codenatural languagesarithmetic codedata compression codes

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Cryptography (94A60) Artificial intelligence (68T99) Arithmetic codes (94B40)

Cited In (8)

• An ambiguous coding scheme for selective encryption of high entropy volumes
• Applications of non-uniquely decodable codes to privacy-preserving high-entropy data representation
• Randomized data partitioning with efficient search, retrieval and privacy-preservation
• Über die implementierung redundanzfreier Codes zur datenverschlüsselung
• Optimal synchronous coding
• Complexity aspects of guessing prefix codes
• Title not available (Why is that?)
• Optimal Prefix Codes And Huffman Codes

This page was built for publication: CRYPTOGRAPHIC ASPECTS OF DATA COMPRESSION CODES

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