default search action
Jaehong Kim 0008
Person information
- affiliation: Samsung Electronics, Hwaseong, Korea
Other persons with the same name
- Jaehong Kim (aka: Jae-Hong Kim) — disambiguation page
- Jaehong Kim 0001
— Electronics and Telecommunications Research Institute, Daejeon, South Korea
- Jaehong Kim 0002
- Jaehong Kim 0003
- Jaehong Kim 0004
- Jaehong Kim 0005
- Jaehong Kim 0006 — Computer Science Department, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea
- Jaehong Kim 0007 — Chosun University, Gwangju, Korea
- Jaehong Kim 0009 — Seoul National University, Seoul, Korea
- Jaehong Kim 0010 — SK T-Brain
- Jaehong Kim 0011 — Youngdong University, Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [c7]Wooseong Cheong, Chanho Yoon, Seonghoon Woo, Kyuwook Han, Daehyun Kim, Chulseung Lee, Youra Choi, Shine Kim, Dongku Kang, Geunyeong Yu, Jaehong Kim, Jaechun Park, Ki-Whan Song, Ki-Tae Park, Sangyeun Cho, Hwaseok Oh, Daniel D. G. Lee, Jin-Hyeok Choi, Jaeheon Jeong:
A flash memory controller for 15μs ultra-low-latency SSD using high-speed 3D NAND flash with 3μs read time. ISSCC 2018: 338-340 - 2013
- [c6]Yongjune Kim
Modulation coding for flash memories. ICNC 2013: 961-967 - [i2]Yongjune Kim, Kyoung Lae Cho, Hongrak Son, Jaehong Kim, Jun Jin Kong, Jaejin Lee, B. V. K. Vijaya Kumar:
Modulation Coding for Flash Memories. CoRR abs/1304.4811 (2013) - 2012
- [j4]Yongjune Kim
Verify level control criteria for multi-level cell flash memories and their applications. EURASIP J. Adv. Signal Process. 2012: 196 (2012) - [c5]Kijun Lee, Sejin Lim, Jaehong Kim:
Low-cost, low-power and high-throughput BCH decoder for NAND Flash Memory. ISCAS 2012: 413-415
2000 – 2009
- 2009
- [j3]Jaehong Kim, Aditya Ramamoorthy, Steven W. McLaughlin:
The design of efficiently-encodable rate-compatible LDPC codes - [transactions papers]. IEEE Trans. Commun. 57(2): 365-375 (2009) - 2007
- [i1]Jaehong Kim, Aditya Ramamoorthy, Steven W. McLaughlin:
The Design of Efficiently-Encodable Rate-Compatible LDPC Codes. CoRR abs/0705.0543 (2007) - 2006
- [b1]Jaehong Kim:
The Design of Rate-Compatible Structured Low-Density Parity-Check Codes. Georgia Institute of Technology, Atlanta, GA, USA, 2006 - [j2]Jeongseok Ha, Jaehong Kim, Demijan Klinc, Steven W. McLaughlin:
Rate-compatible punctured low-density parity-check codes with short block lengths. IEEE Trans. Inf. Theory 52(2): 728-738 (2006) - [c4]Jaehong Kim, Aditya Ramamoorthy, Steven W. McLaughlin:
Design of Efficiently-Encodable Rate-Compatible Irregular LDPC Codes. ICC 2006: 1131-1136 - [c3]Jaehong Kim, Woonhaing Hur, Aditya Ramamoorthy, Steven W. McLaughlin:
Design of Rate-Compatible Irregular LDPC Codes for Incremental Redundancy Hybrid ARQ Systems. ISIT 2006: 1139-1143 - 2005
- [c2]Demijan Klinc, Jeongseok Ha, Jaehong Kim, Steven W. McLaughlin:
Rate-compatible punctured low-density parity-check codes for ultra wide band systems. GLOBECOM 2005: 5 - 2004
- [j1]Jeongseok Ha, Jaehong Kim, Steven W. McLaughlin:
Rate-Compatible Puncturing of Low-Density Parity-Check Codes. IEEE Trans. Inf. Theory 50(11): 2824-2836 (2004) - [c1]Jeongseok Ha, Jaehong Kim, Steven W. McLaughlin:
Puncturing for finite length low-density parity-check codes. ISIT 2004: 151
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-11-27 20:29 CET 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: