In this paper, we introduce the notion of cost of guessing and provide an optimal strategy for guessing a random variable taking values on a finite set whereby each choice may be associated with a positive finite cost ...

In this paper, centralized and independent repair approaches based on device-to-device communication for the repair of the lost nodes have been investigated in a cellular network where distributed caching is applied whose ...

In this work, we consider a novel distributed data storage/caching scenario in a cellular setting where multiple nodes may fail/depart at the same time. In order to maintain the target reliability, we allow cooperative ...

In this study, we consider a hierarchically structured base station (BS)-assisted cellular system equipped with a backend distributed data storage in which nodes randomly arrive and depart the cell. We numerically motivate ...

We consider a novel distributed data storage/caching scenario in a cellular network, where multiple nodes may fail/depart simultaneously To meet reliability, we allow cooperative regeneration of lost nodes with the help ...

In distributed storage systems (DSS), an optimal code design must meet the requirements of efficient local data regeneration in addition to reliable data retention. Recently, lowdensity parity-check (LDPC) codes have been ...

Guessing a random variable with finite or countably infinite support in which each selection leads to a positive cost value has recently been studied within the context of "guessing cost". In those studies, similar to ...