Sharma-Mittal entropy and coding theorem.(Report): An article from: Tamsui Oxford Journal of Information and Mathematical Sciences
Book Details
Author(s)Satish Kumar, Arun Choudhary
PublisherAletheia University
ISBN / ASINB00EEW56SQ
ISBN-13978B00EEW56S1
MarketplaceFrance 🇫🇷
Description
This digital document is an article from Tamsui Oxford Journal of Information and Mathematical Sciences, published by Aletheia University on February 1, 2013. The length of the article is 2478 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available immediately after purchase. You can view it with any web browser.
From the author: Keywords and Phrases: Shannon inequality, Codeword length, Holder's inequality, Kraft inequality, Optimal code length.
Citation Details
Title: Sharma-Mittal entropy and coding theorem.(Report)
Author: Satish Kumar
Publication:Tamsui Oxford Journal of Information and Mathematical Sciences (Magazine/Journal)
Date: February 1, 2013
Publisher: Aletheia University
Volume: 29 Issue: 1 Page: 19(9)
Article Type: Report
Distributed by Gale, a part of Cengage Learning
From the author: Keywords and Phrases: Shannon inequality, Codeword length, Holder's inequality, Kraft inequality, Optimal code length.
Citation Details
Title: Sharma-Mittal entropy and coding theorem.(Report)
Author: Satish Kumar
Publication:Tamsui Oxford Journal of Information and Mathematical Sciences (Magazine/Journal)
Date: February 1, 2013
Publisher: Aletheia University
Volume: 29 Issue: 1 Page: 19(9)
Article Type: Report
Distributed by Gale, a part of Cengage Learning
