Effective text compression with simultaneous digram and trigram encoding

Journal of Information Science

Volumn 13, Issue 3, 1987, Pages 159-164

  Wiäniewski, Janusz L ^a  

^a NICOLAUS COPERNICUS UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC - ENCODING; INFORMATION RETRIEVAL SYSTEMS;

DIGRAM ENCODING; EBCDIC CODE-WORDS; SHANNON'S SECOND ORDER MARKOFF PROCESS; TRIGRAM ENCODING;

INFORMATION THEORY;

EID: 0023255153     PISSN: 01655515     EISSN: 17416485     Source Type: Journal    
DOI: 10.1177/016555158701300306     Document Type: Article

References (19)

1. G.V. Cormack, Data compression on a database system, Comm. ACM 28 (12) (1985) 1336–1342.
2. J. Rissanen and G.G. Langdon, Arithmetic coding, IBM J. Res. Develop. 23 (2) (1979) 149–162.
3. T.Y. Young and P.S. Liu, Overhead storage consideration and a multilinear method for data file compression, IEEE Trans. Soft. Eng. 6 (1980) 340–347.
4. J.M. Bray, V.P. Nelson, P.A.D. deMaine and J.D. Irwin, Data compression techniques ease storage problems, Comp. Design 24 (14) (1985) 102–106.
5. D. Cooper and M.F. Lynch, Text compression using variable-to-fixed-length encodings, J. ASIS 33 (1982) 18–31.
6. J.A. Storer and T.G. Szymanski, Data compression via textual substitution, J. A C M 29 (4) (1982) 928–951.
7. D.G. Severance, A practitioner's guide to data base compression, Inform. Systems 8 (1) (1983) 51–62.
8. M. Snyderman and B. Hunt, The myriad virtues of text compaction, Datamation 16 (16) (1970) 36–40.
9. W.S. Schieber and G.W. Thomas, An algorithm for compaction of alphanumeric data, J. Lib. Automation 4 (1971) 198–206.
10. J.L. Wiśniewski, On some data compression techniques based on the codable elements selection from sources with known statistical characteristics, Ph.D. Thesis, Warsaw Technical University, 1985.
11. B. Rudner, Construction of minimum-redundancy codes with an optimum synchronizing property, IEEE Trans. Inform. Theory 17 (1971) 478–487.
12. A. Bookstein and G. Fouty, A mathematical model for estimating the effectiveness of bigram coding, Inform. Process. Manag. 12 (1976) 111–116.
13. E.J. Schuegraf and H.S. Heaps, A comparison of algorithms for data base compression by use of fragments as language elements, Inform. Stor. Retr. 10 (1974) 309–319.
14. V.R. Walker, Compaction of names by x-grams, Proc. ASIS 6 (1969) 129–135.
15. M. Guazzo, A general minimum-redundancy source-coding algorithms, IEEE Trans. Inform. Theory 26 (1980) 15–25.
16. C.E. Shannon, A mathematical theory of communication, Bell System Techn. J. 27 (1948) 379–423, 623–656.
17. J.L. WiÅ›niewski, Compression of index term dictionary in an inverted-file-orientated data base: some effective algorithms, Inform. Process. Manag. 6 (1986) 493–501.
18. M.F. Lynch, J.H. Petrie and M.J. Snell, Analysis of microstructure of titles in the INSPEC data base, Inform. Stor. Retr. 9 (1973) 331–337.
19. E.S. Schwartz, Dictionary for minimum redundancy encoding, J. ACM 10 (1963) 413–439.