18 citations · 52 across the 31 of their papers we have counts for
31 papers
Some MDS and ACD codes over commutative non-unital rings of orders 4 and 9 (Revision)
Jon-Lark Kim, Marvin Olavides, Young Gun Roe
There are eleven finite rings of order denoted by to in alphabetical order. In particular, we consider and which are commutative non-unital ring…
Cyclic codes over a commutative non-unitary ring of order 4
Marvin Olavides, Jon-Lark Kim
Let be the commutative non-unitary ring of order arising in the classification of Fine. In this paper, we investigate cyclic codes over through their associated res…
Construction of self-orthogonal codes over a commutative non-unitary ring of order 25
Jon-Lark Kim, Marvin Olavides, Young Gun Roe
Codes over non-unitary rings have been studied recently. In particular, codes over the commutative non-unitary ring (in the classification of Fine) of order where i…
Fuzzy linear codes based on nested linear codes
Jon-Lark Kim
In this paper, we describe a correspondence between a fuzzy linear code and a family of nested linear codes. We also describe the arithmetic of fuzzy linear codes. As a special cla…
Binary self-orthogonal codes which meet the Griesmer bound or have optimal minimum distances
Minjia Shi, Shitao Li, Tor Helleseth +1
The purpose of this paper is two-fold. First, we characterize the existence of binary self-orthogonal codes meeting the Griesmer bound by employing Solomon-Stiffler codes and some…
Characterization and construction of optimal binary linear codes with one-dimensional hull
Shitao Li, Minjia Shi, Jon-Lark Kim
The hull of a linear code over finite fields is the intersection of the code and its dual, and linear codes with small hulls have applications in computational complexity and infor…
Binary optimal linear codes with various hull dimensions and entanglement-assisted QECC
Jon-Lark Kim
The hull of a linear code is the intersection of with its dual. To the best of our knowledge, there are very few constructions of binary linear codes with the hull dimensio…
Two conjectures on the largest minimum distances of binary self-orthogonal codes with dimension 5
Minjia Shi, Shitao Li, Jon-Lark Kim
The purpose of this paper is to solve the two conjectures on the largest minimum distance of a binary self-orthogonal code proposed by Kim and Choi (IEEE Tran…
Extending binary linear codes to self-orthogonal codes
Jon-Lark Kim, Whan-Hyuk Choi
Kim et al. (2021) gave a method to embed a given binary code into a self-orthogonal code of the shortest length which has the same dimension …
Self-orthogonal codes over a non-unital ring and combinatorial matrices
Minjia Shi, Shukai Wang, Jon-Lark Kim +1
There is a local ring of order without identity for the multiplication, defined by generators and relations as $E=\langle a,b \mid 2a=2b=0,\, a^2=a,\, b^2=b,\,ab=a,\, ba=b…
DNA codes over two noncommutative rings of order four
Jon-Lark Kim, Dong Eun Ohk
In this paper, we describe a new type of DNA codes over two noncommutative rings and of order four with characteristic 2. Our DNA codes are based on quasi self-dual codes o…
Self-dual codes over with symmetric generator matrices
Whan-Hyuk Choi, Jon-Lark Kim
We introduce a consistent and efficient method to construct self-dual codes over with symmetric generator matrices from a self-dual code over of smaller length wher…
Embedding linear codes into self-orthogonal codes and their optimal minimum distances
Jon-Lark Kim, Young-Hun Kim, Nari Lee
We obtain a characterization on self-orthogonality for a given binary linear code in terms of the number of column vectors in its generator matrix, which extends the result of Bouy…
Projection decoding of some binary optimal linear codes of lengths 36 and 40
Lucky Galvez, Jon-Lark Kim
Practically good error-correcting codes should have good parameters and efficient decoding algorithms. Some algebraically defined good codes such as cyclic codes, Reed-Solomon code…
McNie: A code-based public-key cryptosystem
Jon-Lark Kim, Young-Sik Kim, Lucky Galvez +2
In this paper, we suggest a code-based public key encryption scheme, called McNie. McNie is a hybrid version of the McEliece and Niederreiter cryptosystems and its security is redu…
McNie2-Gabidulin: An improvement of McNie public key encryption using Gabidulin code
Jon-Lark Kim, Young-Sik Kim, Lucky Galvez +1
McNie is a code-based public key encryption scheme submitted as a candidate to the NIST Post-Quantum Cryptography standardization. In this paper, we present McNie2-Gabidulin, an im…
Recent results on Choi's orthogonal Latin squares
Jon-Lark Kim, Dong Eun Ohk, Doo Young Park +1
Choi Seok-Jeong studied Latin squares at least 60 years earlier than Euler although this was less known. He introduced a pair of orthogonal Latin squares of order 9 in his book. In…
New cubic self-dual codes of length 54, 60 and 66
Pınar Çomak, Jon-Lark Kim, Ferruh Özbudak
We study the construction of quasi-cyclic self-dual codes, especially of binary cubic ones. We consider the binary quasi-cyclic codes of length 3\ell with the algebraic approach of…
Secret sharing schemes based on additive codes over
Jon-Lark Kim, Nari Lee
A secret sharing scheme (SSS) was introduced by Shamir in 1979 using polynomial interpolation. Later it turned out that it is equivalent to an SSS based on a Reed-Solomon code. SSS…
A Projection Decoding of a Binary Extremal Self-Dual Code of Length
Jon-Lark Kim, Nari Lee
As far as we know, there is no decoding algorithm of any binary self-dual code except for the syndrome decoding applied to the code directly. This syndrome decoding f…
Some Bounds on Binary LCD Codes
Lucky Galvez, Jon-Lark Kim, Nari Lee +2
A linear code with a complementary dual (or LCD code) is defined to be a linear code whose dual code satisfies = . Le…
The combinatorics of LCD codes: Linear Programming bound and orthogonal matrices
Steven T. Dougherty, Jon-Lark Kim, Buket Ozkaya +2
Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial desig…
Higher-order CIS codes
Claude Carlet, Finley Freibert, Sylvain Guilley +3
We introduce {\bf complementary information set codes} of higher-order. A binary linear code of length and dimension is called a complementary information set code of orde…
Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions
Yeow Meng Chee, Zouha Cherif, Jean-Luc Danger +5
We introduce the class of multiply constant-weight codes to improve the reliability of certain physically unclonable function (PUF) response. We extend classical coding methods to…