Algorithms and combinatorics of maximal compact codes
dc.contributor.author | Deugau, Christopher Jordan | |
dc.contributor.supervisor | Ruskey, Frank | |
dc.contributor.supervisor | Roelants van Baronaigien, Dominique | |
dc.date.accessioned | 2010-01-25T17:54:08Z | |
dc.date.available | 2010-01-25T17:54:08Z | |
dc.date.copyright | 2006 | en |
dc.date.issued | 2010-01-25T17:54:08Z | |
dc.degree.department | Dept. of Computer Science | en |
dc.degree.level | Master of Science M.Sc. | en |
dc.description.abstract | 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. | en |
dc.identifier.uri | http://hdl.handle.net/1828/2101 | |
dc.language | English | eng |
dc.language.iso | en | en |
dc.rights | Available to the World Wide Web | en |
dc.subject | combinatorial analysis | en |
dc.subject | algorithms | en |
dc.subject.lcsh | UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science | en |
dc.title | Algorithms and combinatorics of maximal compact codes | en |
dc.type | Thesis | en |