activity
20142026
most citedCyclic codes over

1 citations · 1 across the 7 of their papers we have counts for

collaborators

11 papers

cs.IT2026

Recovery Set Structures and Service Rates of Codes Obtained by the Plotkin-type Construction

Priyanka Choudhary, Maheshanand Bhaintwal

In distributed storage systems, redundancy enables a single data object to be reconstructed using several disjoint groups of servers. The resulting service rate region (SRR) captur…

cs.IT2026

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…

cs.IT2026

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 n…

cs.IT2025

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…

cs.IT2025

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…

cs.IT2024

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…

cs.DM2022

A new class of negabent functions

Deep Singh, Maheshanand Bhaintwal

Negabent functions were introduced as a generalization of bent functions, which have applications in coding theory and cryptography. In this paper, we have extended the notion of n…

cs.IT2020

On cyclic LRC codes that are also LCD codes

Charul Rajput, Maheshanand Bhaintwal, Ramakrishna Bandi

Locally recoverable (LRC) codes provide a solution to single node failure in distributed storage systems, where it is a very common problem. On the other hand, linear complementary…

cs.IT2016

One generator quasi-cyclic codes over F2 + uF2 + vF2 + uvF2

Srinivasulu B, Maheshanand Bhaintwal

In this paper, we study the structure of 1-generator quasi-cyclic codes over the ring R = F2 + uF2 + vF2 + uvF2, with u2 = v2 = 0 and uv = vu. We determine the minimal spanning set…

cs.IT2015★ 1 cited

Cyclic codes over

Rama Krishna Bandi, Maheshanand Bhaintwal

In this paper, we have studied cyclic codes over the ring , . We have considered cyclic codes of odd lengths. A sufficient condition for a cycl…

cs.IT2014

Negacyclic codes over Z4+uZ4

Rama Krishna Bandi, Maheshanand Bhaintwal

In this paper, we study negacyclic codes of odd length and of length over the ring , . We give the complete structure of negacyclic codes…