Near sufficiency of random coding for two descriptions

DOI10.1109/TIT.2005.862073MaRDI QIDQ3547216zbMATH OpenOpenAlexFDO

Authors Luis A. Lastras-Montaño, Vittorio Castelli

Publication date 21 December 2008

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

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

zbMATH Keywords

conversesditheringlossy codingmultiple descriptions (MD)random codingrate distortion theoryrate lossuniversal bounds

Mathematics Subject Classification ID

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

Recommendations

• Achievable rates for multiple descriptions
• New results in binary multiple descriptions
• Gaussian codes and Shannon bounds for multiple descriptions
• scientific article; zbMATH DE number 4204276
• Shannon-type bounds for multiple descriptions of a stationary source

This page was built for publication: Near sufficiency of random coding for two descriptions

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