Kieffer et al., “Grammar-Based Codes: A New Class of Universal Lossless Source Codes” May 2000, IEEE Transactions On Information Theory, vol. 46, No. 3, pp. 737-754.* |
Yang et al., “Efficient Universal Lossless Data Compression Algorithms Based on a Greedy Sequential Grammar Transform—Part one: Without Context Models” May 2000, IEEE Transactions On Information Theory, vol. 46, No. 3, pp. 755-777.* |
Yang, En-Hui, “Method for lossless data compression using greedy sequential grammar transform and sequential encoding”, Nov. 14, 2000; U.S. patent application No. 09/711,703. |
Rissanen, “Fast Universal Coding with Context Models” May 1999, IEE Transactions on Information Theory, vol. 43, No. 4. |
Yang et al., “Efficient Universal Lossless Data Compression Algorighms Based on a Greedy Contect-Dependent Sequential Grammar Transform” Jun. 2001, p. 78, IEEE. |
PCT International Search Report for PCT/CA03/01058, Nov. 13, 2003. |
Nancy et al., “Universal Lossless Compression Via Multilevel Pattern Matching” Jul. 2000, IEEE Transactions on Information Theory, vol. 46 No. 4. |
Yang et al., “Efficient Universal Lossless Data Compression Algorithms Based on a Greedy Sequencial Grammar Transform—Part One: Without Context Models” May 2000,pp. 1227-1245, IEEE Transactions on Information Theory, vol. 46 No. 3. |
Kieffer et al., “Lossless Data Compression Algorithms Based on Substitution Tables” May 1998, pp. 629-632, Proceedings of IEEE Canadian Conference on Electrical and Computer Engineering, Waterloo, Ontario, Canada. |
Yang, et al., “Universal Source Coding Theory Based on Grammar Transforms” Jun. 1999, pp. 75-77 Proceedings of the 1999 IEEE Information Theory and Communications Workshop, Kruger National Park, South Africa. |
Kieffer, et al., “Grammar-Based Codes: A New Class of Universal Lossless Source Codes” May 2000, pp. 737-754, IEEE Transactions on Information Theory, vol. 46 No. 3. |
Weinberger, et al., “A Sequential Algorithm for the Universal Coding of Finite Memory Sources” May 1992, pp. 1002-1014, IEEE Transactions on Information Theory, vol. 38 No. 3. |
Willems, et al., “The Context-Tree Weighting Method: Basic Properties” May 1995. Pp. 653-664, IEEE Transactions on Information Theory, vol. 41 No. 3. |
Nevill-Manning, et al., “Compression and Explanation Using Hierarchical Grammars” Mar. 1994. |
Apostolico, et al., “Off-Line Compression by Greedy Textual Substitution” Nov. 2000, pp. 1733-1744, Proceedings of the IEEE, vol. 88 No. 11. |
U.S. patent application Ser. No. 09/711,703, Yang, filed Nov. 14, 2000. |
Willems, “The Context-Tree Weighting Method: Extensions” Mar. 1998, pp. 792-798, IEEE Transactions on Information Theory, vol. 44 No. 2. |
Plotnik et al., “Upper Bounds on the Probability of Sequences Emitted by Finite-State Sources and on the Redundancy of the Lempel-Ziv Algorithm” Jan. 1992, pp. 66-72, IEEE Transactions on Information Theory, vol. 38, No. 1. |
Ziv et al., “Compression of Individual Sequences via Variable-Rate Coding” Sep. 1978, pp. 530-536, IEEE Transactions on Information Theory, vol. IT-24, No. 5. |
Rissanen et al., “Universal Modeling and Coding” Jan. 1981, IEEE Transactions on Information Theory, vol. IT-27 No. 1. |