DocumentCode
1581304
Title
Pitman Shorthand inspired model for plain text compression
Author
Nagabhushan, P. ; Murali, S.
Author_Institution
Dept. of Studies in Comput. Sci., Mysore Univ., India
fYear
2001
fDate
6/23/1905 12:00:00 AM
Firstpage
322
Lastpage
326
Abstract
With the growing demand for text transmission and storage due to advent of Internet technology, text compression has gained its own momentum. Generally text is coded in ASCII format. Huffman coding or any other run length encoding techniques compresses the plain text. We propose a new method for plain text compression, which is mainly inspired by the concepts of Pitman Shorthand. The coding scheme successfully codes a group of successive 2-3 text characters into a single code. In this paper we have illustrated the implementation of the plain text compression using a new coding scheme, which is based on the concepts of Pitman Shorthand. Further application of Huffman coding on the codes generated is possible and is expected to result in a greater compression
Keywords
data compression; encoding; word processing; Huffman coding; Pitman shorthand; coding; data compression; run length encoding; text compression; Code standards; Computer science; Concatenated codes; Cryptography; Data compression; Encoding; Frequency; Histograms; Huffman coding; Internet;
fLanguage
English
Publisher
ieee
Conference_Titel
Document Analysis and Recognition, 2001. Proceedings. Sixth International Conference on
Conference_Location
Seattle, WA
Print_ISBN
0-7695-1263-1
Type
conf
DOI
10.1109/ICDAR.2001.953807
Filename
953807
Link To Document