Srimanta Bhattacharya

activity

20112022

most citedAn ensemble of high rank matrices arising from tournaments

5 citations · 8 across the 4 of their papers we have counts for

collaborators

6 papers

math.CO2022★ 2 cited

On hierarchically closed fractional intersecting families

Niranjan Balachandran, Srimanta Bhattacharya, Krishn Vishwas Kher +2

For a set $L$ of positive proper fractions and a positive integer $r \geq 2$ , a fractional $r$ -closed $L$ -intersecting family is a collection $F \subset P ([n])$ …

math.CO2021★ 5 cited

An ensemble of high rank matrices arising from tournaments

Niranjan Balachandran, Srimanta Bhattacharya, Brahadeesh Sankarnarayanan

Suppose $F$ is a field and let $a := (a_{1}, a_{2}, \dots)$ be a sequence of non-zero elements in $F$ . For $a_{n} := (a_{1}, \dots, a_{n})$ , we consider…

math.NT2016

On Some Permutation Binomials and Trinomials Over $F_{2^{n}}$

Srimanta Bhattacharya, Sumanta Sarkar

In this work, we completely characterize (i) permutation binomials of the form $x^{\frac{2 ^{n} - 1}{2 ^{t} - 1} + 1} + a x \in F_{2^{n}} [x], n = 2^{s} t, a \in F_{2^{2 t}}^{*}$ ,…

cs.DM2015

Derandomized Construction of Combinatorial Batch Codes

Srimanta Bhattacharya

Combinatorial Batch Codes (CBCs), replication-based variant of Batch Codes introduced by Ishai et al. in STOC 2004, abstracts the following data distribution problem: $n$ data item…

cs.DM2012★ 1 cited

On an Extremal Hypergraph Problem Related to Combinatorial Batch Codes

Niranjan Balachandran, Srimanta Bhattacharya

Let $n, r, k$ be positive integers such that $3 \leq k < n$ and $2 \leq r \leq k - 1$ . Let $m (n, r, k)$ denote the maximum number of edges an $r$ -uniform hypergraph on $n$ vertices can…

cs.DM2011

Combinatorial Batch Codes: A Lower Bound and Optimal Constructions

Srimanta Bhattacharya, Sushmita Ruj, Bimal Roy

Batch codes, introduced by Ishai, Kushilevitz, Ostrovsky and Sahai in [1], are methods for solving the following data storage problem: n data items are to be stored in m servers in…