Zobrazeno 1 - 10
of 100
pro vyhledávání: '"Andriyanova, Iryna"'
Publikováno v:
2023 IEEE Information Theory Workshop (ITW), Saint-Malo, France, 2023, pp. 209-214
This work tests the performance of Grover's search circuits on some IBM superconducting quantum devices in case of the size of search space $N=2^4$ and $N=2^5$. Ideally, we expect to get an outcome probability distribution that is clearly peaked at t
Externí odkaz:
http://arxiv.org/abs/2212.10482
This work proposes a tractable estimation of the maximum a posteriori (MAP) threshold of various families of sparse-graph code ensembles, by using an approximation for the extended belief propagation generalized extrinsic information transfer (EBP-GE
Externí odkaz:
http://arxiv.org/abs/2103.05953
Autor:
Pedersen, Jesper, Amat, Alexandre Graell i, Goseling, Jasper, Brännström, Fredrik, Andriyanova, Iryna, Rosnes, Eirik
We consider distributed and dynamic caching of coded content at small base stations (SBSs) in an area served by a macro base station (MBS). Specifically, content is encoded using a maximum distance separable code and cached according to a time-to-liv
Externí odkaz:
http://arxiv.org/abs/2002.08080
Online video games are getting more popular, attracting a continuously growing number of players. The main performance metrics of this application on the network level are packet ordering, communication throughput and transmission latency. Nowadays t
Externí odkaz:
http://arxiv.org/abs/1803.11102
Autor:
Kumar, Siddhartha, Amat, Alexandre Graell i, Andriyanova, Iryna, Brännström, Fredrik, Rosnes, Eirik
We present the construction of a family of erasure correcting codes for distributed storage that achieve low repair bandwidth and complexity at the expense of a lower fault tolerance. The construction is based on two classes of codes, where the prima
Externí odkaz:
http://arxiv.org/abs/1801.05989
We consider the caching of content in the mobile devices in a dense wireless network using maximum distance separable (MDS) codes. We focus on an area, served by a base station (BS), where mobile devices move around according to a random mobility mod
Externí odkaz:
http://arxiv.org/abs/1701.06289
We consider the use of distributed storage (DS) to reduce the communication cost of content delivery in wireless networks. Content is stored (cached) in a number of mobile devices using an erasure correcting code. Users retrieve content from other de
Externí odkaz:
http://arxiv.org/abs/1601.00397
We present the construction of a new family of erasure correcting codes for distributed storage that yield low repair bandwidth and low repair complexity. The construction is based on two classes of parity symbols. The primary goal of the first class
Externí odkaz:
http://arxiv.org/abs/1505.03491
We consider distributed storage (DS) for a wireless network where mobile devices arrive and depart according to a Poisson random process. Content is stored in a number of mobile devices, using an erasure correcting code. When requesting a piece of co
Externí odkaz:
http://arxiv.org/abs/1504.06231
Autor:
Andriyanova, Iryna, Olmos, Pablo M.
In this paper we consider distributed allocation problems with memory constraint limits. Firstly, we propose a tractable relaxation to the problem of optimal symmetric allocations from [1]. The approximated problem is based on the Q-error function, a
Externí odkaz:
http://arxiv.org/abs/1504.04137