default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPinar Sen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[b1]Pinar Sen:
Structured Codes for Network Communication. University of California, San Diego, USA, 2020- [j5]Pinar Sen
, Young-Han Kim:
Homologous Codes for Multiple Access Channels. IEEE Trans. Inf. Theory 66(3): 1549-1571 (2020) - [j4]Pinar Sen, Sung Hoon Lim, Young-Han Kim:
On the Optimal Achievable Rates for Linear Computation With Random Homologous Codes. IEEE Trans. Inf. Theory 66(10): 6200-6221 (2020) - [c11]Pinar Sen, Michael Gastpar, Young-Han Kim:
Successive Refinement to Caching for Dynamic Requests. ISIT 2020: 1711-1716 - [c10]Tugcan Aktas, Pinar Sen:
Interleaved Block Coding for Achieving Gaussian Random Access Channel Capacity. ISIT 2020: 3007-3012
2010 – 2019
- 2019
- [c9]Pinar Sen, Michael Gastpar:
Successive Refinement to Caching for Dynamic Content. ISIT 2019: 2484-2488 - 2018
- [j3]Po-Han Peter Wang, Haowei Jiang, Li Gao, Pinar Sen, Young-Han Kim, Gabriel M. Rebeiz, Patrick P. Mercier, Drew A. Hall:
A Near-Zero-Power Wake-Up Receiver Achieving -69-dBm Sensitivity. IEEE J. Solid State Circuits 53(6): 1640-1652 (2018) - [c8]Alankrita Bhatt, Jiun-Ting Huang, Young-Han Kim, J. Jon Ryu, Pinar Sen:
Monte Carlo Methods for Randomized Likelihood Decoding. Allerton 2018: 204-211 - [c7]Pinar Sen, Sung Hoon Lim, Young-Han Kim:
Optimal Achievable Rates for Computation With Random Homologous Codes. ISIT 2018: 2351-2355 - [c6]Alankrita Bhatt, Jiun-Ting Huang, Young-Han Kim, J. Jon Ryu, Pinar Sen:
Variations on a Theme by Liu, Cuff, and Verdú: The Power of Posterior Sampling. ITW 2018: 1-5 - [i5]Pinar Sen, Young-Han Kim:
Homologous Codes for Multiple Access Channels. CoRR abs/1801.07695 (2018) - [i4]Pinar Sen, Sung Hoon Lim, Young-Han Kim:
Optimal Achievable Rates for Computation With Random Homologous Codes. CoRR abs/1805.03338 (2018) - 2017
- [j2]Pinar Sen, Ali Özgür Yilmaz:
A Low-Complexity Graph-Based LMMSE Receiver for MIMO ISI Channels With M-QAM Modulation. IEEE Trans. Wirel. Commun. 16(2): 1185-1195 (2017) - [c5]Po-Han Peter Wang, Haowei Jiang, Li Gao, Pinar Sen, Young-Han Kim, Gabriel M. Rebeiz, Patrick P. Mercier, Drew A. Hall:
A 400 MHz 4.5 nW -63.8 dBm sensitivity wake-up receiver employing an active pseudo-balun envelope detector. ESSCIRC 2017: 35-38 - [c4]Pinar Sen, Young-Han Kim:
Homologous codes for multiple access channels. ISIT 2017: 874-878 - [c3]Haowei Jiang, Po-Han Peter Wang, Li Gao, Pinar Sen, Young-Han Kim, Gabriel M. Rebeiz, Drew A. Hall, Patrick P. Mercier:
24.5 A 4.5nW wake-up radio with -69dBm sensitivity. ISSCC 2017: 416-417 - 2014
- [j1]Pinar Sen, Ali Özgür Yilmaz:
Factor Graph Based LMMSE Filtering for Colored Gaussian Processes. IEEE Signal Process. Lett. 21(10): 1206-1210 (2014) - [c2]Pinar Sen, Tugcan Aktas, Ali Özgür Yilmaz:
A low-complexity graph-based LMMSE receiver designed for colored noise induced by FTN-signaling. WCNC 2014: 642-647 - [i3]Pinar Sen, Ali Özgür Yilmaz:
Factor Graph Based LMMSE Filtering for Colored Gaussian Processes. CoRR abs/1401.1016 (2014) - [i2]Pinar Sen, Ali Özgür Yilmaz:
A Low-Complexity Graph-Based LMMSE Receiver for MIMO ISI Channels with M-QAM Modulation. CoRR abs/1405.3057 (2014) - 2013
- [c1]Pinar Sen, Samet Gelincik, Tugcan Aktas, Ali Özgür Yilmaz:
ISI channel equalizers based on the factor graphs for M-QAM signalling. SIU 2013: 1-4 - [i1]Pinar Sen, Tugcan Aktas, Ali Özgür Yilmaz:
A Low-Complexity Graph-Based LMMSE Receiver Designed for Colored Noise Induced by FTN-Signaling. CoRR abs/1310.3381 (2013)
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:47 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:
