Zobrazeno 1 - 10
of 66
pro vyhledávání: '"RAI, BRIJESH KUMAR"'
The idea of coded caching was introduced by Maddah-Ali and Niesen who demonstrated the advantages of coding in caching problems. To capture the essence of the problem, they introduced the $(N, K)$ canonical cache network in which $K$ users with indep
Externí odkaz:
http://arxiv.org/abs/2102.04797
The idea of coded caching for content distribution networks was introduced by Maddah-Ali and Niesen, who considered the canonical $(N, K)$ cache network in which a server with $N$ files satisfy the demands of $K$ users (equipped with independent cach
Externí odkaz:
http://arxiv.org/abs/2101.09785
Maddah-Ali and Niesen, in a seminal paper, introduced the notion of coded caching. The exact nature of the fundamental limits in this context has remained elusive even as several approximate characterizations have been found. A new optimal scheme for
Externí odkaz:
http://arxiv.org/abs/1905.08471
Autor:
Das, Niladri, Rai, Brijesh Kumar
It is known a vector linear solution may exist if and only if the characteristic of the finite field belongs to a certain set of primes. But, can increasing the message dimension make a network vector linearly solvable over a larger set of characteri
Externí odkaz:
http://arxiv.org/abs/1901.04820
Autor:
Das, Niladri, Rai, Brijesh Kumar
It is known that for any finite/co-finite set of primes there exists a network which has a rate $1$ solution if and only if the characteristic of the finite field belongs to the given set. We generalize this result to show that for any positive ratio
Externí odkaz:
http://arxiv.org/abs/1709.05970
Autor:
Das, Niladri, Rai, Brijesh Kumar
Sum-networks are networks where all the terminals demand the sum of the symbols generated at the sources. It has been shown that for any finite set/co-finite set of prime numbers, there exists a sum-network which has a vector linear solution if and o
Externí odkaz:
http://arxiv.org/abs/1610.08408
Autor:
Das, Niladri, Rai, Brijesh Kumar
It is known that there exists a multiple-unicast network which has a rate $1$ linear network coding solution if and only if the characteristic of the finite field belongs to a given finite or co-finite set of primes. In this paper, we show that for a
Externí odkaz:
http://arxiv.org/abs/1610.08004
Autor:
Das, Niladri, Rai, Brijesh Kumar
It is known that the Fano network has a vector linear solution if and only if the characteristic of the finite field is $2$; and the non-Fano network has a vector linear solution if and only if the characteristic of the finite field is not $2$. Using
Externí odkaz:
http://arxiv.org/abs/1609.05815
Recently designed cross-layer contention based synchronous MAC protocols like the PRMAC protocol, for wireless sensor networks (WSNs) enable a node to schedule multi-hop transmission of multiple data packets in a cycle. However, these systems accommo
Externí odkaz:
http://arxiv.org/abs/1609.01622
Autor:
Das, Niladri, Rai, Brijesh Kumar
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 t
Externí odkaz:
http://arxiv.org/abs/1607.01736