
arXiv: 1509.05874
In this paper we consider noisy index coding problem over AWGN channel. We give an algorithm to map the index coded bits to appropriate sized PSK symbols such that for the given index code, in general, the receiver with large amount of side information will gain in probability of error performance compared to the ones with lesser amount, depending upon the index code used. We call this the \textbf{PSK side information coding gain}. Also, we show that receivers with large amount of side information obtain this coding gain in addition to the bandwidth gain whereas receivers with lesser amount of side information trade off this coding gain with bandwidth gain. Moreover, in general, the difference between the best and worst performance among the receivers is shown to be proportional to the length of the index code employed.
11 pages and 12 figures. Few tables have been included
FOS: Computer and information sciences, Computer Science - Information Theory, Information Theory (cs.IT)
FOS: Computer and information sciences, Computer Science - Information Theory, Information Theory (cs.IT)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
