English

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 m2m\geq 2, there exists a network which has a (m,m)(m,m) vector linear solution, but does not have a (w,w)(w,w) vector linear solution for w<mw<m. This paper presents a further generalization. Specifically, we show that for any positive integers k,n,k,n, and m2m\geq 2, there exists a network which has a (mk,mn)(mk,mn) fractional linear solution, but does not have a (wk,wn)(wk,wn) fractional linear solution for w<mw<m.

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

R2 v1 2026-06-22T14:47:24.578Z