9 citations · 17 across the 7 of their papers we have counts for
7 papers
Two-Dimensional Z-Complementary Array Quads with Low Column Sequence PMEPRs
Shibsankar Das, Adrish Banerjee, Udaya Parampalli
In this paper, we first propose a new design strategy of 2D -complementary array quads (2D-ZCAQs) with feasible array sizes. A 2D-ZCAQ consists of four distinct unimodular array…
Root Cross Z-Complementary Pairs with Large ZCZ Width
Shibsankar Das, Adrish Banerjee, Zilong Liu
In this paper, we present a new family of cross -complementary pairs (CZCPs) based on generalized Boolean functions and two roots of unity. Our key idea is to consider an arbitr…
On DNA Codes Over the Non-Chain Ring with
Shibsankar Das, Krishna Gopal Benerjee, Adrish Banerjee
In this paper, we present a novel design strategy of DNA codes with length over the non-chain ring with elements and $u^3=1…
Grouping Search Results with Product Graphs in E-commerce Platforms
Suhas Ranganath, Shibsankar Das, Sanjay Thilaivasan +2
Showing relevant search results to the user is the primary challenge for any search system. Walmart e-commerce provides an omnichannel search platform to its customers to search fr…
New Optimal -Complementary Code Sets from Matrices of Polynomials
Shibsankar Das, Udaya Parampalli, Sudhan Majhi +1
The concept of paraunitary (PU) matrices arose in the early 1990s in the study of multi-rate filter banks. So far, these matrices have found wide applications in cryptography, digi…
Experimental Evaluation of Modified Decomposition Algorithm for Maximum Weight Bipartite Matching
Shibsankar Das
Let be an undirected bipartite graph with positive integer weights on the edges. We refine the existing decomposition theorem originally proposed by Kao et al., for computing m…
A Tight Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs
Shibsankar Das
Let $\Ga$ be the collection of all weighted bipartite graphs each having and , as the size of a vertex partition and the total weight, respectively. We give a tight lower bo…