On Achievability of an $(r,l)$ Fractional Linear Network Code
Information Theory
2016-07-07 v1 math.IT
Abstract
It is known that there exists a network, called as the M-network, which is not scalar linearly solvable but has a vector linear solution for message dimension two. Recently, a generalization of this result has been presented where it has been shown that for any integer , there exists a network which has a vector linear solution, but does not have a vector linear solution for . This paper presents a further generalization. Specifically, we show that for any positive integers and , there exists a network which has a fractional linear solution, but does not have a fractional linear solution for .
Cite
@article{arxiv.1607.01736,
title = {On Achievability of an $(r,l)$ Fractional Linear Network Code},
author = {Niladri Das and Brijesh Kumar Rai},
journal= {arXiv preprint arXiv:1607.01736},
year = {2016}
}
Comments
6 pages, 1 figure