default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSunghyu Han
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j15]Sunghyu Han
:
MDS Self-Dual Codes and Antiorthogonal Matrices over Galois Rings. Inf. 10(4): 153 (2019)- 2018
- [j14]Sunghyu Han:
Additive Self-Dual Codes over GF(4) with Minimal Shadow. Inf. 9(4): 81 (2018) - [j13]Sunghyu Han:
Near-Extremal Type I Self-Dual Codes with Minimal Shadow over GF(2) and GF(4). Inf. 9(7): 172 (2018) - 2017
- [j12]Sunghyu Han:
On the Problem of the Existence of a Square Matrix U Such That UUT = -I over Zpm. Inf. 8(3): 80 (2017) - 2016
- [j11]Sunghyu Han, Il-Yong Lee, Jung-Ho Ahn:
Two-Dimensional Joint Bayesian Method for Face Verification. J. Inf. Process. Syst. 12(3): 381-391 (2016) - 2015
- [j10]Sunghyu Han:
A method for constructing self-dual codes over ℤ2m. Des. Codes Cryptogr. 75(2): 253-262 (2015) - [c4]Alex Olsen, Sunghyu Han, Brendan Calvert, Peter Ridd, Owen Kenny:
In Situ Leaf Classification Using Histograms of Oriented Gradients. DICTA 2015: 1-8 - 2014
- [c3]Sunghyu Han:
On the Weight Enumerators of the Projections of the 2-adic Golay Code of Length 24 to Z2e. ICMS 2014: 111-114 - 2012
- [j9]Sunghyu Han, Jon-Lark Kim, Heisook Lee, Yoonjin Lee:
Construction of quasi-cyclic self-dual codes. Finite Fields Their Appl. 18(3): 613-633 (2012) - [c2]Markus Grassl, Sunghyu Han:
Computing extensions of linear codes using a greedy algorithm. ISIT 2012: 1568-1572 - [i2]Sunghyu Han, Jon-Lark Kim, Heisook Lee, Yoonjin Lee:
Construction of quasi-cyclic self-dual codes. CoRR abs/1201.6012 (2012) - [i1]Sunghyu Han, Jon-Lark Kim:
Computational Results of Duadic Double Circulant Codes. CoRR abs/1202.0992 (2012) - 2011
- [j8]Steven T. Dougherty, Sunghyu Han, Hongwei Liu:
Higher weights for codes over rings. Appl. Algebra Eng. Commun. Comput. 22(2): 113-135 (2011) - [j7]Sunghyu Han, Heisook Lee, Yoonjin Lee:
Binary formally self-dual odd codes. Des. Codes Cryptogr. 61(2): 141-150 (2011) - [j6]Sunghyu Han:
Finding Good Linear Codes Using a Simple Extension Algorithm. IEEE Trans. Inf. Theory 57(10): 6729-6733 (2011) - 2010
- [j5]Sunghyu Han, Jon-Lark Kim:
Formally self-dual additive codes over F4. J. Symb. Comput. 45(7): 787-799 (2010)
2000 – 2009
- 2009
- [j4]Sunghyu Han, Jon-Lark Kim:
The nonexistence of near-extremal formally self-dual codes. Des. Codes Cryptogr. 51(1): 69-77 (2009) - [c1]Sunghyu Han, Heisook Lee, Yoonjin Lee, Jon-Lark Kim:
Construction of cubic self-dual codes. ISIT 2009: 2396-2399 - 2008
- [j3]Sunghyu Han, Jon-Lark Kim:
On self-dual codes over F5. Des. Codes Cryptogr. 48(1): 43-58 (2008) - [j2]Sunghyu Han, Jon-Lark Kim:
Upper Bounds for the Lengths of s-Extremal Codes Over F2, F4, and F2 + uF2. IEEE Trans. Inf. Theory 54(1): 418-422 (2008) - 2007
- [j1]Sunghyu Han, June Bok Lee:
Nonexistence of near-extremal formally self-dual even codes of length divisible by 8. Discret. Appl. Math. 155(8): 1031-1037 (2007)
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-08-10 01:24 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:
