Vitaly Abdrashitov

Learn More
We study a generalization of the setting of regenerating codes, motivated by applications to storage systems consisting of clusters of storage nodes. There are n clusters in total, with m nodes per cluster. A data file is coded and stored across the mn nodes, with each node storing α symbols. For availability of data, we demand that the file is retrievable(More)
—We study a generalization of the setting of regenerating codes, motivated by applications to storage systems consisting of clusters of storage nodes. There are n clusters in total, with m nodes per cluster. A data file is coded and stored across the mn nodes, with each node storing α symbols. For availability of data, we demand that the file is retrievable(More)
—In cellular communications, user equipment (UE, i.e., mobile device)-side interference cancellation (IC) along with multicell coordinated scheduling can significantly reduce the effect of the downlink intercell interference. To aid UE-side IC, a study item, called network-assisted interference cancellation and suppression (NAICS), has been initiated for(More)
In distributed cloud storages fault tolerance is maintained by regenerating the lost coded data from the surviving clouds. Recent studies suggest using maximum distance separable (MDS) network codes in cloud storage systems to allow efficient and reliable recovery after node faults. MDS codes are designed to use a substantial number of repair nodes and rely(More)
In this paper we consider the additive white Gaussian noise channel with an average input power constraint in the power-limited regime. A well-known result in information theory states that the capacity of this channel can be achieved by random Gaussian coding with analog quadrature amplitude modulation (QAM). In practical applications, however, discrete(More)
  • 1