A Rate–Distortion Approach to Index Coding

DOI10.1109/TIT.2016.2608943MaRDI QIDQ2976516zbMATH OpenOpenAlexFDO

Authors Sinem Unal, Aaron B. Wagner

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.0258

Mathematics Subject Classification ID

Source coding (94A29)

Abstract: We approach index coding as a special case of rate-distortion with multiple receivers, each with some side information about the source. Specifically, using techniques developed for the rate-distortion problem, we provide two upper bounds and one lower bound on the optimal index coding rate. The upper bounds involve specific choices of the auxiliary random variables in the best existing scheme for the rate-distortion problem. The lower bound is based on a new lower bound for the general rate-distortion problem. The bounds are shown to coincide for a number of (groupcast) index coding instances, including all instances for which the number of decoders does not exceed three.

Cited in

(6)

• Optimal Index Codes With Near-Extreme Rates
• Everywhere-Tight Information Cost Tradeoffs for Augmented Index
• A Polynomial-Time Algorithm for Pliable Index Coding
• A Linear Encoding Approach to Index Assignment in Lossy Source-Channel Coding
• Capacity Theorems for Distributed Index Coding
• Source coding with quantum side information at several decoders

This page was built for publication: A Rate–Distortion Approach to Index Coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976516)