DocumentCode
2350840
Title
Broadcasting with coded side information
Author
Shum, Kenneth W. ; Dai, Mingjun ; Sung, Chi Wan
Author_Institution
Inst. of Network Coding, Chinese Univ. of Hong Kong, Shatin, China
fYear
2012
fDate
9-12 Sept. 2012
Firstpage
89
Lastpage
94
Abstract
In the original index coding problem, each user has a set of uncoded packets as side information, and wants to decode some other packets from the source node. The source node aims at satisfying the demands of all users as quickly as possible. With linear network coding, this is accomplished by broadcasting linear combinations of the source packets over some finite field. Since the broadcast is performed over a wireless channel, a user may overhear some coded packets that are not intended to him/her. This motivates a generalization of the index coding problem to the case where linearly coded packets are used as side information. We show that this generalized linear index coding problem is equivalent to solving a system of multi-variable polynomial equations. A heuristic solution is constructed and is applied to the broadcast relay channel.
Keywords
broadcast channels; linear codes; polynomial approximation; wireless channels; broadcast relay channel; coded side information; finite field; generalized linear index coding problem; heuristic solution; linearly coded packets; multivariable polynomial equations; source node; source packets; wireless channel; Encoding; Indexes; Mathematical model; Polynomials; Relays; Vectors; Index coding; broadcast relay channel; network coding;
fLanguage
English
Publisher
ieee
Conference_Titel
Personal Indoor and Mobile Radio Communications (PIMRC), 2012 IEEE 23rd International Symposium on
Conference_Location
Sydney, NSW
ISSN
2166-9570
Print_ISBN
978-1-4673-2566-0
Electronic_ISBN
2166-9570
Type
conf
DOI
10.1109/PIMRC.2012.6362912
Filename
6362912
Link To Document