Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHyun Jin Kim 0002
Person information
- affiliation: Yonsei University, Department of Mathematics, Yeonsu-gu, Incheon, South Korea
- affiliation (former): Ewha Womans University, Institute of Mathematical Sciences, Seoul, South Korea
Other persons with the same name
- Hyunjin Kim (aka: Hyun-Jin Kim, Hyun Jin Kim, HyunJin Kim) — disambiguation page
- Hyun Jin Kim 0001
![[0000-0001-5017-3995]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-5017-3995")
(aka: Hyunjin Kim 0001) — Dankook University, Yongin-si, Republic of Korea - Hyun Jin Kim 0003 — HeartFlow Inc., Redwood City, CA, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Hyun Jin Kim, Whan-Hyuk Choi:
Reversible Self-Dual Codes Over the Ring F2 + uF2. IEEE Access 12: 1117-1129 (2024)- 2021
- [j15]Hyun Jin Kim, Whan-Hyuk Choi, Yoonjin Lee:
Designing DNA codes from reversible self-dual codes over GF(4). Discret. Math. 344(1): 112159 (2021) - 2020
- [j14]Whan-Hyuk Choi, Hyun Jin Kim, Yoonjin Lee:
Construction of single-deletion-correcting DNA codes using CIS codes. Des. Codes Cryptogr. 88(12): 2581-2596 (2020) - [j13]Hyun Jin Kim, Whan-Hyuk Choi, Yoonjin Lee:
Construction of reversible self-dual codes. Finite Fields Their Appl. 67: 101714 (2020)
2010 – 2019
- 2018
- [j12]Hyun Jin Kim, Yoonjin Lee:
Extremal quasi-cyclic self-dual codes over finite fields. Finite Fields Their Appl. 52: 301-318 (2018) - 2017
- [j11]Hyun Jin Kim, Yoonjin Lee:
t-CIS codes over GF(p) and orthogonal arrays. Discret. Appl. Math. 217: 601-612 (2017) - [j10]Hyun Jin Kim, Yoonjin Lee:
Construction of isodual codes over GF(q). Finite Fields Their Appl. 45: 372-385 (2017) - 2016
- [j9]Hyun Jin Kim, Yoonjin Lee:
Complementary information set codes over GF(p). Des. Codes Cryptogr. 81(3): 541-555 (2016) - 2014
- [j8]Hyun Jin Kim, Yoonjin Lee:
Hermitian self-dual codes over 𝔽22m + u𝔽22m. Finite Fields Their Appl. 25: 106-131 (2014) - [j7]Hyun Jin Kim:
Lee-extremal self-dual codes over F2+uF2 of lengths 23 and 24. Finite Fields Their Appl. 29: 18-33 (2014) - 2013
- [j6]Hyun Jin Kim, Yoonjin Lee:
Corrigendum to "Construction of extremal self-dual codes over F2+uF2 with an automorphism of odd order" [Finite Fields and Their Applications 18 (2012) 971-992]. Finite Fields Their Appl. 23: 103-104 (2013) - [j5]Hyun Jin Kim, Yoonjin Lee:
Classification of Extremal Self-Dual Quaternary Codes of Lengths 30 and 32. IEEE Trans. Inf. Theory 59(4): 2352-2358 (2013) - 2012
- [j4]Hyun Jin Kim:
The binary extremal self-dual codes of lengths 38 and 40. Des. Codes Cryptogr. 63(1): 43-57 (2012) - [j3]Hyun Jin Kim, Yoonjin Lee:
Construction of extremal self-dual codes over F2+uF2 with an automorphism of odd order. Finite Fields Their Appl. 18(5): 971-992 (2012) - 2011
- [j2]Hyun Jin Kim, Heisook Lee, June Bok Lee, Yoonjin Lee:
Construction of self-dual codes with an automorphism of order p. Adv. Math. Commun. 5(1): 23-36 (2011) - 2010
- [j1]Hyun Jin Kim:
Self-dual codes with automorphism of order 3 having 8 cycles. Des. Codes Cryptogr. 57(3): 329-346 (2010)
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-06-10 23:28 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:
