On coding of underdetermined sequences with a fidelity criterion

DOI10.1134/S1064562409060246zbMATH Open1184.94275MaRDI QIDQ845514FDOQ845514

Authors: L. A. Sholomov 

Publication date: 29 January 2010

Published in: Doklady Mathematics (Search for Journal in Brave)

Recommendations

• THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES
• Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form
• Entropy of underdetermined sequences under constraints to specifications
• The strong converse for source coding with a fidelity criterion
• Efficient prefix coding of uncertainty spaces

zbMATH Keywords

codingcombinatorial entropyunderdetermined sequences

Mathematics Subject Classification ID

Information theory (general) (94A15) Measures of information, entropy (94A17) Source coding (94A29) Combinatorial codes (94B25)

Cites Work

• Title not available (Why is that?)

Cited In (2)

• Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form
• Block-definition approaches to source coding with a fidelity criterion

This page was built for publication: On coding of underdetermined sequences with a fidelity criterion

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