default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSmarajit Das
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c12]Smarajit Das:
Codes on Matrices and Some Applications. ISIT 2023: 1764-1769- [c11]Deepak Agrawal, Smarajit Das, Srinivasan Krishanaswamy:
On Secret Sharing Schemes from Nonlinear Codes. NCC 2023: 1-6 - 2021
- [j4]Ujwal Deep Kadiyam
, Smarajit Das:
Codes With Availability for Multiple Code Symbols. IEEE Commun. Lett. 25(8): 2477-2481 (2021) - 2020
- [j3]Ujwal Deep Kadiyam, Smarajit Das:
A Class of Codes With Availability and Multiple Local-Erasures Correction. IEEE Commun. Lett. 24(10): 2087-2091 (2020) - [c10]Deepak Agrawal, Smarajit Das, Srinivasan Krishanaswamy:
Secret sharing schemes based on Nonlinear codes. ISIT 2020: 864-867 - [c9]Ujwal Deep Kadiyam, Smarajit Das:
Codes with Availability and different Localities. SPCOM 2020: 1-5
2010 – 2019
- 2016
- [c8]Smarajit Das:
On the decoding delay of rate-1/2 complex orthogonal designs. ISIT 2016: 3003-3007 - 2012
- [j2]Smarajit Das, B. Sundar Rajan:
Low-Delay, High-Rate Nonsquare Complex Orthogonal Designs. IEEE Trans. Inf. Theory 58(5): 2633-2647 (2012) - [c7]Smarajit Das, Naresh Sharma, Siddharth Muthukrishnan:
On Some Special Cases of the Entropy Photon-Number Inequality. TQC 2012: 116-127 - 2011
- [c6]Naresh Sharma, Smarajit Das, Siddharth Muthukrishnan:
Entropy power inequality for a family of discrete random variables. ISIT 2011: 1945-1949 - [i7]Smarajit Das, Naresh Sharma, Siddharth Muthukrishnan:
On some special cases of the Entropy Photon-Number Inequality. CoRR abs/1107.2365 (2011) - [i6]Smarajit Das, B. Sundar Rajan:
Low-delay, High-rate Non-square Complex Orthogonal Designs. CoRR abs/1112.1593 (2011) - 2010
- [c5]Smarajit Das:
Set-partition methods and orthogonal designs. ISIT 2010: 1076-1079 - [i5]Naresh Sharma, Smarajit Das, Siddharth Muthukrishnan:
Entropy power inequality for a family of discrete random variables. CoRR abs/1012.0412 (2010)
2000 – 2009
- 2009
- [j1]Smarajit Das, B. Sundar Rajan:
Square complex orthogonal designs with low PAPR and signaling complexity. IEEE Trans. Wirel. Commun. 8(1): 204-213 (2009) - [c4]Smarajit Das, B. Sundar Rajan:
A novel construction of complex orthogonal designs with maximal rate and low-PAPR. ISIT 2009: 89-93 - 2008
- [c3]Smarajit Das, B. Sundar Rajan:
Low-delay, high-rate, non-square STBCs from scaled complex orthogonal designs. ISIT 2008: 1483-1487 - [i4]Smarajit Das, B. Sundar Rajan:
Low-delay, Low-PAPR, High-rate Non-square Complex Orthogonal Designs. CoRR abs/0807.4074 (2008) - [i3]Smarajit Das, B. Sundar Rajan:
Square Complex Orthogonal Designs with Low PAPR and Signaling Complexity. CoRR abs/0807.4128 (2008) - [i2]Smarajit Das, B. Sundar Rajan:
A Class of Maximal-Rate, Low-PAPR, Non-square Complex Orthogonal Designs. CoRR abs/0808.1400 (2008) - [i1]Smarajit Das, B. Sundar Rajan:
Square Complex Orthogonal Designs with no Zero Entry for any 2m Antennas. CoRR abs/0812.2458 (2008) - 2007
- [c2]Smarajit Das, B. Sundar Rajan:
Square Complex Orthogonal Designs with Low PAPR. ISIT 2007: 2626-2630 - 2006
- [c1]Smarajit Das, B. Sundar Rajan:
On the Maximal Rate of (n + 1) × n and (n + 2) × n Complex Orthogonal Designs. ISIT 2006: 381-385
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
