In this paper, we develop a single-letter lower bound on the errorexponent for the problem of trellissourcecoding. We demonstrate that for the case of a binary source with the Hamming distortion measure, and for ra...
详细信息
In this paper, we develop a single-letter lower bound on the errorexponent for the problem of trellissourcecoding. We demonstrate that for the case of a binary source with the Hamming distortion measure, and for rates close to the rate-distortion curve, this bound is superior to Marton's block-codingexponent, for the same computational complexity.
暂无评论