Error exponents for successive refinement by partitioning

DOI10.1109/18.481803MaRDI QIDQ4880016zbMATH OpenOpenAlexFDO

Authors Prakash Narayan, Angelos Kanlis

Publication date 2 June 1996

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.481803

zbMATH Keywords

covering lemmaerror exponentsrate-distortion functionsuccessive refinement by partitioning

Mathematics Subject Classification ID

Rate-distortion theory in information and communication theory (94A34)

Recommendations

• Error estimation of two approximate partitioning algorithms
• On the size of errors in the method of successive approximations
• Error bounds for asymptotic approximations of the partition function
• Global error estimates for exponential splitting
• Error bounds for exponential operator splittings
• scientific article; zbMATH DE number 3937730
• scientific article; zbMATH DE number 736320
• Output error estimation for summation-by-parts finite-difference schemes
• Error estimates for the ESPRIT algorithm

Cited in

(4)

• Notes on Conditions for Successive Refinement of Information
• Error exponents in scalable source coding
• Notes on Conditions for Successive Refinement of Information
• Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources

This page was built for publication: Error exponents for successive refinement by partitioning

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