2,656 research outputs found
Improved error bounds for the erasure/list scheme: the binary and spherical cases
We derive improved bounds on the error and erasure rate for spherical codes
and for binary linear codes under Forney's erasure/list decoding scheme and
prove some related results.Comment: 18 pages, 3 figures. Submitted to IEEE Transactions on Informatin
Theory in May 2001, will appear in Oct. 2004 (tentative
Polar Codes for Distributed Hierarchical Source Coding
We show that polar codes can be used to achieve the rate-distortion functions
in the problem of hierarchical source coding also known as the successive
refinement problem. We also analyze the distributed version of this problem,
constructing a polar coding scheme that achieves the rate distortion functions
for successive refinement with side information.Comment: 14 page
Universal Source Polarization and an Application to a Multi-User Problem
We propose a scheme that universally achieves the smallest possible
compression rate for a class of sources with side information, and develop an
application of this result for a joint source channel coding problem over a
broadcast channel.Comment: to be presented at Allerton 201
- …