![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Shouvik Ganguly
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Nadim Ghaddar
, Shouvik Ganguly
, Lele Wang
, Young-Han Kim
:
A Lego-Brick Approach to Coding for Network Communication. IEEE Trans. Inf. Theory 70(2): 865-903 (2024) - 2022
- [j2]J. Jon Ryu
, Shouvik Ganguly
, Younghan Kim
, Yung-Kyun Noh
, Daniel D. Lee:
Nearest Neighbor Density Functional Estimation From Inverse Laplace Transform. IEEE Trans. Inf. Theory 68(6): 3511-3551 (2022) - [c8]Nadim Ghaddar, Shouvik Ganguly
, Lele Wang, Young-Han Kim:
A Lego- Brick Approach to Lossy Source Coding. CWIT 2022: 45-50 - [i4]Nadim Ghaddar, Shouvik Ganguly
, Lele Wang, Young-Han Kim:
A Lego-Brick Approach to Coding for Network Communication. CoRR abs/2211.07208 (2022) - 2021
- [j1]Shouvik Ganguly
, Seung-Eun Hong
, Young-Han Kim
:
On the Capacity Regions of Cloud Radio Access Networks With Limited Orthogonal Fronthaul. IEEE Trans. Inf. Theory 67(5): 2958-2988 (2021) - [c7]Nadim Ghaddar, Shouvik Ganguly
, Lele Wang, Young-Han Kim:
A Lego-Brick Approach to Coding for Asymmetric Channels and Channels with State. ISIT 2021: 1367-1372 - 2020
- [c6]Shouvik Ganguly
, Lele Wang, Young-Han Kim:
A Functional Construction of Codes for Multiple Access and Broadcast Channels. ISIT 2020: 1581-1586 - [c5]Shouvik Ganguly
, Lele Wang:
Sliding-Window Gelfand-Pinsker Coding: General K-User Broadcast Channels. ITW 2020: 1-5
2010 – 2019
- 2019
- [c4]Shouvik Ganguly
, Young-Han Kim:
Capacity Scaling for Cloud Radio Access Networks with Limited Orthogonal Fronthaul. ISIT 2019: 1472-1476 - [i3]Shouvik Ganguly, Seung-Eun Hong, Young-Han Kim:
On the Capacity Regions of Cloud Radio Access Networks with Limited Orthogonal Fronthaul. CoRR abs/1912.04483 (2019) - 2018
- [i2]Shouvik Ganguly, Jongha Ryu, Young-Han Kim, Yung-Kyun Noh, Daniel D. Lee:
Nearest neighbor density functional estimation based on inverse Laplace transform. CoRR abs/1805.08342 (2018) - 2017
- [c3]Shouvik Ganguly
, Young-Han Kim:
On the capacity of cloud radio access networks. ISIT 2017: 2063-2067 - 2014
- [c2]Shouvik Ganguly
, K. R. Sahasranand, Vinod Sharma
:
A new algorithm for distributed nonparametric sequential detection. ICC 2014: 1409-1415 - [c1]Shouvik Ganguly
, K. R. Sahasranand, Vinod Sharma
:
A new algorithm for nonparametric sequential detection. NCC 2014: 1-6 - 2013
- [i1]Shouvik Ganguly, K. R. Sahasranand, Vinod Sharma:
A New Algorithm for Distributed Nonparametric Sequential Detection. CoRR abs/1311.3485 (2013)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint