Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

SPIRE
2001
Springer

favoriteEmaildiscussreport

134views Information Technology» more SPIRE 2001»

Adding Security to Compressed Information Retrieval Systems

13 years 9 months ago

Adding Security to Compressed Information Retrieval Systems

Download www.de9.ime.eb.br

Word-based Huffman coding has widespread use in information retrieval systems. Besides its compressing power, it also enables the implementation of both indexing and searching schema in the compressed file. In this work, an algorithm that adds security to compressed data is proposed. It shows a small loss in coding, decoding and compression performances. The algorithm uses homophonic substitution, canonical Huffman codes and a secret key for enciphering.

Ruy Luiz Milidiú, C. Gomes de Mello, J. Fer

Real-time Traffic

Canonical Huffman Codes | Information Management | Information Retrieval Systems | SPIRE 2001 | Word-based Huffman Coding |

claim paper

Related Content

» Bitplane watermarking for zerotreecoded images

» On the Mapping of Index Compression Techniques on CSR Information Retrieval

» Hiding privacy information in video surveillance system

» A Hidden Markov Model Information Retrieval System

» Secure webbased retrieval of documents with usage controls

» Case Study An Implementation of a Secure Steganographic System

» Speech for Multimedia Information Retrieval

» Improving summarization performance by sentence compression a pilot study

» Attacking and repairing the winZip encryption scheme

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	SPIRE
Authors	Ruy Luiz Milidiú, C. Gomes de Mello, J. Fernandes

Comments (0)