Compression of partially defined information
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2115490
- scientific article; zbMATH DE number 3463524
- Noiseless coding theorems corresponding to fuzzy entropies
- POSSIBILISTIC ENTROPIES AND THE COMPRESSION OF POSSIBILISTIC DATA
- THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES
Cites work
- scientific article; zbMATH DE number 3463483 (Why is no real title available?)
- scientific article; zbMATH DE number 3487351 (Why is no real title available?)
- scientific article; zbMATH DE number 1303598 (Why is no real title available?)
- scientific article; zbMATH DE number 3446442 (Why is no real title available?)
- scientific article; zbMATH DE number 3294098 (Why is no real title available?)
- scientific article; zbMATH DE number 3318548 (Why is no real title available?)
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
Cited in
(4)- Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form
- scientific article; zbMATH DE number 5815903 (Why is no real title available?)
- scientific article; zbMATH DE number 1984015 (Why is no real title available?)
- scientific article; zbMATH DE number 2115490 (Why is no real title available?)
This page was built for publication: Compression of partially defined information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q948597)