Decomposition of underdetermined data

DOI10.1134/S1990478913010109MaRDI QIDQ5263798zbMATH OpenFDO

Authors L. A. Sholomov

Publication date 17 July 2015

Published in Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

decompositionpolynomial algorithmlower approximationunderdetermined sourceinformation equivalence

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• On an invariant for the problem of underdetermined data decomposing
• 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
• Binary representations of underdetermined data and superimposed codes

Cited in

(3)

• On the reducibility of alphabets for problems of underdetermined data coding
• On an invariant for the problem of underdetermined data decomposing
• Binary representations of underdetermined data and superimposed codes

This page was built for publication: Decomposition of underdetermined data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5263798)