Deugau, Christopher Jordan2010-01-252010-01-2520062010-01-25http://hdl.handle.net/1828/2101The 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.enAvailable to the World Wide Webcombinatorial analysisalgorithmsUVic Subject Index::Sciences and Engineering::Applied Sciences::Computer scienceThesis