Three-layer composite coding for index coding

Yucheng Liu; Parastoo Sadeghi; Young Han Kim

doi:10.1109/ITW.2018.8613351

Three-layer composite coding for index coding

Yucheng Liu, Parastoo Sadeghi, Young Han Kim

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Citations (Scopus)

Abstract

We extend the composite coding (CC) scheme for the index coding problem from two layers to more layers of random binning. We explicitly introduce the three-layer composite coding (TLCC) scheme and provide the achievable rate region and the error analysis for it. We present a concrete non-trivial example with n = 7 messages where the TLCC strictly outperforms the CC scheme. We also present a number of simplification methods for the TLCC scheme towards better understanding of the scheme, as well as significantly reducing its computational complexity. We further prove that even a simplified version of the TLCC, which can be possibly weaker than the TLCC, still subsumes the CC scheme.

Original language	English
Title of host publication	2018 IEEE Information Theory Workshop, ITW 2018
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781538635995
DOIs	https://doi.org/10.1109/ITW.2018.8613351
Publication status	Published - 2 Jul 2018
Event	2018 IEEE Information Theory Workshop, ITW 2018 - Guangzhou, China Duration: 25 Nov 2018 → 29 Nov 2018

Publication series

Name	2018 IEEE Information Theory Workshop, ITW 2018

Conference

Conference	2018 IEEE Information Theory Workshop, ITW 2018
Country/Territory	China
City	Guangzhou
Period	25/11/18 → 29/11/18

Access to Document

10.1109/ITW.2018.8613351

Cite this

@inproceedings{1eed9dc00da44752af6d926953ab8e41,

title = "Three-layer composite coding for index coding",

abstract = "We extend the composite coding (CC) scheme for the index coding problem from two layers to more layers of random binning. We explicitly introduce the three-layer composite coding (TLCC) scheme and provide the achievable rate region and the error analysis for it. We present a concrete non-trivial example with n = 7 messages where the TLCC strictly outperforms the CC scheme. We also present a number of simplification methods for the TLCC scheme towards better understanding of the scheme, as well as significantly reducing its computational complexity. We further prove that even a simplified version of the TLCC, which can be possibly weaker than the TLCC, still subsumes the CC scheme.",

author = "Yucheng Liu and Parastoo Sadeghi and Kim, {Young Han}",

note = "Publisher Copyright: {\textcopyright} 2018 IEEE Information Theory Workshop, ITW 2018. All rights reserved.; 2018 IEEE Information Theory Workshop, ITW 2018 ; Conference date: 25-11-2018 Through 29-11-2018",

year = "2018",

month = jul,

day = "2",

doi = "10.1109/ITW.2018.8613351",

language = "English",

series = "2018 IEEE Information Theory Workshop, ITW 2018",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2018 IEEE Information Theory Workshop, ITW 2018",

address = "United States",

}

Three-layer composite coding for index coding. / Liu, Yucheng; Sadeghi, Parastoo; Kim, Young Han.
2018 IEEE Information Theory Workshop, ITW 2018. Institute of Electrical and Electronics Engineers Inc., 2018. 8613351 (2018 IEEE Information Theory Workshop, ITW 2018).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Three-layer composite coding for index coding

AU - Liu, Yucheng

AU - Sadeghi, Parastoo

AU - Kim, Young Han

PY - 2018/7/2

Y1 - 2018/7/2

N2 - We extend the composite coding (CC) scheme for the index coding problem from two layers to more layers of random binning. We explicitly introduce the three-layer composite coding (TLCC) scheme and provide the achievable rate region and the error analysis for it. We present a concrete non-trivial example with n = 7 messages where the TLCC strictly outperforms the CC scheme. We also present a number of simplification methods for the TLCC scheme towards better understanding of the scheme, as well as significantly reducing its computational complexity. We further prove that even a simplified version of the TLCC, which can be possibly weaker than the TLCC, still subsumes the CC scheme.

AB - We extend the composite coding (CC) scheme for the index coding problem from two layers to more layers of random binning. We explicitly introduce the three-layer composite coding (TLCC) scheme and provide the achievable rate region and the error analysis for it. We present a concrete non-trivial example with n = 7 messages where the TLCC strictly outperforms the CC scheme. We also present a number of simplification methods for the TLCC scheme towards better understanding of the scheme, as well as significantly reducing its computational complexity. We further prove that even a simplified version of the TLCC, which can be possibly weaker than the TLCC, still subsumes the CC scheme.

UR - http://www.scopus.com/inward/record.url?scp=85062096628&partnerID=8YFLogxK

U2 - 10.1109/ITW.2018.8613351

DO - 10.1109/ITW.2018.8613351

M3 - Conference contribution

T3 - 2018 IEEE Information Theory Workshop, ITW 2018

BT - 2018 IEEE Information Theory Workshop, ITW 2018

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2018 IEEE Information Theory Workshop, ITW 2018

Y2 - 25 November 2018 through 29 November 2018

ER -

Three-layer composite coding for index coding

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this