Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/48642
Title: On index coding with side information
Authors: Dau, Son Hoang
Keywords: DRNTU::Science::Mathematics
Issue Date: 2012
Source: Dau, S. H. (2012). On index coding with side information. Doctoral thesis, Nanyang Technological University, Singapore.
Abstract: Index Coding with Side Information (ICSI) (Birk and Kol (1998)) is a communication scheme dealing with broadcast channels in which receivers have prior side information about the messages to be broadcast. Exploiting the knowledge about the side information, the sender may significantly reduce the number of required transmissions compared with the naive approach. As a consequence, the efficiency of the communication over this type of broadcast channels could be dramatically improved. While most of the known works on ICSI focus on the performances of index codes of various kinds, the security and error correction aspects of those codes have never been examined. One of our goals is to fill in this gap. We are able to show that each linear index code provides a certain level of security, and moreover, the well-known coset coding technique provides us a way to secure any linear index code. Our second goal is to study the computational aspects of the ICSI problem. We discover several new families of ICSI instances for which optimal linear index codes can be found in polynomial time. We also compute the optimal linear index codes for all ICSI instances described by graphs of orders at most 10, using a computer program.
URI: https://hdl.handle.net/10356/48642
DOI: 10.32657/10356/48642
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Theses

Files in This Item:
File Description SizeFormat 
V15_PhDThesis(3).pdfmain text1.04 MBAdobe PDFThumbnail
View/Open

Page view(s) 50

334
checked on Oct 29, 2020

Download(s) 50

152
checked on Oct 29, 2020

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.