The implementation of two different algorithms for generating compact codes of some size N are presented. An analysis of both algorithms is given. in an attempt to prove whether or not the algorithms run in constant amortized time. Meta-Fibonacci sequences are also investigated in this paper. Using a particular numbering on k-ary trees, we find that a group of meta-Fibonacci sequences count the number of nodes at the bottom level of these k-ary trees. These meta-Fibonacci sequences are also related to compact codes. Finally, generating functions are proved for the meta-Fibonacci sequences discussed.
| Identifer | oai:union.ndltd.org:uvic.ca/oai:dspace.library.uvic.ca:1828/2101 |
| Date | 25 January 2010 |
| Creators | Deugau, Christopher Jordan |
| Contributors | Ruskey, Frank, Roelants van Baronaigien, Dominique |
| Source Sets | University of Victoria |
| Language | English, English |
| Detected Language | English |
| Type | Thesis |
| Rights | Available to the World Wide Web |
Page generated in 0.0026 seconds