Abstract: Ong and Ho developed optimal linear index codes for single uniprior index coding problems (ICPs) by finding a spanning tree for each strongly connected component of their information-flow ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback