5 papers
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…
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…
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…