THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES (Q5151434): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3012503275 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5595624 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5146195 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3214803 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5672822 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5514082 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5659463 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of realization of partial Boolean functions by circuits of functional elements / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3931334 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Occam's razor, partially specified Boolean functions, string matching, and independent sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4296162 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4826833 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5842591 / rank | |||
Normal rank |
Latest revision as of 14:34, 24 July 2024
scientific article; zbMATH DE number 7312004
Language | Label | Description | Also known as |
---|---|---|---|
English | THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES |
scientific article; zbMATH DE number 7312004 |
Statements
THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES (English)
0 references
17 February 2021
0 references
underdetermined source
0 references
partially defined source
0 references
universal coding
0 references
polynomial method
0 references
source entropy
0 references
quasientropy of word
0 references
frequency class
0 references
combinatorial entropy
0 references
representative set
0 references
0 references
0 references
0 references