DATA-COMPRESSION VIA TEXTUAL SUBSTITUTION

被引：352

作者：

STORER, JA ^{[1
]}

SZYMANSKI, TG ^{[1
]}

机构：

[1] PRINCETON UNIV, PRINCETON, NJ 08544 USA

来源：

JOURNAL OF THE ACM | 1982年 / 29卷 / 04期

关键词：

D O I：

10.1145/322344.322346

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：928 / 951

页数：24

共 39 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[3] FAST STRING SEARCHING ALGORITHM [J].

BOYER, RS ;

MOORE, JS .

COMMUNICATIONS OF THE ACM, 1977, 20 (10) :762-772

[4] ON FINDING MINIMAL LENGTH SUPERSTRINGS [J].

GALLANT, J ;

MAIER, D ;

STORER, JA .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 20 (01) :50-58

[5]

Garey M. R., 1976, Theoretical Computer Science, V1, P237, DOI 10.1016/0304-3975(76)90059-1

[6] ENCODING VERBAL INFORMATION AS UNIQUE NUMBERS [J].

HAGAMEN, WD ;

WEBER, JC ;

LONG, HS ;

LINDEN, DJ .

IBM SYSTEMS JOURNAL, 1972, 11 (04) :278-&

[7] NEW TECHNIQUE FOR COMPRESSION AND STORAGE OF DATA [J].

HAHN, B .

COMMUNICATIONS OF THE ACM, 1974, 17 (08) :434-436

[8] A METHOD FOR THE CONSTRUCTION OF MINIMUM-REDUNDANCY CODES [J].

HUFFMAN, DA .

PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1952, 40 (09) :1098-1101

[9]

Karp R.M., 1972, COMPLEXITY COMPUTER

[10]

Knuth, 2010, COMBINATORIAL ALGORI, V4

← 1 2 3 4 →