Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2006-04-11
2006-04-11
Le, Debbie M. (Department: 2167)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C707S793000, C707S793000
Reexamination Certificate
active
07028042
ABSTRACT:
A method for forming a maximal tree by searching statistical data of symbols from training data. A table is formed including a string having first and second ends, and a symbol of the training data in the first end and a minimal number of preceding symbols in the training data to make a context unique for the symbol. The contexts are sorted in lexical order with priority on the first end. A device for forming a maximal tree by searching statistical data of symbols from training data. The device forms a table including a string having first and second ends, and a symbol of the training data in the first end and a minimal number of preceding symbols in the training data to make the context unique for the symbol. The device sorts the contexts in lexical order with priority on the first end.
REFERENCES:
patent: 5627748 (1997-05-01), Baker et al.
patent: 6411958 (2002-06-01), Dijkstra
patent: 6606037 (2003-08-01), Ekstrand et al.
patent: 2001/0051941 (2001-12-01), Tonomura
patent: 2001/0056414 (2001-12-01), Christal et al.
patent: 2002/0141422 (2002-10-01), Hu
patent: 2003/0130981 (2003-07-01), Nehru et al.
patent: WO 02/075929 (2002-09-01), None
Streaming Lossless Data Compression Algorithm, ECMA, Jun. 2001, Internet www.emca.ch.
Manzini, An Analysis of the Burrows-Wheeler Transform, ACM May 2001, p. 669-677.
Elloumi, M., “Algorithms for the Shortest Exact Common Superstring Problem”, Computer Science Department, Faculty of Sciences of Tunis, SACJ/SART, No. 26, 2000, pp. 22-26.
Balkenhol, B. and Kurtz, S., “Universal Data Compression Based on the Burrows-Wheeler Transformation”, IEEE Trans. on Computers, vol. 49, No. 10, Oct. 2000, pp. 1043-1053.
McCreight, E., “A Space-Economical Suffix Tree Construction Algorithm”, J.ACM, vol. 23, No. 2, Apr. 1976, pp 262-272.
Sadakane, K., “A Fast Algorithm for Making Suffix Arrays and for Burrows-Wheeler Transformation”, 1998, 10 pages.
Weinberger, M.J., Rissanen, J. & Feder, M., “A Universal Finite Memory Source”, IEEE Transactions on Information Theory, vol. 41, No. 3, May 1995, pp 643-652.
Rissanen, J., “Lectures on Statistical Modeling Theory”, Tampere University of Technology, 1999, pp. 1-65.
Rissanen, J.: “A Universal Data Compression System”, IEEE Transactions on Information Theory, vol. IT-29, No. 5, pp 656-664, 1983.
Nohre, R., “Some Topics in Descriptive Complexity”, PhD Thesis, Linköping University, Linköping, Sweden, 1994, pp. 44-45.
Franklin Eric J.
Le Debbie M.
Venable LLP
LandOfFree
Lossless data compression system does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Lossless data compression system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lossless data compression system will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3608807