Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On Achievability of an $(r,l)$ Fractional Linear Network Code (1607.01736v1)

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

Citations (4)

Summary

We haven't generated a summary for this paper yet.