default search action
Sanjay Karmakar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j9]Sanjay Karmakar
, Anirban Ghosh
Secrecy Capacity Region of Fading Binary Z Interference Channel With Statistical CSIT. IEEE Trans. Inf. Forensics Secur. 14(4): 848-857 (2019) - [i12]Eric Kubischta
Semantic Security on Wiretap Channels using Universal Hashing with Fading Applications. CoRR abs/1903.08822 (2019) - 2018
- [c22]Sanjay Karmakar, Anirban Ghosh
Secrecy Capacity of the Fast Fading SISO Wiretap Channel within 11 Bits with Only CSIR. ICC 2018: 1-6 - [c21]Sanjay Karmakar:
GDoF region characterization of the weak MIMO IC with No CSIT. WCNC 2018: 1-5 - [c20]Sanjay Karmakar, Anirban Ghosh
The secrecy capacity region of fading erasure Z interference channel with no CSIT. WCNC 2018: 1-6 - 2015
- [j8]Sanjay Karmakar, Mahesh K. Varanasi:
The Generalized Diversity-Multiplexing Tradeoff of the MIMO Z Interference Channel. IEEE Trans. Inf. Theory 61(6): 3427-3445 (2015) - [c19]Mohammad K. Hossan, Sanjay Karmakar:
Secrecy capacity of the ergodic layered erasure wiretap channel. CISS 2015: 1-5 - [c18]Sanjay Karmakar, Noopur Modi:
Capacity region of two interfering MIMO Multiple Access channels with strong interference. CISS 2015: 1-6 - [c17]Mohammad K. Hossan, Sanjay Karmakar, Anirban Ghosh
On the secrecy capacity of fading Gaussian wiretap channel. CWIT 2015: 36-40 - [c16]Sanjay Karmakar, Anirban Ghosh
Approximate secrecy capacity region of an asymmetric MAC wiretap channel within 1/2 bits. CWIT 2015: 88-92 - 2014
- [c15]Sanjay Karmakar, Mahesh K. Varanasi:
Capacity region of a class of strong MIMO IC. CISS 2014: 1-6 - [c14]Sanjay Karmakar, Mahesh K. Varanasi:
The diversity multiplexing tradeoff of the half-duplex relay network. ITW 2014: 661-665 - [c13]Sanjay Karmakar:
On the sum-rate capacity of a 2-user Multiple Access Wiretap Channel with one secret user. VITAE 2014: 1-5 - 2013
- [j7]Sanjay Karmakar, Mahesh K. Varanasi:
The Capacity Region of the MIMO Interference Channel and Its Reciprocity to Within a Constant Gap. IEEE Trans. Inf. Theory 59(8): 4781-4797 (2013) - 2012
- [j6]Sanjay Karmakar, Mahesh K. Varanasi:
The Diversity-Multiplexing Tradeoff of the MIMO Half-Duplex Relay Channel. IEEE Trans. Inf. Theory 58(12): 7168-7187 (2012) - [j5]Sanjay Karmakar, Mahesh K. Varanasi:
The Generalized Degrees of Freedom Region of the MIMO Interference Channel and Its Achievability. IEEE Trans. Inf. Theory 58(12): 7188-7203 (2012) - [c12]Sanjay Karmakar, Mahesh K. Varanasi:
The generalized multiplexing gain region of the slow fading MIMO interference channel and its achievability with limited feedback. ISIT 2012: 3135-3139 - 2011
- [j4]Sanjay Karmakar, Mahesh K. Varanasi:
The Diversity-Multiplexing Tradeoff of the Dynamic Decode-and-Forward Protocol on a MIMO Half-Duplex Relay Channel. IEEE Trans. Inf. Theory 57(10): 6569-6590 (2011) - [j3]Sanjay Karmakar, K. Pavan Srinath, B. Sundar Rajan:
Maximum Rate of Unitary-Weight, Single-Symbol Decodable STBCs. IEEE Trans. Inf. Theory 57(12): 7972-7981 (2011) - [c11]Chinmay S. Vaze, Sanjay Karmakar, Mahesh K. Varanasi:
On the generalized degrees of freedom region of the MIMO interference channel with no CSIT. ISIT 2011: 757-761 - [c10]Sanjay Karmakar, Mahesh K. Varanasi:
Capacity of the MIMO interference channel to within a constant gap. ISIT 2011: 2193-2197 - [c9]Sanjay Karmakar, Mahesh K. Varanasi:
The generalized degrees of freedom of the MIMO interference channel. ISIT 2011: 2198-2202 - [i11]Sanjay Karmakar, K. Pavan Srinath, B. Sundar Rajan:
Maximum Rate of Unitary-Weight, Single-Symbol Decodable STBCs. CoRR abs/1101.2516 (2011) - [i10]Sanjay Karmakar, Mahesh K. Varanasi:
Capacity of the MIMO Interference Channel to Within a Constant Gap. CoRR abs/1102.0267 (2011) - [i9]Sanjay Karmakar, Mahesh K. Varanasi:
The Generalized Degrees of Freedom of the MIMO Interference Channel. CoRR abs/1103.1672 (2011) - [i8]Sanjay Karmakar, Mahesh K. Varanasi:
The Generalized Degrees of Freedom Region of the MIMO Interference Channel. CoRR abs/1103.2560 (2011) - [i7]Sanjay Karmakar, Mahesh K. Varanasi:
The Diversity Multiplexing Tradeoff of the MIMO Half-Duplex Relay Channel. CoRR abs/1106.6323 (2011) - 2010
- [c8]Sanjay Karmakar, Mahesh K. Varanasi:
The diversity-multiplexing tradeoff of the symmetric MIMO half-duplex relay channel. ISIT 2010: 2178-2182 - [c7]Sanjay Karmakar, Mahesh K. Varanasi:
The diversity-multiplexing tradeoff of the MIMO Z interference channel. ISIT 2010: 2188-2192 - [c6]Sanjay Karmakar, Mahesh K. Varanasi:
The diversity-multiplexing tradeoff of the symmetric MIMO 2-user interference channel. ISIT 2010: 2213-2217 - [i6]Sanjay Karmakar, Mahesh K. Varanasi:
The diversity-multiplexing tradeoff of the MIMO Z interference channel. CoRR abs/1006.0496 (2010) - [i5]Sanjay Karmakar, Mahesh K. Varanasi:
The diversity-multiplexing tradeoff of the symmetric MIMO 2-user interference channel. CoRR abs/1006.1149 (2010) - [i4]Sanjay Karmakar, Mahesh K. Varanasi:
The Diversity-Multiplexing Tradeoff of the Dynamic Decode-and-Forward Protocol on a MIMO Half-Duplex Relay Channel. CoRR abs/1008.1455 (2010)
2000 – 2009
- 2009
- [j2]Sanjay Karmakar, B. Sundar Rajan:
Multigroup Decodable STBCs From Clifford Algebras. IEEE Trans. Inf. Theory 55(1): 223-231 (2009) - [j1]Sanjay Karmakar, B. Sundar Rajan:
High-rate, multisymbol-decodable STBCs from Clifford algebras. IEEE Trans. Inf. Theory 55(6): 2682-2695 (2009) - [c5]Sanjay Karmakar, Mahesh K. Varanasi:
Diversity-multiplexing tradeoff of the dynamic decode and forward protocol on a MIMO half-duplex relay channel. ISIT 2009: 1443-1447 - 2008
- [c4]Sanjay Karmakar, Mahesh K. Varanasi:
On the Rate Versus ML-Decoding Complexity Tradeoff of Square LDSTBCs with Unitary Weight Matrices. GLOBECOM 2008: 1198-1202 - 2007
- [i3]Sanjay Karmakar, B. Sundar Rajan:
Maximum-rate, Minimum-Decoding-Complexity STBCs from Clifford Algebras. CoRR abs/0712.2371 (2007) - [i2]Sanjay Karmakar, B. Sundar Rajan:
High-rate, Multi-Symbol-Decodable STBCs from Clifford Algebras. CoRR abs/cs/0702023 (2007) - 2006
- [c3]Sanjay Karmakar, B. Sundar Rajan:
High-rate, Double-Symbol-Decodable STBCs from Clifford Algebras. GLOBECOM 2006 - [c2]Sanjay Karmakar, B. Sundar Rajan:
Minimum-Decoding-Complexity, Maximum-rate Space-Time Block Codes from Clifford Algebras. ISIT 2006: 788-792 - [c1]Sanjay Karmakar, B. Sundar Rajan:
Non-Unitary-Weight Space-Time Block codes with Minimum Decoding Complexity. ISIT 2006: 793-797 - [i1]Sanjay Karmakar, B. Sundar Rajan:
Multigroup-Decodable STBCs from Clifford Algebras. CoRR abs/cs/0610162 (2006)
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-25 05:54 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: