Analysis and Code Design for the Binary CEO Problem Under Logarithmic Loss
Sign Up to like & getrecommendations! Published in 2018 at "IEEE Transactions on Communications"
DOI: 10.1109/tcomm.2018.2863377
Abstract: In this paper, we propose an efficient coding scheme for the binary Chief Executive Officer (CEO) problem under logarithmic loss criterion. Courtade and Weissman obtained the exact rate-distortion bound for a two-link binary CEO problem… read more here.
Keywords: logarithmic loss; problem logarithmic; ceo; binary ceo ... See more keywords
Universality of Logarithmic Loss in Fixed-Length Lossy Compression †
Sign Up to like & getrecommendations! Published in 2019 at "Entropy"
DOI: 10.3390/e21060580
Abstract: We established a universality of logarithmic loss over a finite alphabet as a distortion criterion in fixed-length lossy compression. For any fixed-length lossy-compression problem under an arbitrary distortion criterion, we show that there is an… read more here.
Keywords: compression; logarithmic loss; fixed length; lossy compression ... See more keywords