On coding theorem connected with ‘useful’ entropy of order- β

Priti Jain and R. K. Tuteja

International Journal of Mathematics and Mathematical Sciences, 1989, vol. 12, 1-6

Abstract:

Guiasu and Picard [1] introduced the mean length for ‘useful’ codes. They called this length as the ‘useful’ mean length. Longo [2] has proved a noiseless coding theorem for this ‘useful’ mean length. In this paper we will give two generalizations of ‘useful’ mean length. After then the noiseless coding theorems are proved using these two generalizations.

Date: 1989
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/12/869018.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/12/869018.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:869018

DOI: 10.1155/S0161171289000232

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().