Yong Hoon Lee

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Woohyuk Chang

> Home > Persons > Yong Hoon Lee

Publications

2010
[j44]
- view
  authority control:
- export record
  dblp key:
  - journals/twc/ChangCL10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/twc/ChangCL10
Woohyuk Chang, Sae-Young Chung, Yong Hoon Lee:
Achievable rates for cognitive radios opportunistically permitting excessive secondary-to-primary interference. IEEE Trans. Wirel. Commun. 9(2): 674-683 (2010)
[i5]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1011-5065
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1011-5065
Woohyuk Chang, Sae-Young Chung, Yong Hoon Lee:
Gaussian Relay Channel Capacity to Within a Fixed Number of Bits. CoRR abs/1011.5065 (2010)
2007
[c31]
- view
  authority control:
- export record
  dblp key:
  - conf/icc/NamCCL07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icc/NamCCL07
Wooseok Nam, Woohyuk Chang, Sae-Young Chung, Yong Hoon Lee:
Transmit Optimization for Relay-Based Cellular OFDMA Systems. ICC 2007: 5714-5719
2006
[c24]
- view
  authority control:
- export record
  dblp key:
  - conf/isit/ChangCL06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/ChangCL06
Woohyuk Chang, Sae-Young Chung, Yong Hoon Lee:
Diversity-Multiplexing Tradeoff in Rank-Deficient and Spatially Correlated MIMO Channels. ISIT 2006: 1144-1148

a service of

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.