|Title:||A Universal Method of Coding (Equal-length-at-output Coding)
|Abstract:||Three different concepts of optimal coding method defined in  are compared: asymptotically optimal method of coding (AOMC), asymptotically optimal on the average method of coding (AOAMC) and universal method of codipg (UMC) for a class of sources. A sufficient condition of unversality for the class of Bernoullian sources with a given alphabet is found in terms of quasi-entropy of input words. In  a notion of a monotone source is introduced and used in the construction of a method of coding called K-method, where input words of various length are encoded in output words of a equal length. In this work it is proved that K-method is an AOMC for any monotone sourec, in particular, for a Bernoullian source. A special case of the K-method is considered and proved to be a UMC for the class of all Bernoullian sources with a given alphabet.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1976/CS/CS0084), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1976
To the main CS technical reports page
Computer science department, Technion