2 citations · 6 across the 24 of their papers we have counts for
25 papers · 1 filter
Explicit construction of optimal binary linear complementary pairs via Belov codes
Yansheng Wu, Jing Chen, Jong Yoon Hyun
The study of linear complementary pairs (LCPs) has been a hot topic in coding theory. Recently, Güneri constructed an infinite family of optimal binary LCPs from Solomon-Stiffler c…
Designs, linear codes, plateaued functions, and their interconnections
Jong Yoon Hyun, Jieun Kwon, Jiaxin Wang +1
In this paper, we mainly investigate profound interconnections between combinatorial designs, linear codes, and Boolean functions.
Improvement of the square-root low bounds on the minimum distances of BCH codes and Matrix-product codes
Xiaoqiang Wang, Liuyi Li, Yansheng Wu +2
The task of constructing infinite families of self-dual codes with unbounded lengths and minimum distances exhibiting square-root lower bounds is extremely challenging, especially…
A Survey on Codes from Simplicial Complexes
Yansheng Wu, Chao Li, Jong Yoon Hyun
In the field of mathematics, a purely combinatorial equivalent to a simplicial complex, or more generally, a down-set, is an abstract structure known as a family of sets. This fami…
Linear Complementary Dual Codes Constructed from Reinforcement Learning
Yansheng Wu, Jin Ma, Shandong Yang
Recently, Linear Complementary Dual (LCD) codes have garnered substantial interest within coding theory research due to their diverse applications and favorable attributes. This pa…
Quaternary codes and their binary images
Yansheng Wu, Chao Li, Lin Zhang +1
Recently, simplicial complexes are used in constructions of several infinite families of minimal and optimal linear codes by Hyun {\em et al.} Building upon their research, in this…
More MDS codes of non-Reed-Solomon type
Yansheng Wu, Ziling Heng, Chengju Li +1
MDS codes have diverse practical applications in communication systems, data storage, and quantum codes due to their algebraic properties and optimal error-correcting capability. I…
Two families of linear codes with desirable properties from some functions over finite fields
Ziling Heng, Xiaoru Li, Yansheng Wu +1
Linear codes are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes w…
Extended codes and deep holes of MDS codes
Yansheng Wu, Cunsheng Ding, Tingfang Chen
For a given linear code $\C$ of length over $\gf(q)$ and a nonzero vector $\bu$ in $\gf(q)^n$, Sun, Ding and Chen defined an extended linear code $\overline{\C}(\bu)$ of $\C$,…
Two classes of narrow-sense BCH codes and their duals
Xiaoqiang Wang, Jiaojiao Wang, Chengju Li +1
BCH codes and their dual codes are two special subclasses of cyclic codes and are the best linear codes in many cases. A lot of progress on the study of BCH cyclic codes has been m…
Quaternary linear codes and related binary subfield codes
Yansheng Wu, Chengju Li, Fu Xiao
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their bi…
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…
Further improvement on index bounds
Yansheng Wu, Yoonjin Lee, Qiang Wang
In this paper we obtain further improvement of index bounds for character sums of polynomials over finite fields. We present some examples, which show that our new bound is an impr…
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…
Ternary primitive LCD BCH codes
Xinmei Huang, Qin Yue, Yansheng Wu +1
Absolute coset leaders were first proposed by the authors which have advantages in constructing binary LCD BCH codes. As a continue work, in this paper we focus on ternary linear c…
Twisted Reed-Solomon Codes With One-dimensional Hull
Yansheng Wu
The hull of a linear code is defined to be the intersection of the code and its dual. When the size of the hull is small, it has been proved that some algorithms for checking permu…
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…
Binary LCD Codes and Self-orthogonal Codes via Simplicial Complexes
Yansheng Wu, Yoonjin Lee
Due to some practical applications, linear complementary dual (LCD) codes and self-orthogonal codes have attracted wide attention in recent years. In this paper, we use simplicial…
Self-reciprocal and self-conjugate-reciprocal irreducible factors of and their applications
Yansheng Wu, Qin Yue, Shuqin Fan
In this paper, we present some necessary and sufficient conditions under which an irreducible polynomial is self-reciprocal (SR) or self-conjugate-reciprocal (SCR). By these charac…
New quaternary codes derived from posets of the disjoint union of two chains
Xiaomeng Zhu, Yansheng Wu, Qin Yue
Based on the generic construction of linear codes, we construct linear codes over the ring via posets of the disjoint union of two chains. We determine the Lee weight di…
A class of functions with low-valued Walsh spectrum
Fengwei Li, Yansheng Wu, Qin Yue
Let , , be a prime, , the multiplicative order of a prime modulo , and . In this paper, we investigate the Walsh s…
Optimal few-weight codes from simplicial complexes
Yansheng Wu, Xiaomeng Zhu, Qin Yue
Recently, some infinite families of binary minimal and optimal linear codes are constructed from simplicial complexes by Hyun {\em et al}. Inspired by their work, we present two ne…
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…