Abstract
Using the close relationship between arithmetic and
enumerative codes, expressions are developed for the performance of various
non-adaptive codes. It is then shown that there exists adaptive codes whose
performance can be guaranteed to be better than or close to these non-adaptive
codes.
On some actual examples the adaptive codes are significantly better than
the non-adaptive ones.
Notes
We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca
