.png){kind=icon}
Return
Optimal Error Correcting Index Codes for Some Generalized Index Coding Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2018.2878566.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The index coding with side-information problem introduced by Birk and Kol has been generalized to the case, where the transmissions are subjected to errors by Dau et al.. Lower and upper bounds on the optimal number of transmissions required to correct a specified number delta of errors were established. In another generalization of index coding problem, namely, generalized index coding (GIC) problem introduced by Dai et al., linear combination of the messages can be demanded and held as side information by the receivers. Error correction for GIC problems was studied and the bounds for optimal number of transmissions required for delta-error correcting generalized index codes were established by Byrne and Calderini. In this paper, for a particular class of GIC problems construction of optimal scalar linear index codes are discussed. For this class of GIC problems, the optimal linear delta-error correcting index codes are also constructed. As special cases, optimal linear error correcting codes are obtained for two classes of original index coding problems, namely, single-prior index coding problems and single unicast index coding problems with symmetric neighboring consecutive side information.
Keywords:
Generalized index coding
Error correcting index coding
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveIdentification of bridged CO2 binding in a Prussian blue analogue using neutron powder diffraction
PREAI
ShareSave
View more