J
Jon-Lark Kim
Researcher at Sogang University
Publications - 130
Citations - 1628
Jon-Lark Kim is an academic researcher from Sogang University. The author has contributed to research in topics: Linear code & Block code. The author has an hindex of 21, co-authored 113 publications receiving 1365 citations. Previous affiliations of Jon-Lark Kim include University of Louisville & University of Illinois at Urbana–Champaign.
Papers
More filters
Journal ArticleDOI
Self-dual codes over commutative Frobenius rings
TL;DR: The building-up construction for finite commutative Frobenius rings is generalized, showing that all self-dual codes with minimum weight greater than 2 can be obtained in this manner in cases where the construction applies.
Journal ArticleDOI
Euclidean and hermitian self-dual MDS codes over large finite fields
Jon-Lark Kim,Yoonjin Lee +1 more
TL;DR: This paper builds many Euclidean and Hermitian self-dual MDS codes of length up to 12 over various finite fields GF(q), where q = 8, 9, 16, 25, 32, 41, 49, 53, 64, 81, and 128.
Journal ArticleDOI
Explicit construction of families of LDPC codes with no 4-cycles
TL;DR: It is proved that for an odd prime p, LU(3,p) is a [p/sup 3/,k] code with k/spl ges/(p/Sup 3/-2p/ Sup 2/+3p-2)/2, and it is shown that the minimum weight and the weight of the minimum stopping set of LU (3,q) are at least 2q and they are exactly 2q for many LU( 3,q).
Journal ArticleDOI
The combinatorics of LCD codes: linear programming bound and orthogonal matrices
TL;DR: In this article, a linear programming bound on the largest size of a linear complementary dual (LCD) code of given length and minimum distance is given, and a table of lower bounds for this combinatorial function for modest values of the parameters.
Journal ArticleDOI
New MDS or Near-MDS Self-Dual Codes
TL;DR: It is shown that there exists a Euclidean self-dual MDS code of length n = q over GF(q) whenever q = 2m (m ges 2) using a Reed-Solomon (RS) code and its extension.