Publication

The Kaspi Rate-Distortion Problem with Encoder Side-Information: Binary Erasure Case

Emre Telatar, Etienne Perron
2006
Reports

Abstract

We consider the problem of compressing a binary symmetric i.i.d. source stream for two decoders, one of which has access to side-information. Kaspi found the rate-distortion tradeoff for this problem for general discrete memoryless sources for the two cases with and without encoder side-information. We focus on the case in which the encoder has access to side-information. We assume that the source has a symmetric Bernoulli distribution and that the side-information is the output of an erasure channel whose input is the source stream. We explicitly solve the optimization problem for this setup. We also show that the Wyner-Ziv rate-distortion function and the conditional rate-distortion function coincide for general discrete memoryless sources when the side-information is of the erasure type.

Official source

https://infoscience.epfl.ch/entities/publication/bb19545c-b738-4c88-b1f1-a47db7cdcd95

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Emre Telatar, Etienne Perron
2006
Reports

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/bb19545c-b738-4c88-b1f1-a47db7cdcd95

About this result

Related concepts (32)

Information theory

Information theory is the mathematical study of the quantification, storage, and communication of information. The field was originally established by the works of Harry Nyquist and Ralph Hartley, in the 1920s, and Claude Shannon in the 1940s. The field, in applied mathematics, is at the intersection of probability theory, statistics, computer science, statistical mechanics, information engineering, and electrical engineering. A key measure in information theory is entropy.

Binary symmetric channel

A binary symmetric channel (or BSCp) is a common communications channel model used in coding theory and information theory. In this model, a transmitter wishes to send a bit (a zero or a one), and the receiver will receive a bit. The bit will be "flipped" with a "crossover probability" of p, and otherwise is received correctly. This model can be applied to varied communication channels such as telephone lines or disk drive storage.

Binary erasure channel

In coding theory and information theory, a binary erasure channel (BEC) is a communications channel model. A transmitter sends a bit (a zero or a one), and the receiver either receives the bit correctly, or with some probability receives a message that the bit was not received ("erased") . A binary erasure channel with erasure probability is a channel with binary input, ternary output, and probability of erasure . That is, let be the transmitted random variable with alphabet .

Related publications (18)

The Kaspi Rate-Distortion Problem with Encoder Side-Information: Binary Erasure Case

Chat with Graph Search

Optimization of Pelton turbines start-up considering fatigue damage via a fracture mechanics model

A Reinforcement Learning Approach to Train Routing and Scheduling

Non-convex optimization for robust multi-view imaging