dc.contributor.author |
Radue, J. E.
|
|
dc.date.accessioned |
2018-05-21T14:23:37Z |
|
dc.date.available |
2018-05-21T14:23:37Z |
|
dc.date.issued |
1979 |
|
dc.identifier.citation |
Radue, J.E. (1979 Text Compression Techniques. Quaestiones Informaticae, Vol 1 no 1, 1979 |
en |
dc.identifier.issn |
0254-2757 |
|
dc.identifier.uri |
http://hdl.handle.net/10500/23975 |
|
dc.description.abstract |
The benefits associated with text compression include more efficient use of peripheral devices. faster information transfer rates and, in some cases,
improved sorting speeds through the use of shorter sort keys. However. these advantages must be balanced against a slight increase in CPU-time and
the extra storage required for the associated code tables.
Information theory and statistics of English provide a background for the discussion of various text compression algorithms. The common
objective of the methods described is to reduce the physical size of the text file while maintaining a complete representation of the information
(reversible compression). The methods can be divided into two main classes:
( a) those that re-define the symbol codes to more accurate reflect the information content of each symbol, and
(b) those that use special codes to represent commonly occurring groups of symbols, thereby reducing redundancy due to mutual information between
symbols.
Compression techniques not covered include those dealing with data files and with telemetry.
Finally. another approach to compression is described. which also holds some promise for automatic indexing and simpler inverted file design in
document retrieval systems. |
en |
dc.language.iso |
en |
en |
dc.publisher |
Computer Society of South Africa (on behalf of SAICSIT) |
en |
dc.title |
Text Compression Techniques |
en |
dc.type |
Article |
en |
dc.description.department |
School of Computing |
en |