scientific article

zbMATH Open0706.94004MaRDI QIDQ3487270

J. N. Kapur

Publication date: 1988

Title of this publication is not available (Why is that?)

zbMATH Keywords

measures of entropylower bound for codeword lengthNoiseless coding theorems

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)

Related Items (1)

Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity 👍 👎
• Noiseless coding theorems corresponding to fuzzy entropies 👍 👎
• Some More Noiseless Coding Theorem on Generalized R-Norm Entropy 👍 👎
• An achievable bound for optimal noiseless coding of a random variable (Corresp.) 👍 👎
• Optimal noiseless coding of random variables (Corresp.) 👍 👎
• The entropy theorem via coding bounds 👍 👎
• Second-order noiseless source coding theorems 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3487270)