ARITHMETIC, ENUMERATIVE AND ADAPTIVE CODING
dc.contributor.author | Cleary, John G. | eng |
dc.contributor.author | Witten, Ian H. | eng |
dc.date.accessioned | 2008-02-27T22:24:23Z | |
dc.date.available | 2008-02-27T22:24:23Z | |
dc.date.computerscience | 1999-05-27 | eng |
dc.date.issued | 1982-07-01 | eng |
dc.description.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. | eng |
dc.description.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 | eng |
dc.identifier.department | 1982-98-17 | eng |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/31138 | |
dc.identifier.uri | http://hdl.handle.net/1880/46121 | |
dc.language.iso | Eng | eng |
dc.publisher.corporate | University of Calgary | eng |
dc.publisher.faculty | Science | eng |
dc.subject | Computer Science | eng |
dc.title | ARITHMETIC, ENUMERATIVE AND ADAPTIVE CODING | eng |
dc.type | unknown | |
thesis.degree.discipline | Computer Science | eng |
Files
License bundle
1 - 1 of 1