Coded data generation or conversion – Digital code to digital code converters – To or from code based on probability
Reexamination Certificate
2007-10-16
2007-10-16
Young, Brian (Department: 2819)
Coded data generation or conversion
Digital code to digital code converters
To or from code based on probability
C341S087000
Reexamination Certificate
active
11278118
ABSTRACT:
Some aspects of the invention provide methods, systems, and computer program products for creating a static dictionary in which longer byte-strings are preferred. To that end, in accordance with aspects of the present invention, a new heuristic is defined to replace the aforementioned frequency count metric used to record the number of times a particular node in a data tree is visited. The new heuristic is based on counting the number of times an end-node of a particular byte-string is visited, while not incrementing a count for nodes storing characters in the middle of the byte-string as often as each time such nodes are visited. The result is an occurrence count metric that favours longer byte-strings, by being biased towards not incrementing the respective occurrence count values for nodes storing characters in the middle of a byte-string.
REFERENCES:
patent: 5151697 (1992-09-01), Bunton
patent: 5936560 (1999-08-01), Higuchi
patent: 6657564 (2003-12-01), Malik
patent: 7164370 (2007-01-01), Mishra
Iyer Balakrishna Raghavendra
Plachta Piotr M.
Sauer Wolfram
White Steven Wayne
LandOfFree
Methods of creating a dictionary for data compression does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Methods of creating a dictionary for data compression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods of creating a dictionary for data compression will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3900079