Jong Yoon Hyun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jong Yoon Hyun has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Yoonjin Lee
Department of Mathematics, Ewha Womans University, Seoul, Republic of Korea
14 shared publications - Hyun Kwang Kim
Department of Mathematics, Pohang University of Science and Technology (POSTECH), Pohang, Republic of Korea
8 shared publications - Yansheng Wu
School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing, China
8 shared publications - Jungyun Lee
Department of Mathematics Education, Kangwon National University, Chunchen, South Korea
3 shared publications - Cunsheng Ding
Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong, China
2 shared publications - Eun-Kyung Cho
Department of Mathematics Pusan National University Republic of Korea
2 shared publications
Latest Publications
- 25 July 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (8) , 171
Characterization of $\ell $-form plateaued functions via association schemes- 25 July 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (8) , 171
Characterization of $\ell $-form plateaued functions via association schemes- 22 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. PP (00189448) , 1
Designs, linear codes, plateaued functions, and their interconnections
In this paper, we mainly investigate profound interconnections between combinatorial designs, linear codes, and Boolean functions. Firstly, we present a generic construction method for designs derived from Boolean functions and give a new concept of non-symmetric designs with the triple symmetric difference property (TSDP). Secondly, we provides an alternative proof for addition designs derived from plateaued functions, which need not be simple or symmetric. We characterize simple 2-designs on 2m−r points arising from r-plateaued functions in m variables, and show that addition designs from such functions with no nonzero linear structure satisfy the TSDP but not the double one, yielding non-symmetric simple 2-designs. Thirdly, we primarily explore the equivalence relationships between designs, linear codes, and plateaued functions. These investigations help resolve two open problems posed by Ding and Tang (Designs from Linear codes, Singapore: World Scientific, 2022: Problems 14.20, 14.23).We also compute the automorphism groups of addition designs of r-plateaued functions and of the linear codes of addition designs. This work extends results by Bending (SDP designs and their automorphism groups, Ph.D. thesis, 1993), and Dempwolff and Neumann (Des. Codes Cryptogr., 57, 373–381, 2010). Finally, we yield new Boolean functions producing two families of a 2-design whose parameters coincide with those of the complement of a point-hyperplane design and a TSDP design, despite being non-isomorphic.
- 22 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. PP (00189448) , 1
Designs, linear codes, plateaued functions, and their interconnections
In this paper, we mainly investigate profound interconnections between combinatorial designs, linear codes, and Boolean functions. Firstly, we present a generic construction method for designs derived from Boolean functions and give a new concept of non-symmetric designs with the triple symmetric difference property (TSDP). Secondly, we provides an alternative proof for addition designs derived from plateaued functions, which need not be simple or symmetric. We characterize simple 2-designs on 2m−r points arising from r-plateaued functions in m variables, and show that addition designs from such functions with no nonzero linear structure satisfy the TSDP but not the double one, yielding non-symmetric simple 2-designs. Thirdly, we primarily explore the equivalence relationships between designs, linear codes, and plateaued functions. These investigations help resolve two open problems posed by Ding and Tang (Designs from Linear codes, Singapore: World Scientific, 2022: Problems 14.20, 14.23).We also compute the automorphism groups of addition designs of r-plateaued functions and of the linear codes of addition designs. This work extends results by Bending (SDP designs and their automorphism groups, Ph.D. thesis, 1993), and Dempwolff and Neumann (Des. Codes Cryptogr., 57, 373–381, 2010). Finally, we yield new Boolean functions producing two families of a 2-design whose parameters coincide with those of the complement of a point-hyperplane design and a TSDP design, despite being non-isomorphic.
- Open Access
- 16 May 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (5) , 115
Ramanujan graphs from simplicial complexes with few blockers
- 16 May 2026
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 94 (5) , 115
Open AccessRamanujan graphs from simplicial complexes with few blockers
- 5 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. PP (00189448) , 1
Solomon-Stiffler Codes, Belov Codes, and Their Subfield Codes and Hull Dimensions
Solomon-Stiffler codes and Belov codes are two wellknown families of Griesmer codes that have recently attracted significant attention in recent coding-theoretic literature, due to their optimality and special algebraic structures. In this paper, we investigate their subfield codes and hull dimensions. Firstly, we establish the parameters of Solomon-Stiffler and Belov codes by means of exponential sums. Following the approach of Hyun et al. (IEEE Trans. Inf. Theory, 71(6): 4267-4283, 2025), we determine the exact parameters of the subfield codes of Solomon-Stiffler codes and Belov codes; for the non-projective case, the parameters are fixed, while for the projective case, they depend on the number of distinct types of generator matrices of the mutually disjoint subspaces. We also derive an explicit formula for the weight enumerators of Solomon-Stiffler codes. Secondly, we characterize the hull dimensions of Solomon-Stiffler codes and Belov codes, thereby extending the results of Shi et al. (J. Combin. Theory, Ser. A, 214: 106027, 2025) on the self-orthogonality of binary Solomon-Stiffler codes and Belov codes. As a consequence, we also obtain several families of self-orthogonal codes.
- 5 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. PP (00189448) , 1
Solomon-Stiffler Codes, Belov Codes, and Their Subfield Codes and Hull Dimensions
Solomon-Stiffler codes and Belov codes are two wellknown families of Griesmer codes that have recently attracted significant attention in recent coding-theoretic literature, due to their optimality and special algebraic structures. In this paper, we investigate their subfield codes and hull dimensions. Firstly, we establish the parameters of Solomon-Stiffler and Belov codes by means of exponential sums. Following the approach of Hyun et al. (IEEE Trans. Inf. Theory, 71(6): 4267-4283, 2025), we determine the exact parameters of the subfield codes of Solomon-Stiffler codes and Belov codes; for the non-projective case, the parameters are fixed, while for the projective case, they depend on the number of distinct types of generator matrices of the mutually disjoint subspaces. We also derive an explicit formula for the weight enumerators of Solomon-Stiffler codes. Secondly, we characterize the hull dimensions of Solomon-Stiffler codes and Belov codes, thereby extending the results of Shi et al. (J. Combin. Theory, Ser. A, 214: 106027, 2025) on the self-orthogonality of binary Solomon-Stiffler codes and Belov codes. As a consequence, we also obtain several families of self-orthogonal codes.
- 9 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (6) , 4267-4283
Optimal Trace Codes and Their Self-Orthogonality
The primary objective of this paper is the construction of optimal codes with self-orthogonality that can be used to construct quantum codes. Recently, Ding and Heng explored subfield codes, which can be viewed as trace codes. In this paper, we focus on investigating self-orthogonal optimal trace codes. First, we provide a novel description of trace codes by choosing suitable defining sets. Second, we determine the parameters of the codes and their trace codes whose defining sets are disjoint union of some affine subspaces in both non-projective cases and projective-cases. This result extends the main findings in Hu et al. (2022). Third, we compute the parameters of trace codes for MacDonald codes, including the first order Reed-Muller codes and simplex codes as special cases. Finally, we examine their self-orthogonality and distance-optimality to find several classes of self-orthogonal Griesmer codes. Additionally, we resolve a problem proposed by Ding and Heng as a byproduct.
- 9 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71 (6) , 4267-4283
Optimal Trace Codes and Their Self-Orthogonality
The primary objective of this paper is the construction of optimal codes with self-orthogonality that can be used to construct quantum codes. Recently, Ding and Heng explored subfield codes, which can be viewed as trace codes. In this paper, we focus on investigating self-orthogonal optimal trace codes. First, we provide a novel description of trace codes by choosing suitable defining sets. Second, we determine the parameters of the codes and their trace codes whose defining sets are disjoint union of some affine subspaces in both non-projective cases and projective-cases. This result extends the main findings in Hu et al. (2022). Third, we compute the parameters of trace codes for MacDonald codes, including the first order Reed-Muller codes and simplex codes as special cases. Finally, we examine their self-orthogonality and distance-optimality to find several classes of self-orthogonal Griesmer codes. Additionally, we resolve a problem proposed by Ding and Heng as a byproduct.
- 26 September 2024
- Published by Springer Nature in Cryptography and Communications
- Vol. 17 (1) , 57-85
Constructing optimal few weight quaternary linear codes via multivariable functions
- 26 September 2024
- Published by Springer Nature in Cryptography and Communications
- Vol. 17 (1) , 57-85
Constructing optimal few weight quaternary linear codes via multivariable functions
- 28 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (10) , 6912-6931
Infinite Families of Few Weight Optimal Binary Linear Codes From Multivariable Functions
We study the binary linear code families associated with certain types of multivariable functions. We observe that a majority of these codes are not optimal codes nor few weight codes yet. In this paper, we find infinite families of few weight (near-) optimal binary linear codes from our code families. Furthermore, we produce support t -designs ( t = 2 or 3) which cannot be determined by the Assmus-Mattson Theorem ; this is the first time that the result by Tang et al. was successfully used to prove that linear codes hold t -designs. As another application, we find many (near-) optimal quantum codes from the dual codes of our code families using the CSS construction . As a main method, we use the modified shortening method (simply, called shortening method ), which is applied to our code families. Using the results on the weight distributions of our shortened codes, we verify that our codes families support t -designs ( t = 2, 3).We emphasize that some infinite families of few weight optimal binary linear codes have new parameters.
- 28 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (10) , 6912-6931
Infinite Families of Few Weight Optimal Binary Linear Codes From Multivariable Functions
We study the binary linear code families associated with certain types of multivariable functions. We observe that a majority of these codes are not optimal codes nor few weight codes yet. In this paper, we find infinite families of few weight (near-) optimal binary linear codes from our code families. Furthermore, we produce support t -designs ( t = 2 or 3) which cannot be determined by the Assmus-Mattson Theorem ; this is the first time that the result by Tang et al. was successfully used to prove that linear codes hold t -designs. As another application, we find many (near-) optimal quantum codes from the dual codes of our code families using the CSS construction . As a main method, we use the modified shortening method (simply, called shortening method ), which is applied to our code families. Using the results on the weight distributions of our shortened codes, we verify that our codes families support t -designs ( t = 2, 3).We emphasize that some infinite families of few weight optimal binary linear codes have new parameters.
- 2 May 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (10) , 2731-2741
Characterization of weakly regular p-ary bent functions of $\ell $-form- 2 May 2024
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 92 (10) , 2731-2741
Characterization of weakly regular p-ary bent functions of $\ell $-form- 7 December 2023
- Published by Springer Nature in Cryptography and Communications
- Vol. 16 (3) , 579-600
The Griesmer codes of Belov type and optimal quaternary codes via multi-variable functions
- 7 December 2023
- Published by Springer Nature in Cryptography and Communications
- Vol. 16 (3) , 579-600
The Griesmer codes of Belov type and optimal quaternary codes via multi-variable functions
- 4 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 69 (12) , 7777-7783
Classification of Binary Combinatorial Metrics Which Admit MacWilliam’s Extension Theorem
The MacWilliams’ Extension Theorem (MET) with respect to a combinatorial metric states that every isomorphism between linear codes that preserves combinatorial weight can be extended to an isometric extension of the whole space. Pinheiro, Machado and Firer 19 proposed the problem of characterizing combinatorial metrics over a finite field with two elements that admit the MET. In this paper, we provide the complete description of such metrics.
- 4 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 69 (12) , 7777-7783
Classification of Binary Combinatorial Metrics Which Admit MacWilliam’s Extension Theorem
The MacWilliams’ Extension Theorem (MET) with respect to a combinatorial metric states that every isomorphism between linear codes that preserves combinatorial weight can be extended to an isometric extension of the whole space. Pinheiro, Machado and Firer 19 proposed the problem of characterizing combinatorial metrics over a finite field with two elements that admit the MET. In this paper, we provide the complete description of such metrics.