5 papers
Maximal achievable service rates of some classes of linear codes
Priyanka Choudhary, Monika Yadav, Maheshanand Bhaintwal
In this paper, we investigate lower bounds on the maximum achievable service rates for data symbols in certain classes of linear codes, including cyclic codes and low-density parit…
Constructions of Quantum -LRCs from cyclic codes
Rajendra Prasad Rajpurohit, Maheshanand Bhaintwal
Classical locally recoverable codes (LRCs) play a central role in distributed data storage systems as they enable an efficient recovery from erasures by accessing a small…
The Service Rate Region of Hamming Codes
Priyanka Choudhary, Maheshanand Bhaintwal
The service rate region of a coded distributed storage system is the set of all achievable data access requests under the capacity constraints. This paper investigates the service…
On equidistant single-orbit cyclic and quasi-cyclic subspace codes
Mahak, Maheshanand Bhaintwal
A code is said to be equidistant if the distance between any two distinct codewords of the code is the same. In this paper, we have studied equidistant single-orbit cyclic and quas…
On the distance distributions of single-orbit cyclic subspace codes
Mahak, Maheshanand Bhaintwal
{A cyclic subspace code is a union of the orbits of subspaces contained in it. In a recent paper, Gluesing-Luerssen et al. (Des. Codes Cryptogr. 89, 447-470, 2021) showed that the…