Shibsankar Das

Orcid: 0000-0001-9626-0672

According to our database1, Shibsankar Das authored at least 27 papers between 2006 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On Nirmala Indices of Some Hex-derived Networks of Type Three and Their Subdivision Networks.
Sci. Ann. Comput. Sci., 2023

Root Cross Z-Complementary Pairs with Large ZCZ Width.
CoRR, 2023

Two-Dimensional Z-Complementary Array Quads with Low Column Sequence PMEPRs.
Proceedings of the IEEE International Symposium on Information Theory, 2023

New Quaternary Cross Z-Complementary Sets with Flexible Sequence Lengths.
Proceedings of the IEEE International Conference on Advanced Networks and Telecommunications Systems, 2023

2022
On DNA Codes Over the Non-Chain Ring Z<sub>4</sub>+uZ<sub>4</sub>+u<sup>2</sup>Z<sub>4</sub> with u<sup>3</sup>=1.
CoRR, 2022

Degree-based topological descriptors of type 3 rectangular hex-derived networks.
Bull. ICA, 2022

On DNA Codes Over the Non-Chain Ring ℤ4 +uℤ4 +u<sup>2</sup>ℤ4 with u<sup>3</sup> =1.
Proceedings of the IEEE Information Theory Workshop, 2022

New Family of Cross Z-Complementary Sequences With Large ZCZ Width.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Topological Characterization of the Third Type of Triangular Hex-derived Networks.
Sci. Ann. Comput. Sci., 2021

Grouping Search Results with Product Graphs in E-commerce Platforms.
CoRR, 2021

2020
New Optimal $Z$-Complementary Code Sets Based on Generalized Paraunitary Matrices.
IEEE Trans. Signal Process., 2020

Two-Dimensional $Z$-Complementary Array Code Sets Based on Matrices of Generating Polynomials.
IEEE Trans. Signal Process., 2020

A Modified Decomposition Algorithm for Maximum Weight Bipartite Matching and Its Experimental Evaluation.
Sci. Ann. Comput. Sci., 2020

An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs.
Sci. Ann. Comput. Sci., 2020

2019
A New Construction Framework for Polyphase Complete Complementary Codes With Various Lengths.
IEEE Trans. Signal Process., 2019

New Optimal Z-Complementary Code Sets from Matrices of Polynomials.
CoRR, 2019

Construction of New Optimal Z-Complementary Code Sets from Z-Paraunitary Matrices.
Proceedings of the Ninth International Workshop on Signal Design and its Applications in Communications, 2019

Near-Optimal Zero Correlation Zone Sequence Sets from Paraunitary Matrices.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
A Multiplier-Free Generator for Polyphase Complete Complementary Codes.
IEEE Trans. Signal Process., 2018

A Novel Class of Complete Complementary Codes and Their Applications for APU Matrices.
IEEE Signal Process. Lett., 2018

A Filtering Technique for All Pairs Approximate Parameterized String Matching.
Proceedings of the Mathematics and Computing - 4th International Conference, 2018

2017
Weighted approximate parameterized string matching.
AKCE Int. J. Graphs Comb., 2017

A novel multiplier-free generator for complete complementary codes.
Proceedings of the 23rd Asia-Pacific Conference on Communications, 2017

2016
Experimental Evaluation of Modified Decomposition Algorithm for Maximum Weight Bipartite Matching.
CoRR, 2016

A Tight Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs.
CoRR, 2016

2014
Fine-Tuning Decomposition Theorem for Maximum Weight Bipartite Matching.
Proceedings of the Theory and Applications of Models of Computation, 2014

2006
Evaluation of network impact of content distribution mechanisms.
Proceedings of the 1st International Conference on Scalable Information Systems, 2006


  Loading...