Decomposition of underdetermined data

DOI10.1134/S1990478913010109zbMATH Open1324.94024MaRDI QIDQ5263798FDOQ5263798

L. A. Sholomov

Publication date: 17 July 2015

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

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

zbMATH Keywords

decompositionpolynomial algorithmlower approximationunderdetermined sourceinformation equivalence

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (2)

• ON AN INVARIANT FOR THE PROBLEM OF UNDERDETERMINED DATA DECOMPOSING
• On the reducibility of alphabets for problems of underdetermined data coding

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)