11 citations · 30 across the 13 of their papers we have counts for
5 papers · 1 filter
Optimal minimal Linear codes from posets
Jong Yoon Hyun, Hyun Kwang Kim, Yansheng Wu +1
Recently, some infinite families of minimal and optimal binary linear codes were constructed from simplicial complexes by Hyun {\em et al.} We extend this construction method to ar…
Improved Semidefinite Programming Bound on Sizes of Codes
Hyun Kwang Kim, Phan Thanh Toan
Let (respectively ) be the maximum possible number of codewords in a binary code (respectively binary constant-weight code) of length and minimum Hamming…
Improved Linear Programming Bounds on Sizes of Constant-Weight Codes
Byung Gyun Kang, Hyun Kwang Kim, Phan Thanh Toan
Let be the largest possible size of an constant-weight binary code. By adding new constraints to Delsarte linear programming, we obtain twenty three new upper…
Construction of optimal codes in deletion and insertion metric
Hyun Kwang Kim, Joon Yop Lee, Dong Yeol Oh
We improve Levenshtein's upper bound for the cardinality of a code of length four that is capable of correcting single deletions over an alphabet of even size. We also illustrate t…
Optimal codes in deletion and insertion metric
Hyun Kwang Kim, Joon Yop Lee, Dong Yeol Oh
We improve the upper bound of Levenshtein for the cardinality of a code of length 4 capable of correcting single deletions over an alphabet of even size. We also illustrate that th…