Loading...

Dynamic index coding gain over a complete bi-directional side information graph

Hadi, M ; Sharif University of Technology | 2016

751 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/IWCIT.2016.7491621
  3. Publisher: Institute of Electrical and Electronics Engineers Inc , 2016
  4. Abstract:
  5. Dynamic Index coding as a generalization of the traditional index coding problem, deals with transmission of some dynamic data flows in the presence of side information. For a dynamic index coding system, the set of average flow rates for which the system can be stable is named Code-Constraint Capacity region. In this paper, we identify the code-constraint capacity region for a dynamic index coding problem with complete bi-directional side information graph. Furthermore, we introduce the concept of Dynamic Index Coding Gain to quantify the improvement resulted from the dynamic index coding with respect to uncoded transmissions. We also provide some corollaries about system performance metrics such as delay and average number of queued packets. In addition, we show how time-sharing method may reduce transmission delay
  6. Keywords:
  7. Code-Constraint Capacity Region ; Dynamic Index Coding ; Dynamic Index Coding Gain ; Time-Sharing ; Information theory ; Capacity regions ; Code constraints ; Dynamic indices ; Performance metrics ; Side information ; Time-sharing ; Transmission delays ; Uncoded transmission ; Codes (symbols)
  8. Source: IWCIT 2016 - Iran Workshop on Communication and Information Theory, 3 May 2016 through 4 May 2016 ; 2016 ; 9781509019229 (ISBN)
  9. URL: http://ieeexplore.ieee.org/document/7491621