Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form

DOI10.1134/S0032946020040079zbMath1459.94082OpenAlexW3125132828MaRDI QIDQ2229580

L. A. Sholomov

Publication date: 18 February 2021

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

Full work available at URL: https://doi.org/10.1134/s0032946020040079

zbMATH Keywords

polynomial algorithmspecificationuniversal codingcombinatorial entropy of classentropy of underdetermined sourcequasientropy of wordunderdetermined sourceunderdetermined source coding

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Source coding (94A29)

Cites Work

• On coding of underdetermined sequences with a fidelity criterion
• Compression of partially defined information
• Occam's razor, partially specified Boolean functions, string matching, and independent sets
• THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form