Abstract
A discrete memoryless source {X/sub k/} is to be coded into a binary stream of rate R bits/symbol such that {X/sub k/} can be recovered with minimum possible distortion. The system is to be optimized for best performance with two decoders, one of which has access to side-information about the source. For given levels of average distortion for these two decoders, the minimum achievable rate R (in the usual Shannon theory sense) is given as a per-letter minimization of information theoretic quantities. The problem is solved for two cases: where the encoder is and is not informed of the side-information. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
