default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSeung-Hyun Nam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Hyun-Young Park
, Seung-Hyun Nam, Si-Hyeon Lee:
Exactly Optimal and Communication-Efficient Private Estimation via Block Designs. IEEE J. Sel. Areas Inf. Theory 5: 123-134 (2024)- [j5]Seung-Hyun Nam, Vincent Y. F. Tan, Si-Hyeon Lee:
Optimal Private Discrete Distribution Estimation With 1-bit Communication. IEEE Trans. Inf. Forensics Secur. 19: 6514-6528 (2024) - [j4]Seung-Hyun Nam, Hyun-Young Park, Si-Hyeon Lee:
Achieving the Exactly Optimal Privacy-Utility Trade-Off With Low Communication Cost via Shared Randomness. IEEE Trans. Inf. Theory 70(10): 7447-7462 (2024) - [c5]Seung-Hyun Nam, Vincent Y. F. Tan, Si-Hyeon Lee:
Optimal Private Discrete Distribution Estimation with One-Bit Communication. ISIT 2024: 593-598 - [c4]Seung-Hyun Nam, Hyun-Young Park, Si-Hyeon Lee:
Achieving the Exactly Optimal Privacy-Utility Trade-Off with Low Communication Cost via Shared Randomness. ISIT 2024: 3065-3070 - 2023
- [c3]Hyun-Young Park, Seung-Hyun Nam, Si-Hyeon Lee:
Block Design-Based Local Differential Privacy Mechanisms. ISIT 2023: 1645-1650 - [i4]Hyun-Young Park, Seung-Hyun Nam, Si-Hyeon Lee:
Block Design-Based Local Differential Privacy Mechanisms. CoRR abs/2305.01261 (2023) - [i3]Seung-Hyun Nam, Hyun-Young Park, Si-Hyeon Lee:
Achieving the Exactly Optimal Privacy-Utility Trade-Off with Low Communication Cost via Shared Randomness. CoRR abs/2307.03962 (2023) - [i2]Seung-Hyun Nam, Vincent Y. F. Tan, Si-Hyeon Lee:
Optimal Private Discrete Distribution Estimation with One-bit Communication. CoRR abs/2310.11005 (2023) - 2022
- [j3]Seung-Hyun Nam, Si-Hyeon Lee:
A Tighter Converse for the Locally Differentially Private Discrete Distribution Estimation Under the One-bit Communication Constraint. IEEE Signal Process. Lett. 29: 1923-1927 (2022) - [j2]Seung-Hyun Nam, Si-Hyeon Lee:
Secrecy Capacity of a Gaussian Wiretap Channel With ADCs is Always Positive. IEEE Trans. Inf. Theory 68(2): 1186-1196 (2022) - 2020
- [i1]Seung-Hyun Nam, Si-Hyeon Lee:
Secrecy Capacity of a Gaussian Wiretap Channel With ADCs is Always Positive. CoRR abs/2006.00191 (2020)
2010 – 2019
- 2019
- [c2]Seung-Hyun Nam, Si-Hyeon Lee:
Secrecy Capacity of a Gaussian Wiretap Channel with One-bit ADCs is Always Positive. ITW 2019: 1-5
2000 – 2009
- 2008
- [j1]Seung-Hyun Nam, Jae-Seon Yoon, Hyoung-Kyu Song:
EM-based low complexity channel estimation for OFDM system. IEEE Trans. Consumer Electron. 54(2): 425-430 (2008) - [c1]Seung-Hyun Nam, Sung-Ju Lee, Jae-Seon Yoon, Hyoung-Kyu Song:
Em-based reduced complexity channel estimation for OFDM in mobile wireless system. MOBIWAC 2008: 166-169
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-10-12 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
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:
