article · 2013

Source Coding with Renyi's Entropy

Arun Choudhary, Satish Kumar, Arvind Kumar

Cited by 0Abstract and details only

Abstract

A new measure ,  L called average code word length of order  is defined and its relationship with Renyi’s entropy of order  is discussed. Using ,  L some coding theorems are proved under the condition . 1 = 1 =   i N

Cite this paper

APA 7

Choudhary, A., Kumar, S., & Kumar, A. (2013). Source Coding with Renyi's Entropy.

MLA 9

Choudhary, Arun, et al. “Source Coding with Renyi's Entropy.” no. 1, 2013, pp. 19–22.

Chicago

Choudhary, Arun, Satish Kumar, and Arvind Kumar. 2013. “Source Coding with Renyi's Entropy.”

Harvard

Choudhary, A., Kumar, S. and Kumar, A. (2013) ‘Source Coding with Renyi's Entropy’.

BibTeX

@article{choudhary2013source,
  title = {{Source Coding with Renyi's Entropy}},
  author = {Choudhary, Arun and Kumar, Satish and Kumar, Arvind},
  number = {1},
  pages = {19--22},
  year = {2013}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.