Title

Data Compression Using Encrypted Text

Abstract

A new algorithm for text compression is presented. The basic idea of the algorithm is to define a unique encryption or signature of each word in the dictionary by replacing certain characters in the words by a special character '*' and retaining a few characters so that the word is still retrievable. For any encrypted text the most frequently used character is '*' and the standard compression algorithms can exploit this redundancy in an effective way. Better results are reported for most widely used compression algorithms such as Huffman, LZW, Arithmetic, unix compress, gnu-zip with respect to a text corpus. The compression rates using these algorithms are much better than the dictionary based methods reported in the literature.

Publication Date

1-1-1996

Publication Title

Proceedings of the Forum on Research and Technology Advances in Digital Libraries, ADL

Number of Pages

130-138

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

Socpus ID

0029723155 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0029723155

This document is currently not available here.

Share

COinS