DocumentCode :
169444
Title :
A matrix completion approach to linear index coding problem
Author :
Esfahanizadeh, Homa ; Lahouti, Farshad ; Hassibi, Babak
Author_Institution :
Sch. of Electr. & Comput. Eng., Univ. of Tehran, Tehran, Iran
fYear :
2014
fDate :
2-5 Nov. 2014
Firstpage :
531
Lastpage :
535
Abstract :
In this paper, a general algorithm is proposed for rate analysis and code design of linear index coding problems. Specifically a solution for minimum rank matrix completion problem over finite fields representing the linear index coding problem is devised in order to find the optimum transmission rate given vector length and size of the field. The new approach can be applied to both scalar and vector linear index coding.
Keywords :
linear codes; matrix algebra; code design; linear index coding problem; minimum rank matrix completion problem; rate analysis; Encoding; Galois fields; Generators; Indexes; Matrix converters; Receivers; Vectors; Index Coding; Minimum Rank Matrix Completion over Finite Fields;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop (ITW), 2014 IEEE
Conference_Location :
Hobart, TAS
ISSN :
1662-9019
Type :
conf
DOI :
10.1109/ITW.2014.6970888
Filename :
6970888
Link To Document :
بازگشت