Gangsan Kim

Gangsan Kim

Auto-generated profile, based on publicly available information

Gangsan Kim

School of Electrical and Electronic Engineering, Yonsei University, Seoul, South Korea

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2019 in Journal of Veterinary Science
Verified
Journal Article
Open access
PDF file
GKGang-San Kim
Gang-San Kim
TKTaesik Kim
Taesik Kim
JSJoo-Sung Son
Joo-Sung Son
VLVan Dam Lai
Van Dam Lai
JPJung-Eun Park
Jung-Eun Park
IMIn-Pil Mo
In-Pil Mo
Kim GS, et al. J Vet Sci. 2019 Jul;20:e56. https://doi.org/10.4142/jvs.2019.20.e56

22 January 2026 in Entropy
Verified
Journal Article
Open access
PDF file
HCHyojeong Choi
Hyojeong Choi
GKGangsan Kim
Gangsan Kim
HSHong-Yeop Song
Hong-Yeop Song
SSSangung Shin
Sangung Shin
CLChulho Lee
Chulho Lee
HNHongjun Noh
Hongjun Noh
In this paper, we first prove (Theorem 1) that any two inputs producing the same output in a symmetric pair of discrete skew tent maps always have the same parity, meaning that they are either both even or both odd. Building on this property, we then propose (Definition 1) a new discrete chaotic map and prove that (Theorem 2) the proposed map is a bijection for all control parameters. We further prove that (Theorem 3) the discrete Lyapunov exponent (dLE) of the proposed map is not only positive but also approaches the maximum value among all permutation maps over the integers {0,1,…,2m−1} as m gets larger. In other words, (Corollary 1) the proposed map asymptotically achieves the highest possible chaotic divergence among the permutation maps over the integers {0,1,…,2m−1}. To provide some further evidence that the proposed map is highly chaotic, we present at the end some results from the numerical experiments. We calculate the approximation and permutation entropy of the output integer sequences. We also show the NIST SP800-22 tests results and correlation properties of some derived binary sequences.

16 November 2022 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
GKGangsan Kim
Gangsan Kim
HSHong-Yeop Song
Hong-Yeop Song
We define run sequences of period 2 n - 1 as the binary sequences where the distribution of runs of 0’s and runs of 1’s is exactly same as that for the maximal length linear shift resister sequences of period 2 n - 1. We first count the number of all the cyclically distinct run sequences of period 2 n - 1. For each n -tuple, we consider the average number of occurrences over all the run sequences of period 2 n - 1. We identify the n -tuples with average number 1 and, in particular, those that occur exactly once in every run sequence of period 2 n - 1. We finally prove that, as n increases, the average number of every non-zero n -tuple approaches to 1.

26 February 2026 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
GKGangsan Kim
Gangsan Kim
HSHong-Yeop Song
Hong-Yeop Song
GGGuang Gong
Guang Gong
This paper develops the theory and constructions of polyphase zero-ambiguity-zone (ZAZ) sequences for ISAC waveforms, enabling the ZAZ shape to be designed over delay–Doppler regions of interest and supporting flexible (including multi-mode) sensing–communication operation. We first prove that a polyphase sequence with an optimal rectangular auto-ZAZ must be a member of some uncorrelated optimal ZCZ sequence family, and conversely, any member of an uncorrelated optimal ZCZ sequence family has an optimal rectangular auto-ZAZ. We generalize the optimality condition on the rectangular ZAZ to that on centrally symmetric convex ZAZs in general. We propose some constructions of families of polyphase sequences with a strictly or asymptotically optimal rectangular ZAZ, and asymptotically optimal rhombic or hexagonal ZAZ from the flexible ZAZ configuration.

5 April 2024 in Entropy
Verified
Journal Article
Open access
PDF file
XJXiaoxiang Jin
Xiaoxiang Jin
GKGangsan Kim
Gangsan Kim
SCSangwon Chae
Sangwon Chae
HSHong-Yeop Song
Hong-Yeop Song
In this paper, we propose the zero-correlation-zone (ZCZ) of radius r on two-dimensional m×n sonar sequences and define the (m,n,r) ZCZ sonar sequences. We also define some new optimality of an (m,n,r) ZCZ sonar sequence which has the largest r for given m and n. Because of the ZCZ for perfect autocorrelation, we are able to relax the distinct difference property of the conventional sonar sequences, and hence, the autocorrelation of ZCZ sonar sequences outside ZCZ may not be upper bounded by 1. We may sometimes require such an ideal autocorrelation outside ZCZ, and we define ZCZ-DD sonar sequences, indicating that it has an additional distinct difference (DD) property. We first derive an upper bound on the ZCZ radius r in terms of m and n≥m. We next propose some constructions for (m,n,r) ZCZ sonar sequences, which leads to some very good constructive lower bound on r. Furthermore, this construction suggests that for m and r, the parameter n can be as large as possible indefinitely. We present some exhaustive search results on the existence of (m,n,r) ZCZ sonar sequences for some small values of r. For ZCZ-DD sonar sequences, we prove that some variations of Costas arrays construct some ZCZ-DD sonar sequences with ZCZ radius r=2. We also provide some exhaustive search results on the existence of (m,n,r) ZCZ-DD sonar sequences. Lots of open problems are listed at the end.

4 July 2025 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
HCHyojeong Choi
Hyojeong Choi
GKGangsan Kim
Gangsan Kim
HSHong-Yeop Song
Hong-Yeop Song
HNHongjun Noh
Hongjun Noh
In this brief, we investigate the chaotic characteristics of the integer sequences generated by primitive linear feedback shift registers (LFSRs) by interpreting the internal states as integers. We prove that the discrete Lyapunov exponent (dLE) of the permutations induced by these sequences from an L-stage primitive LFSR approches to the range between $\ln (\sqrt {3})$ and $\ln (2)$ as L increases indefinitely and hence the dynamic systems satisfy the definition of discrete chaos. Furthermore, the 0–1 test of the sequences yields statistics close to 1, supporting the conclusion that these sequences exhibit chaotic dynamics under both theoretical and empirical evaluations.