In this paper we present a new algorithm called b64pack11b64 stands for Base64. for compression of very short text messages. The algorithm executes in two phases: in the first phase, it converts the input text consisting of letters, numbers, spaces and punctuation marks commonly used in English writings to a format which can be compressed in the second phase. The second phase consists of a transformation which reduces the size of the message by a fixed fraction of its original size. We experimentally measured both the compression speed and the compression ratio of b64pack on a large number of short messages and compared them with compress, gzip and bzip2, three most common UNIX compression programs. We show that in case of short text messages up to a certain size b64pack achieves better compression than any of the three programs. With respect to speed, b64pack beats all three algorithms by orders of magnitudes. This rapid compression is one of the key strengths of b64pack. We introduce b64pack, an efficient method for compression of short text messages.b64pack is based on standards which facilitate easy deployment and interoperability.We compare b64pack with common UNIX compression programs, compress, gzip and bzip2.b64pack achieves better compression of short messages than compress, gzip and bzip2.b64pack is faster than compress, gzip and bzip2 by orders of magnitudes.
[1]
Frank H. P. Fitzek,et al.
Low-complexity compression of short messages
,
2006,
Data Compression Conference (DCC'06).
[2]
Amar Mukherjee,et al.
The Burrows-Wheeler Transform:: Data Compression, Suffix Arrays, and Pattern Matching
,
2008
.
[3]
Frank H. P. Fitzek,et al.
Compression of Short Text on Embedded Systems
,
2006,
J. Comput..
[4]
Ying Li,et al.
Improving PPM Algorithm Using Dictionaries
,
2011,
2011 Data Compression Conference.
[5]
David M. Balenson,et al.
Privacy Enhancement for Internet Electronic Mail: Part III: Algorithms, Modes, and Identifiers
,
1993,
RFC.
[6]
Amar Mukherjee,et al.
Data compression using encrypted text
,
1996,
Proceedings of Data Compression Conference - DCC '96.
[7]
Shoshana Neuburger,et al.
The Burrows-Wheeler transform: data compression, suffix arrays, and pattern matching by Donald Adjeroh, Timothy Bell and Amar Mukherjee Springer, 2008
,
2010
.
[8]
John Linn,et al.
Privacy enhancement for Internet electronic mail: Part I: Message encipherment and authentication procedures
,
1989,
RFC.