Support material for: "On Successive Refinement of the Binary Symmetric Markov Source"

This technical report contains the proofs of a number of results that characterize for any n > 1 and for a certain high distortion region (Dn, 1/2), the symbols that are employed in the construction of good lossy codes for the nth order approximatin to the binary symmetric Markov source (BSMSn). These results are used is Lastras, Berger [1] to demontrate that for every n > 2, the BSMSn is not successively refinable [2], [3], [4].

By: Luis Lastras, Toby Berger

Published in: RC23160 in 2004


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .