4 papers
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…
A Novel Approach to Counterexamples of the Polujan-Pott Conjecture via Set-Partition Permutations
Yansheng Wu, Jiaxin Wang, Jong Yoon Hyun
In this paper, we settle a conjecture of Polujan and Pott by constructing an explicit, infinite family of Maiorana--McFarland bent functions in variables with alge…
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.
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…