5 citations · 9 across the 9 of their papers we have counts for
9 papers
Characterization of -ary functions in terms of association schemes and its applications
Yansheng Wu, Jong Yoon Hyun, Yoonjin Lee
We obtain an explicit criterion for -ary functions to produce association schemes in terms of their Walsh spectrum. Employing this characterization, we explicitly find a correla…
New LCD MDS codes of non-Reed-Solomon type
Yansheng Wu, Jong Yoon Hyun, Yoonjin Lee
Both linear complementary dual (LCD) codes and maximum distance separable (MDS) codes have good algebraic structures, and they have interesting practical applications such as commu…
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…
Few-weight codes over associated with down sets and their distance optimal Gray image
Yansheng Wu, Jong Yoon Hyun
Let be an odd prime number. In this paper, we construct classes of codes over the ring , which are associated with down sets. We compute t…
Binary optimal linear codes from posets of the disjoint union of two chains
Yansheng Wu, Jong Yoon Hyun, Qin Yue
Recently, Chang and Hyun obtained some classes of binary optimal codes via simplicial complexes. In this letter, we utilize posets of the disjoint union of two chains to construct…
Sharp conditions for the existence of an even -factor in a graph
Eun-Kyung Cho, Jong Yoon Hyun, Suil O +1
Let and be positive integers. An even -factor of a graph is a spanning subgraph such that for every vertex , is even and $a \le d_H(v) \…