Main Page Alphabetical List Compound List File List Compound Members File Members
huffw.c File Reference
The Huffword byte-aligned and tagged compression algorithm. Here every codeword is derived from a Huffman tree of fanout 128, by appending to each group of 7-bits a tagging bit which is 1 for the first group and 0 for the others. The program allows to choose two distinct parsing rules for the dictionary formation. For details see [deMoura, Navarro, Ziviani, Baeza-Yates, ACM Trans Info Syst, 2000].
More...
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/mman.h>
#include <sys/stat.h>
#include <unistd.h>
#include <errno.h>
#include <ctype.h>
#include <math.h>
#include "HuffwordLib.h"
Go to the source code of this file.
Functions |
int | main (int argc, char *argv[]) |
Detailed Description
The Huffword byte-aligned and tagged compression algorithm. Here every codeword is derived from a Huffman tree of fanout 128, by appending to each group of 7-bits a tagging bit which is 1 for the first group and 0 for the others. The program allows to choose two distinct parsing rules for the dictionary formation. For details see [deMoura, Navarro, Ziviani, Baeza-Yates, ACM Trans Info Syst, 2000].
-
Author:
-
Paolo Ferragina, Dipartimento di Informatica, Pisa (Italy).
-
Date:
-
November 2002.
Definition in file huffw.c.
Function Documentation
int main |
( |
int |
argc, |
|
|
char * |
argv[] |
|
) |
|
|
Generated on Mon Mar 31 14:44:30 2003 by
1.2.14 written by Dimitri van Heesch,
© 1997-2002