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: | |
---|---|
Other Authors: | |
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 |