Compact storage schemes for formatted files by spanning trees |
| |
| Authors: | J Ernvall O Nevalainen |
| |
| Institution: | (1) Department of Computer Science, University of Turku, SF-20500 Turku 50, Finland |
| |
| Abstract: | The use of spanning trees in the compression of data files is studied. A new upper bound for the length of the minimal spanning tree, giving the size of the compressed file, is derived. A special front compression technique is proposed for unordered files. The space demands are compared to an information theoretical lower bound of the file size. |
| |
| Keywords: | File compression Compression by differencing Spanning trees Front compression File structures Hamming-distance |
| 本文献已被 SpringerLink 等数据库收录！ |
