default search action
Si-Hyeon Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j31]Jae-Min Park
, Won-Jun Jang
Overcoming Client Data Deficiency in Federated Learning by Exploiting Unlabeled Data on the Server. IEEE Access 12: 130007-130021 (2024) - [j30]Jungwon Hur, Si-Hyeon Lee:
Joint Trajectory and Power Optimization for Energy-Efficient UAV Redeployment Against an Eavesdropper Under Consistent Fairness Constraint. IEEE Commun. Lett. 28(10): 2347-2351 (2024) - [j29]Hyun-Young Park
Exactly Optimal and Communication-Efficient Private Estimation via Block Designs. IEEE J. Sel. Areas Inf. Theory 5: 123-134 (2024) - [j28]Jinyoung Lee
Channel Correlation in Multi-User Covert Communication: Friend or Foe? IEEE Trans. Inf. Forensics Secur. 19: 1469-1482 (2024) - [j27]Seung-Hyun Nam
Optimal Private Discrete Distribution Estimation With 1-bit Communication. IEEE Trans. Inf. Forensics Secur. 19: 6514-6528 (2024) - [j26]Seung-Hyun Nam
Achieving the Exactly Optimal Privacy-Utility Trade-Off With Low Communication Cost via Shared Randomness. IEEE Trans. Inf. Theory 70(10): 7447-7462 (2024) - [c26]Hyeonsik Yeom, Jinyoung Lee, Si-Hyeon Lee, Jeongseok Ha:
Covert Communication with Multi-Users Cooperation at Unequal Distances. ICC 2024: 121-126 - [c25]Seung-Hyun Nam, Vincent Y. F. Tan, Si-Hyeon Lee:
Optimal Private Discrete Distribution Estimation with One-Bit Communication. ISIT 2024: 593-598 - [c24]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
- [j25]Seokhwa Hong, Kyuyeong Kim, Si-Hyeon Lee
A Hybrid Jamming Detection Algorithm for Wireless Communications: Simultaneous Classification of Known Attacks and Detection of Unknown Attacks. IEEE Commun. Lett. 27(7): 1769-1773 (2023) - [j24]Hyeon-Seong Im
Anti-Jamming Games in Multi-Band Wireless Ad Hoc Networks. IEEE Trans. Inf. Forensics Secur. 18: 872-887 (2023) - [j23]Jinyoung Lee
Multiuser Cooperation for Covert Communication Under Quasi-Static Fading. IEEE Trans. Inf. Forensics Secur. 18: 4625-4639 (2023) - [c23]Hyun-Young Park, Seung-Hyun Nam, Si-Hyeon Lee:
Block Design-Based Local Differential Privacy Mechanisms. ISIT 2023: 1645-1650 - [c22]Hyeon-Seong Im, Kyuyeong Kim, Si-Hyeon Lee:
Trajectory Optimization for Cellular-Enabled UAV with Connectivity and Battery Constraints. VTC Fall 2023: 1-7 - [i21]Jinyoung Lee, Duc Trung Dinh, Hyeonsik Yeom, Si-Hyeon Lee, Jeongseok Ha:
Multi-User Cooperation for Covert Communication Under Quasi-Static Fading. CoRR abs/2304.03433 (2023) - [i20]Hyun-Young Park, Seung-Hyun Nam
Block Design-Based Local Differential Privacy Mechanisms. CoRR abs/2305.01261 (2023) - [i19]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) - [i18]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
- [j22]Seung-Hyun Nam
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) - [j21]Seung-Hyun Nam
Secrecy Capacity of a Gaussian Wiretap Channel With ADCs is Always Positive. IEEE Trans. Inf. Theory 68(2): 1186-1196 (2022) - [j20]Kang-Hee Cho
Covert Communication Over Gaussian Multiple-Access Channels With Feedback. IEEE Wirel. Commun. Lett. 11(9): 1985-1989 (2022) - 2021
- [j19]Kang-Hee Cho
Treating Interference as Noise Is Optimal for Covert Communication Over Interference Channels. IEEE Trans. Inf. Forensics Secur. 16: 322-332 (2021) - [j18]Hyeon-Seong Im, Si-Hyeon Lee
Mobility-Assisted Covert Communication Over Wireless Ad Hoc Networks. IEEE Trans. Inf. Forensics Secur. 16: 1768-1781 (2021) - [i17]Hyeon-Seong Im, Si-Hyeon Lee:
Anti-Jamming Games for Multi-User Multi-Band Networks. CoRR abs/2111.11178 (2021) - 2020
- [j17]Kang-Hee Cho
Throughput Scaling of Covert Communication Over Wireless Adhoc Networks. IEEE Trans. Inf. Theory 66(12): 7684-7701 (2020) - [c21]Hyeon-Seong Im, Si-Hyeon Lee:
Mobility-Assisted Covert Communication over Wireless Ad Hoc Networks. ISIT 2020: 810-815 - [c20]Kang-Hee Cho, Si-Hyeon Lee:
Treating Interference as Noise is Optimal for Covert Communication over Interference Channels. ISIT 2020: 816-821 - [i16]Kang-Hee Cho, Si-Hyeon Lee:
Treating Interference as Noise is Optimal for Covert Communication over Interference Channels. CoRR abs/2003.04531 (2020) - [i15]Hyeon-Seong Im, Si-Hyeon Lee:
Mobility-Assisted Covert Communication over Wireless Ad Hoc Networks. CoRR abs/2004.08852 (2020) - [i14]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
- [j16]Kang-Hee Cho
Effect of User Cooperation on Smart Meter Privacy With Rechargeable Batteries. IEEE Signal Process. Lett. 26(7): 971-975 (2019) - [j15]Vincent Y. F. Tan
Time-Division is Optimal for Covert Communication Over Some Broadcast Channels. IEEE Trans. Inf. Forensics Secur. 14(5): 1377-1389 (2019) - [c19]Kang-Hee Cho, Si-Hyeon Lee, Vincent Y. F. Tan:
Throughput Scaling of Covert Communication over Wireless Adhoc Networks. ISIT 2019: 2164-2168 - [c18]Seung-Hyun Nam
Secrecy Capacity of a Gaussian Wiretap Channel with One-bit ADCs is Always Positive. ITW 2019: 1-5 - [i13]Kang-Hee Cho, Si-Hyeon Lee, Vincent Y. F. Tan:
Throughput Scaling of Covert Communication over Wireless Adhoc Networks. CoRR abs/1906.12092 (2019) - 2018
- [j14]Si-Hyeon Lee
Covert Communication With Channel-State Information at the Transmitter. IEEE Trans. Inf. Forensics Secur. 13(9): 2310-2319 (2018) - [j13]Si-Hyeon Lee
A Unified Random Coding Bound. IEEE Trans. Inf. Theory 64(10): 6779-6802 (2018) - [j12]Si-Hyeon Lee
The Wiretapped Diamond-Relay Channel. IEEE Trans. Inf. Theory 64(11): 7194-7207 (2018) - [c17]Vincent Y. F. Tan, Si-Hyeon Lee:
Time-Division is Optimal for Covert Communication over Some Broadcast Channels. ITW 2018: 1-5 - 2017
- [j11]Si-Hyeon Lee
The Gaussian Diamond-Wiretap Channel With Rate-Limited Relay Cooperation. IEEE Commun. Lett. 21(1): 338-341 (2017) - [j10]Si-Hyeon Lee
Successive Interference Cancellation With Feedback for Random Access Networks. IEEE Commun. Lett. 21(4): 825-828 (2017) - [j9]Yuhan Helena Liu, Si-Hyeon Lee, Ashish Khisti:
Information-Theoretic Privacy in Smart Metering Systems Using Cascaded Rechargeable Batteries. IEEE Signal Process. Lett. 24(3): 314-318 (2017) - [j8]Si-Hyeon Lee
Secure Degrees of Freedom of the Gaussian Diamond-Wiretap Channel. IEEE Trans. Inf. Theory 63(1): 496-508 (2017) - [j7]Si-Hyeon Lee
Exact Moderate Deviation Asymptotics in Streaming Data Transmission. IEEE Trans. Inf. Theory 63(5): 2726-2736 (2017) - [c16]Si-Hyeon Lee, Vincent Y. F. Tan, Ashish Khisti:
Exact moderate deviation asymptotics in streaming data transmission. ISIT 2017: 1252-1256 - [c15]Si-Hyeon Lee, Ligong Wang, Ashish Khisti, Gregory W. Wornell:
Covert communication with noncausal channel-state information at the transmitter. ISIT 2017: 2830-2834 - [i12]Si-Hyeon Lee, Ligong Wang, Ashish Khisti, Gregory W. Wornell:
Covert Communication with Channel-State Information at the Transmitter. CoRR abs/1708.02501 (2017) - [i11]Vincent Y. F. Tan, Si-Hyeon Lee:
Time-Division Transmission is Optimal for Covert Communication over Broadcast Channels. CoRR abs/1710.09754 (2017) - 2016
- [j6]Si-Hyeon Lee, Ashish Khisti:
The Gaussian Diamond-Wiretap Channel With Conferencing Relays. IEEE Commun. Lett. 20(7): 1393-1396 (2016) - [j5]Wanyao Zhao, Si-Hyeon Lee, Ashish Khisti:
Phase-Only Zero Forcing for Secure Communication With Multiple Antennas. IEEE J. Sel. Top. Signal Process. 10(8): 1334-1345 (2016) - [j4]Si-Hyeon Lee
Streaming Data Transmission in the Moderate Deviations and Central Limit Regimes. IEEE Trans. Inf. Theory 62(12): 6816-6830 (2016) - [c14]Si-Hyeon Lee, Wanyao Zhao, Ashish Khisti:
Secure degrees of freedom of the Gaussian diamond-wiretap channel. ISIT 2016: 2819-2823 - [c13]Si-Hyeon Lee, Vincent Y. F. Tan, Ashish Khisti:
Streaming data transmission in the moderate deviations and central limit regimes. ISIT 2016: 3072-3076 - [i10]Si-Hyeon Lee, Vincent Y. F. Tan, Ashish Khisti:
Exact Moderate Deviation Asymptotics in Streaming Data Transmission. CoRR abs/1604.06848 (2016) - [i9]Si-Hyeon Lee, Ashish Khisti:
The Wiretapped Diamond-Relay Channel. CoRR abs/1606.05954 (2016) - 2015
- [j3]Si-Hyeon Lee, Ashish Khisti:
Degraded Gaussian Diamond-Wiretap Channel. IEEE Trans. Commun. 63(12): 5027-5038 (2015) - [c12]Si-Hyeon Lee, Ashish Khisti:
The degraded Gaussian diamond-wiretap channel. ISIT 2015: 106-110 - [c11]Si-Hyeon Lee, Sae-Young Chung:
A unified approach for network information theory. ISIT 2015: 1277-1281 - [c10]Si-Hyeon Lee, Sae-Young Chung:
Noisy network coding with partial DF. ISIT 2015: 2870-2874 - [i8]Si-Hyeon Lee, Ashish Khisti:
The Degraded Gaussian Diamond-Wiretap Channel. CoRR abs/1504.05900 (2015) - [i7]Si-Hyeon Lee, Sae-Young Chung:
Noisy Network Coding with Partial DF. CoRR abs/1505.05435 (2015) - [i6]Si-Hyeon Lee, Wanyao Zhao, Ashish Khisti:
Secure Degrees of Freedom of the Gaussian Diamond-Wiretap Channel. CoRR abs/1512.06291 (2015) - [i5]Si-Hyeon Lee, Vincent Y. F. Tan, Ashish Khisti:
Streaming Data Transmission in the Moderate Deviations and Central Limit Regimes. CoRR abs/1512.06298 (2015) - 2014
- [i4]Si-Hyeon Lee, Sae-Young Chung:
A Unified Achievability Theorem. CoRR abs/1401.6023 (2014) - 2013
- [j2]Si-Hyeon Lee, Sae-Young Chung:
Capacity of a Class of Multicast Tree Networks. IEEE Trans. Inf. Theory 59(6): 3848-3857 (2013) - [c9]Byungjun Kang, Si-Hyeon Lee, Sae-Young Chung, Changho Suh
A new achievable scheme for interference relay channels. ISIT 2013: 2419-2423 - [i3]Byungjun Kang, Si-Hyeon Lee, Sae-Young Chung, Changho Suh:
A New Achievable Scheme for Interference Relay Channels. CoRR abs/1303.1095 (2013) - 2012
- [j1]Si-Hyeon Lee, Sae-Young Chung:
Capacity Scaling of Wireless Ad Hoc Networks: Shannon Meets Maxwell. IEEE Trans. Inf. Theory 58(3): 1702-1715 (2012) - [c8]Haewon Jeong
Flashcast. APCC 2012: 448-449 - 2011
- [c7]Si-Hyeon Lee, Sae-Young Chung:
Capacity of less noisy relay channels. ISIT 2011: 1529-1533 - 2010
- [c6]Si-Hyeon Lee, Sae-Young Chung:
Capacity of a class of multicast tree networks. Allerton 2010: 1104-1109 - [c5]Si-Hyeon Lee, Sae-Young Chung:
Capacity of a class of tree networks. ISIT 2010: 515-519 - [c4]Si-Hyeon Lee, Sae-Young Chung:
Capacity scaling of wireless ad hoc networks: Effect of finite wavelength. ISIT 2010: 1713-1717 - [c3]Si-Hyeon Lee, Sae-Young Chung:
When is compress-and-forward optimal? ITA 2010: 64-66 - [i2]Si-Hyeon Lee, Sae-Young Chung:
Capacity Scaling of Wireless Ad Hoc Networks: Effect of Finite Wavelength. CoRR abs/1002.1337 (2010) - [i1]Si-Hyeon Lee, Sae-Young Chung:
Capacity of a Class of Multicast Tree Networks. CoRR abs/1005.2710 (2010)
2000 – 2009
- 2009
- [c2]Si-Hyeon Lee, Sae-Young Chung:
Degrees of Freedom of Cooperative MIMO in Cellular Networks. ICC 2009: 1-5 - 2008
- [c1]Si-Hyeon Lee, Sae-Young Chung:
Effect of channel correlation on the capacity scaling in wireless networks. ISIT 2008: 1128-1132
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-25 21:17 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: