On an invariant for the problem of underdetermined data decomposing
From MaRDI portal
Recommendations
- Decomposition of underdetermined data
- Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form
- THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES
- Elements of underdetermined information theory
- On the concept of underdetermined alphabets of equal strength
Cites work
- Covering graphs with few complete bipartite subgraphs
- Decomposition of underdetermined data
- Elements of underdetermined information theory
- scientific article; zbMATH DE number 6004840 (Why is no real title available?)
- scientific article; zbMATH DE number 3150822 (Why is no real title available?)
- scientific article; zbMATH DE number 3582190 (Why is no real title available?)
- scientific article; zbMATH DE number 194333 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- On edge perfectness and classes of bipartite graphs
- On the concept of underdetermined alphabets of equal strength
- On the reducibility of alphabets for problems of underdetermined data coding
Cited in
(7)- A rule for the addition of entropies for underdetermined data
- The Föllmer–Schweizer decomposition under incomplete information
- Elements of underdetermined information theory
- Binary representations of underdetermined data and superimposed codes
- On the concept of underdetermined alphabets of equal strength
- Decomposition of underdetermined data
- Generalized rule for the addition of entropies for underdetermined data
This page was built for publication: On an invariant for the problem of underdetermined data decomposing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151198)