6 papers
Bounds on the Service Rates of Linear Codes and their Connections to Combinatorial Designs
Monika Yadav, Priyanka Choudhary, Maheshanand Bhaintwal
The service rate region of a distributed storage system describes the set of concurrent demand vectors that can be served without overloading any individual server, and is a fundam…
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…
Recursive construction and enumeration of self-orthogonal and self-dual codes over finite commutative chain rings of even characteristic
Monika Yadav, Anuradha Sharma
Let denote a finite commutative chain ring of even characteristic with maximal ideal of nilpotency index Teichmller se…
A recursive approach to the construction and enumeration of self-orthogonal and self-dual codes over finite commutative chain rings of even characteristic
Monika Yadav, Anuradha Sharma
Let be a finite commutative chain ring of even characteristic with maximal ideal of nilpotency index Teichmller set $\…
On The Cost Function Associated With Legendrian Knots
Dheeraj Kulkarni, Tanushree Shah, Monika Yadav
In this article, we introduce a non-negative integer-valued function that measures the obstruction for converting topological isotopy between two Legendrian knots into a Legendrian…
On a generalization of Jones polynomial and its categorification for Legendrian Knots
Dheeraj Kulkarni, Monika Yadav
In this article, we explore a polynomial invariant for Legendrian knots which is a natural extension of Jones polynomial for (topological) knots. To this end, a new type of skein r…