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

Internet

http://hdl.handle.net/1828/2101

Similar Items