Algorithms and combinatorics of maximal compact codes

Algorithms and combinatorics of maximal compact codes

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...

Full description

Bibliographic Details
Main Author: Deugau, Christopher Jordan
Other Authors: Ruskey, Frank
Language:English
en
Published: 2010
Subjects:
combinatorial analysis
algorithms
UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science
Online Access:http://hdl.handle.net/1828/2101
id ndltd-uvic.ca-oai-dspace.library.uvic.ca-1828-2101
record_format oai_dc
spelling ndltd-uvic.ca-oai-dspace.library.uvic.ca-1828-21012015-01-29T16:51:05Z Algorithms and combinatorics of maximal compact codes Deugau, Christopher Jordan Ruskey, Frank Roelants van Baronaigien, Dominique combinatorial analysis algorithms UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science 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. 2010-01-25T17:54:08Z 2010-01-25T17:54:08Z 2006 2010-01-25T17:54:08Z Thesis http://hdl.handle.net/1828/2101 English en Available to the World Wide Web
collection NDLTD
language English
en
sources NDLTD
topic combinatorial analysis
algorithms
UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science
spellingShingle combinatorial analysis
algorithms
UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science
Deugau, Christopher Jordan
Algorithms and combinatorics of maximal compact codes
description 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.
author2 Ruskey, Frank
author_facet Ruskey, Frank
Deugau, Christopher Jordan
author Deugau, Christopher Jordan
author_sort Deugau, Christopher Jordan
title Algorithms and combinatorics of maximal compact codes
title_short Algorithms and combinatorics of maximal compact codes
title_full Algorithms and combinatorics of maximal compact codes
title_fullStr Algorithms and combinatorics of maximal compact codes
title_full_unstemmed Algorithms and combinatorics of maximal compact codes
title_sort algorithms and combinatorics of maximal compact codes
publishDate 2010
url http://hdl.handle.net/1828/2101
work_keys_str_mv AT deugauchristopherjordan algorithmsandcombinatoricsofmaximalcompactcodes
_version_ 1716729081270108160

Similar Items