Smarajit Das

According to our database, Smarajit Das authored at least 21 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

On Boolean functions derived from linear maps over $\mathbb {Z}_4$ and their application to secret sharing.

Deepak Agrawal, Srinivasan Krishnaswamy, Smarajit Das

Des. Codes Cryptogr., December, 2024

2023

On Secret Sharing Schemes from Nonlinear Codes.

Deepak Agrawal, Smarajit Das, Srinivasan Krishanaswamy

Proceedings of the 28th National Conference on Communications, 2023

Codes on Matrices and Some Applications.

Smarajit Das

Proceedings of the IEEE International Symposium on Information Theory, 2023

2021

Codes With Availability for Multiple Code Symbols.

Ujwal Deep Kadiyam, Smarajit Das

IEEE Commun. Lett., 2021

2020

A Class of Codes With Availability and Multiple Local-Erasures Correction.

Ujwal Deep Kadiyam, Smarajit Das

IEEE Commun. Lett., 2020

Codes with Availability and different Localities.

Ujwal Deep Kadiyam, Smarajit Das

Proceedings of the International Conference on Signal Processing and Communications, 2020

Secret sharing schemes based on Nonlinear codes.

Deepak Agrawal, Smarajit Das, Srinivasan Krishanaswamy

Proceedings of the IEEE International Symposium on Information Theory, 2020

2016

On the decoding delay of rate-1/2 complex orthogonal designs.

Smarajit Das

Proceedings of the IEEE International Symposium on Information Theory, 2016

2012

Low-Delay, High-Rate Nonsquare Complex Orthogonal Designs.

Smarajit Das, B. Sundar Rajan

IEEE Trans. Inf. Theory, 2012

On Some Special Cases of the Entropy Photon-Number Inequality.

Smarajit Das, Naresh Sharma, Siddharth Muthukrishnan

Proceedings of the Theory of Quantum Computation, 2012

2011

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

Smarajit Das, B. Sundar Rajan

CoRR, 2011

Entropy power inequality for a family of discrete random variables.

Naresh Sharma, Smarajit Das, Siddharth Muthukrishnan

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Set-partition methods and orthogonal designs.

Smarajit Das

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Square complex orthogonal designs with low PAPR and signaling complexity.

Smarajit Das, B. Sundar Rajan

IEEE Trans. Wirel. Commun., 2009

A novel construction of complex orthogonal designs with maximal rate and low-PAPR.

Smarajit Das, B. Sundar Rajan

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Square Complex Orthogonal Designs with no Zero Entry for any 2^m Antennas

Smarajit Das, B. Sundar Rajan

CoRR, 2008

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

Smarajit Das, B. Sundar Rajan

CoRR, 2008

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

Smarajit Das, B. Sundar Rajan

CoRR, 2008

Low-delay, high-rate, non-square STBCs from scaled complex orthogonal designs.

Smarajit Das, B. Sundar Rajan

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007

Square Complex Orthogonal Designs with Low PAPR.

Smarajit Das, B. Sundar Rajan

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.

Smarajit Das, B. Sundar Rajan

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006