Cleary, John G.Witten, Ian H.2008-02-272008-02-271982-07-01http://hdl.handle.net/1880/46121Using 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.EngComputer Scienceunknown1982-98-1710.11575/PRISM/31138