default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHyun Kwang Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j25]Hyun Kwang Kim, Jieun Kwon
:
Classification of weighted posets and digraphs admitting the extended Hamming code to be a perfect code. Des. Codes Cryptogr. 90(10): 2249-2269 (2022)- 2020
- [j24]Jong Yoon Hyun, Hyun Kwang Kim, Yansheng Wu, Qin Yue:
Optimal minimal linear codes from posets. Des. Codes Cryptogr. 88(12): 2475-2492 (2020) - [i5]Jong Yoon Hyun, Hyun Kwang Kim, Yansheng Wu, Qin Yue:
Optimal minimal Linear codes from posets. CoRR abs/2008.07212 (2020)
2010 – 2019
- 2019
- [j23]Jong Yoon Hyun, Hyun Kwang Kim, Minwon Na:
Optimal non-projective linear codes constructed from down-sets. Discret. Appl. Math. 254: 135-145 (2019) - [j22]Jong Yoon Hyun, Hyun Kwang Kim, Jeong Rye Park:
Weighted Posets and Digraphs Admitting the Extended Hamming Code to be a Perfect Code. IEEE Trans. Inf. Theory 65(8): 4664-4672 (2019) - 2018
- [j21]Phan Thanh Toan, Hyun Kwang Kim, Jaeseon Kim:
Improved linear programming bound on sizes of doubly constant-weight codes. Finite Fields Their Appl. 54: 230-252 (2018) - 2014
- [j20]Soohak Choi, Jong Yoon Hyun, Hyun Kwang Kim:
Local duality theorem for q-ary 1-perfect codes. Des. Codes Cryptogr. 70(3): 305-311 (2014) - [j19]Hyun Kwang Kim, Phan Thanh Toan:
New inequalities for $$q$$ q -ary constant-weight codes. Des. Codes Cryptogr. 73(2): 369-381 (2014) - 2013
- [j18]Hyun Kwang Kim, Phan Thanh Toan:
Improved Semidefinite Programming Bound on Sizes of Codes. IEEE Trans. Inf. Theory 59(11): 7337-7345 (2013) - 2012
- [j17]Hyun Kwang Kim, Dae-Kyu Kim, Jon-Lark Kim:
Type I Codes over GF(4). Ars Comb. 106: 173-191 (2012) - [j16]Soohak Choi, Hyun Kwang Kim, Dong Yeol Oh:
Structures and lower bounds for binary covering arrays. Discret. Math. 312(19): 2958-2968 (2012) - [j15]Byung Gyun Kang, Hyun Kwang Kim, Phan Thanh Toan:
Delsarte's Linear Programming Bound for Constant-Weight Codes. IEEE Trans. Inf. Theory 58(9): 5956-5962 (2012) - [i4]Hyun Kwang Kim, Phan Thanh Toan:
Improved Semidefinite Programming Bound on Sizes of Codes. CoRR abs/1212.3467 (2012) - 2011
- [i3]Byung Gyun Kang, Hyun Kwang Kim, Phan Thanh Toan:
Improved Linear Programming Bounds on Sizes of Constant-Weight Codes. CoRR abs/1108.5104 (2011) - 2010
- [j14]Hyun Kwang Kim, Joon Yop Lee, Dong Yeol Oh:
Optimal single deletion correcting code of length four over an alphabet of even size. IEEE Trans. Inf. Theory 56(7): 3217-3220 (2010) - [i2]Hyun Kwang Kim, Joon Yop Lee, Dong Yeol Oh:
Construction of optimal codes in deletion and insertion metric. CoRR abs/1003.4057 (2010)
2000 – 2009
- 2009
- [j13]Hyun Kwang Kim:
Errata to "Evaluation of zeta function of the simplest cubic field at negative odd integers". Math. Comput. 78(265): 617-618 (2009) - 2008
- [j12]Jong Yoon Hyun, Hyun Kwang Kim:
Maximum distance separable poset codes. Des. Codes Cryptogr. 48(3): 247-261 (2008) - [j11]Sejeong Bang, Hyun Kwang Kim, Jack H. Koolen, Mitsugu Hirasaka, Sung Yell Song:
Preface. Discret. Math. 308(14): 2925 (2008) - [j10]Changrim Jang, Hyun Kwang Kim, Dong Yeol Oh, Yoomi Rho:
The poset structures admitting the extended binary Golay code to be a perfect code. Discret. Math. 308(18): 4057-4068 (2008) - [j9]Luciano Panek, Marcelo Firer, Hyun Kwang Kim, Jong Yoon Hyun:
Groups of linear isometries on poset structures. Discret. Math. 308(18): 4116-4123 (2008) - [j8]Hyun Kwang Kim, Denis S. Krotov:
The Poset Metrics That Allow Binary Codes of Codimension m -, (m-1)-, or (m-2)-Perfect. IEEE Trans. Inf. Theory 54(11): 5241-5246 (2008) - 2007
- [j7]Sungpyo Hong, Stoyan N. Kapralov, Hyun Kwang Kim, Dong Yeol Oh:
Uniqueness of some optimal superimposed codes. Probl. Inf. Transm. 43(2): 113-123 (2007) - [c1]Hyun Kwang Kim, Denis S. Krotov:
The poset metrics that allow binary codes of codimension m to be m-, (m - 1)-, or (m - 2)-perfect. ISIT 2007: 1371-1375 - [i1]Hyun Kwang Kim, Denis S. Krotov:
The poset metrics that allow binary codes of codimension m to be m-, (m-1)-, or (m-2)-perfect. CoRR abs/0705.2807 (2007) - 2005
- [j6]Hyun Kwang Kim, Dong Yeol Oh:
On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure. Discret. Math. 297(1-3): 174-181 (2005) - [j5]Hyun Kwang Kim, Dong Yeol Oh:
A classification of posets admitting the MacWilliams identity. IEEE Trans. Inf. Theory 51(4): 1424-1431 (2005) - 2004
- [j4]Jong Yoon Hyun, Hyun Kwang Kim:
The poset structures admitting the extended binary Hamming code to be a perfect code. Discret. Math. 288(1-3): 37-47 (2004) - [j3]Hyun Kwang Kim, Vladimir S. Lebedev:
On the Optimality of Trivial (w, r)-Cover-Free Codes. Probl. Inf. Transm. 40(3): 195-201 (2004) - 2003
- [j2]Jungmin Ahn, Hyun Kwang Kim, Jung Soo Kim, Mina Kim:
Classification of perfect linear codes with crown poset structure. Discret. Math. 268(1-3): 21-30 (2003) - 2002
- [j1]Hyun Kwang Kim, Jung Soo Kim:
Evaluation of zeta function of the simplest cubic field at negative odd integers. Math. Comput. 71(239): 1243-1262 (2002)
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-07 22:18 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:
