default search action
Jaemin Han
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j6]Seunghee Han, Bo-Sung Kim, Jaemin Han, Kyehee Kim, JooSeok Song:
Adaptive Data Placement for Improving Performance of Online Social Network Services in a Multicloud Environment. Sci. Program. 2017: 2824782:1-2824782:17 (2017) - 2016
- [j5]Jaemin Han, Chih-Chun Wang:
General Capacity Region for the Fully Connected Three-Node Packet Erasure Network. IEEE Trans. Inf. Theory 62(10): 5503-5523 (2016) - [c9]Jaemin Han, Chih-Chun Wang:
Linear network coding capacity region of the smart repeater with broadcast erasure channels. ISIT 2016: 2144-2148 - [i2]Jaemin Han, Chih-Chun Wang:
Linear Network Coding Capacity Region of The Smart Repeater with Broadcast Erasure Channels. CoRR abs/1605.01331 (2016) - 2015
- [c8]Jaemin Han, Chih-Chun Wang:
General capacity region for the fully-connected 3-node packet erasure network. ISIT 2015: 2648-2652 - 2014
- [j4]Chih-Chun Wang, Jaemin Han:
The Capacity Region of Two-Receiver Multiple-Input Broadcast Packet Erasure Channels With Channel Output Feedback. IEEE Trans. Inf. Theory 60(9): 5597-5626 (2014) - 2013
- [i1]Jaemin Han, Chih-Chun Wang, Ness B. Shroff:
Graph-Theoretic Characterization of The Feasibility of The Precoding-Based 3-Unicast Interference Alignment Scheme. CoRR abs/1305.0503 (2013) - 2011
- [c7]Jaemin Han, Chih-Chun Wang, Ness B. Shroff:
Analysis of precoding-based intersession network coding and the corresponding 3-unicast interference alignment scheme. Allerton 2011: 1033-1040 - [c6]Chih-Chun Wang, Jaemin Han:
Common information of random linear network coding over a 1-hop broadcast packet erasure channel. ISIT 2011: 1708-1712 - 2010
- [j3]Hyeyoung Kim, Jae-Nam Lee, Jaemin Han:
The role of IT in business ecosystems. Commun. ACM 53(5): 151-156 (2010)
2000 – 2009
- 2009
- [j2]Jaemin Han, Eunsung Oh, Hyungsik Ju, Daesik Hong:
Asymmetric diversity modulation scheme in wireless fading relay channels. IEEE Trans. Wirel. Commun. 8(7): 3442-3447 (2009) - [c5]Eunsung Oh, Jaemin Han, Hyungsik Ju, Daesik Hong:
A Novel Rate Allocation Scheme for Throughput Maximization Considering Rate Fairness in Wireless Relay Systems. VTC Spring 2009 - 2008
- [j1]Jaemin Han, Eunsung Oh, Seongwoo Ahn, Daesik Hong:
A Simple Technique to Enhance Diversity Order in Wireless Fading Relay Channels. IEEE Commun. Lett. 12(3): 194-196 (2008) - [c4]Hyeyoung Kim, Jae-Nam Lee, Jaemin Han:
The Role of IT in a Healthy Business Ecosystem: An Exploratory Study of the Korean Capital Market from a Keystone Company's Perspective. PACIS 2008: 171 - [c3]Hyeyoung Kim, Jae-Nam Lee, Jaemin Han:
The Role of IT in the Relationship between Business Ecosystem's Healthiness and Flagship Firm's Performance: A Conceptual Foundation and Empirical Validation. PACIS 2008: 276 - 2005
- [c2]Seungbong Park, Jaemin Han, Jongsoo Yoon:
The New Perspective on Private Cyber Coins in Electronic Commerce: A Korean Case. EC-Web 2005: 297-305 - 2004
- [c1]Yoojung Kim, Jongsoo Yoon, Seungbong Park, Jaemin Han:
Architecture for Implementing the Mobile Government Services in Korea. ER (Workshops) 2004: 601-614
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-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint