THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES

DOI10.17223/20710410/47/4zbMath1455.94088OpenAlexW3012503275MaRDI QIDQ5151434

L. A. Sholomov

Publication date: 17 February 2021

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm693

zbMATH Keywords

universal codingpolynomial methodrepresentative setcombinatorial entropyquasientropy of wordunderdetermined sourcesource entropyfrequency classpartially defined source

Mathematics Subject Classification ID

Source coding (94A29)

Related Items (1)

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

Cites Work

• Occam's razor, partially specified Boolean functions, string matching, and independent sets
• On the complexity of realization of partial Boolean functions by circuits of functional elements
• Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs
• 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: THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES