Universal coding for discrete memoryless sources uniform with respect to output

zbMATH Open0732.94007MaRDI QIDQ809982

Yu. M. Shtar'kov

Publication date: 1991

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) Measures of information, entropy (94A17) Source coding (94A29)

Recommendations

• Relative-redundancy universal coding of memoryless sources 👍 👎
• Multi-alphabet universal coding of memoryless sources 👍 👎
• Universal coding for memoryless sources with countably infinite alphabets 👍 👎
• Strong universal source coding subject to a rate-distortion constraint 👍 👎
• A sequential algorithm for the universal coding of finite memory sources 👍 👎
• Universal coding of nonstationary sources 👍 👎
• Universal decoding for channels with memory 👍 👎
• Fixed-rate universal lossy source coding and rates of convergence for memoryless sources 👍 👎
• A Universal Scheme for Wyner–Ziv Coding of Discrete Sources 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Universal coding for discrete memoryless sources uniform with respect to output

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