Index coding with side information via penalty method in rank minimisation
Index coding with side information (ICSI) problems can be represented as matrices. These matrices have unique properties with intuitive meaning in its matrix representation. It has been shown by recent studies that minimising the rank of these matrices are equivalent to solving the ICSI problems by...
Saved in:
Main Author: | Goh, You Hui |
---|---|
Other Authors: | Chua Chek Beng |
Format: | Final Year Project |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/76210 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
On index coding with side information
by: Dau, Son Hoang
Published: (2012) -
On the security of index coding with side information
by: Dau, Son Hoang, et al.
Published: (2013) -
Variable selection for high-dimensional varying coefficient partially linear models via nonconcave penalty
by: Hong, Zhaoping, et al.
Published: (2013) -
List decoding of rank-metric and cover-metric codes
by: Liu, Shu
Published: (2018) -
Generalised rank weights of quasi-cyclic codes
by: Lim, Enhui
Published: (2021)