50 citations · 106 across the 15 of their papers we have counts for
16 papers
Continuous Noise Model for Quantum Circuits
Yunos El Kaderi, Andreas Honecker, Iryna Andriyanova
Quantum noise is a central challenge in quantum computing across many applications. Extensive work has examined how qubits couple to their environment, leading to decoherence and i…
Performance of Uncoded Implementation of Grover's Algorithm on Today's Quantum Processors
Yunos El Kaderi, Andreas Honecker, Iryna Andriyanova
This work tests the performance of Grover's search circuits on some IBM superconducting quantum devices in case of the size of search space and . Ideally, we expect…
EBP-GEXIT Charts for M-ary AWGN Channel for Generalized LDPC and Turbo Codes
Arti Yardi, Tarik Benaddi, Charly Poulliat +1
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…
Dynamic Coded Caching in Wireless Networks
Jesper Pedersen, Alexandre Graell i Amat, Jasper Goseling +3
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…
Routing and Network Coding over a Cyclic Network for Online Video Gaming
Marwa Dammak, Iryna Andriyanova, Yassine Boujelben +1
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 o…
Code Constructions for Distributed Storage With Low Repair Bandwidth and Low Repair Complexity
Siddhartha Kumar, Alexandre Graell i Amat, Iryna Andriyanova +2
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 toleran…
Optimizing MDS Coded Caching in Wireless Networks with Device-to-Device Communication
Jesper Pedersen, Alexandre Graell i Amat, Iryna Andriyanova +1
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…
Distributed Storage in Mobile Wireless Networks with Device-to-Device Communication
Jesper Pedersen, Alexandre Graell i Amat, Iryna Andriyanova +1
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…
A Family of Erasure Correcting Codes with Low Repair Bandwidth and Low Repair Complexity
Siddhartha Kumar, Alexandre Graell i Amat, Iryna Andriyanova +1
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 Distributed Storage Allocations for Memory-Limited Systems
Iryna Andriyanova, Pablo M. Olmos
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…
Repair Scheduling in Wireless Distributed Storage with D2D Communication
Jesper Pedersen, Alexandre Graell i Amat, Iryna Andriyanova +1
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 de…
Proving Threshold Saturation for Nonbinary SC-LDPC Codes on the Binary Erasure Channel
Alexandre Graell i Amat, Iryna Andriyanova, Amina Piemontese
We analyze nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group for transmission over the binary erasure channel. We prove thresho…
Threshold Saturation for Nonbinary SC-LDPC Codes on the Binary Erasure Channel
Iryna Andriyanova, Alexandre Graell i Amat
We analyze the asymptotic performance of nonbinary spatially-coupled low-density parity-check (SC-LDPC) code ensembles defined over the general linear group on the binary erasure c…
New constructions of CSS codes obtained by moving to higher alphabets
Iryna Andriyanova, Denise Maurice, Jean-Pierre Tillich
We generalize a construction of non-binary quantum LDPC codes over $\F_{2^m}$ due to \cite{KHIS11a} and apply it in particular to toric codes. We obtain in this way not only codes…
On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes
Iryna Andriyanova, Jean-Pierre Tillich
This paper addresses the issue of design of low-rate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which needs to be sa…
Optimized IR-HARQ Schemes Based on Punctured LDPC Codes over the BEC
Iryna Andriyanova, Emina Soljanin
We study incremental redundancy hybrid ARQ (IR-HARQ) schemes based on punctured, finite-length, LDPC codes. The transmission is assumed to take place over time varying binary erasu…