Smarajit Das

Orcid: 0000-0001-6260-6129

According to our database1, Smarajit Das authored at least 20 papers between 2006 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On Secret Sharing Schemes from Nonlinear Codes.
Proceedings of the 28th National Conference on Communications, 2023

Codes on Matrices and Some Applications.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2021
Codes With Availability for Multiple Code Symbols.
IEEE Commun. Lett., 2021

2020
A Class of Codes With Availability and Multiple Local-Erasures Correction.
IEEE Commun. Lett., 2020

Codes with Availability and different Localities.
Proceedings of the International Conference on Signal Processing and Communications, 2020

Secret sharing schemes based on Nonlinear codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2016
On the decoding delay of rate-1/2 complex orthogonal designs.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2012
Low-Delay, High-Rate Nonsquare Complex Orthogonal Designs.
IEEE Trans. Inf. Theory, 2012

On Some Special Cases of the Entropy Photon-Number Inequality.
Proceedings of the Theory of Quantum Computation, 2012

2011
Low-delay, High-rate Non-square Complex Orthogonal Designs
CoRR, 2011

Entropy power inequality for a family of discrete random variables.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Set-partition methods and orthogonal designs.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Square complex orthogonal designs with low PAPR and signaling complexity.
IEEE Trans. Wirel. Commun., 2009

A novel construction of complex orthogonal designs with maximal rate and low-PAPR.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Square Complex Orthogonal Designs with no Zero Entry for any 2<sup>m</sup> Antennas
CoRR, 2008

A Class of Maximal-Rate, Low-PAPR, Non-square Complex Orthogonal Designs
CoRR, 2008

Low-delay, Low-PAPR, High-rate Non-square Complex Orthogonal Designs
CoRR, 2008

Low-delay, high-rate, non-square STBCs from scaled complex orthogonal designs.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Square Complex Orthogonal Designs with Low PAPR.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
On the Maximal Rate of (n + 1) × n and (n + 2) × n Complex Orthogonal Designs.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006


  Loading...