Jeongseok Ha
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jeongseok Ha has a total of 56 co-authors. Here are the top co-authors by number of shared publications:
- Sangseok Yun
Department of Information and Communications Engineering, Pukyong National University, Busan, South Korea
9 shared publications - Hyeonsik Yeom
Electronics and Telecommuinications Research Institute
7 shared publications - Hyunwoo Jung
Korea Advanced Institute of Science and Technology
6 shared publications - Il-Min Kim
Department of Electrical and Computer Engineering, Queen’s University, Kingston, ON K7L 3N6, Canada
6 shared publications - Jinho Choi
School of Electrical and Mechanical Engineering, University of Adelaide, Adelaide, SA, Australia
5 shared publications - Hung D. Nguyen
School of Electrical Engineering, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, South Korea
3 shared publications
Latest Publications
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 44 (20) , 8937-8951
Block-Wise Staircase Codes
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Lightwave Technology
- Vol. 44 (20) , 8937-8951
Block-Wise Staircase Codes
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (10) , 23657-23673
System-Level Performance Analysis of Uplink Cell-Free Massive MIMO With L-MMSE Combining Using Stochastic Geometry
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (10) , 23657-23673
System-Level Performance Analysis of Uplink Cell-Free Massive MIMO With L-MMSE Combining Using Stochastic Geometry
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (10) , 23626-23643
Performance Analysis of Uplink Cell-Free Massive MIMO With Local MMSE Combining and Variable Resolution ADCs
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (10) , 23626-23643
Performance Analysis of Uplink Cell-Free Massive MIMO With Local MMSE Combining and Variable Resolution ADCs
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (17) , 41070-41086
Fluid Antenna-Aided Cooperative Jamming in Uplink IoT Systems
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (17) , 41070-41086
Fluid Antenna-Aided Cooperative Jamming in Uplink IoT Systems
- 20 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 5090-5093
Comments on “On Covert Communication Performance With Outdated CSI in Wireless Greedy Relay Systems”
In a recent article, Bai et al. (2022) investigated the impact of outdated channel state information (CSI) on covert communication in wireless greedy relay networks. In this commentary, we identify a critical mathematical flaw in their derivation of the cumulative distribution function (CDF) of the outdated channel gain. The flaw fundamentally undermines the paper’s main results and conclusions regarding the impact of outdated CSI in such networks. To prevent future studies from building upon this incorrect foundation, we also provide a correction for the flaw and suggestions for future investigations into this problem. Beyond correcting a specific error, this commentary serves as a warning on the potential pitfalls in probabilistic modeling under outdated CSI.
- 20 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 21 (15566013) , 5090-5093
Comments on “On Covert Communication Performance With Outdated CSI in Wireless Greedy Relay Systems”
In a recent article, Bai et al. (2022) investigated the impact of outdated channel state information (CSI) on covert communication in wireless greedy relay networks. In this commentary, we identify a critical mathematical flaw in their derivation of the cumulative distribution function (CDF) of the outdated channel gain. The flaw fundamentally undermines the paper’s main results and conclusions regarding the impact of outdated CSI in such networks. To prevent future studies from building upon this incorrect foundation, we also provide a correction for the flaw and suggestions for future investigations into this problem. Beyond correcting a specific error, this commentary serves as a warning on the potential pitfalls in probabilistic modeling under outdated CSI.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44, 6118-6129
Evolutionary BP+OSD Decoding for Low-Latency Quantum Error Correction
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44, 6118-6129
Evolutionary BP+OSD Decoding for Low-Latency Quantum Error Correction
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 7, 2101416
Improved BP Decoding With Multiple Error-Path Detection for Topological Quantum Codes
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 7, 2101416
Open AccessImproved BP Decoding With Multiple Error-Path Detection for Topological Quantum Codes
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 11087-11101
Rate-Adaptive Vector Quantization for Deep Joint Source-Channel Coding
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 12, 11087-11101
Rate-Adaptive Vector Quantization for Deep Joint Source-Channel Coding
- 21 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 2218-2235
Beam Divergence Angle Optimization for Secure FSO-Based Space–Air Communications
This paper investigates the physical layer security of free-space optical (FSO) communication from a low Earth orbit (LEO) satellite to a high-altitude platform (HAP), in the presence of an eavesdropping HAP. Existing works typically assume identical channel statistics for both legitimate and eavesdropping HAPs, while favoring the legitimate one by presuming it captures a larger fraction of the optical beam power. In this work, we consider a more realistic model in which pointing errors (PEs) cause random beam displacements relative to the legitimate and eavesdropping HAPs, directly determining their received power. Assuming the satellite has access only to statistical channel state information of both HAPs, we derive closed-form expressions for connection outage probability (COP) and secrecy outage probability (SOP) to characterize the reliability and secrecy performance of the system. Through detailed analysis of COP and SOP, we reveal a fundamental reliability-secrecy trade-off in beam divergence angle (BDA). We then formulate an optimization problem that jointly optimizes BDA and wiretap code rates to maximize the system's secrecy throughput under both reliability and secrecy constraints. To solve this problem, we propose an algorithm providing the optimal solution, and also a low-complexity algorithm that yields the optimal solution in most practical scenarios. Numerical results demonstrate that the systems designed by the proposed algorithms achieve significantly improved secrecy throughput compared to conventional systems without the BDA optimization.
- 21 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 2218-2235
Beam Divergence Angle Optimization for Secure FSO-Based Space–Air Communications
This paper investigates the physical layer security of free-space optical (FSO) communication from a low Earth orbit (LEO) satellite to a high-altitude platform (HAP), in the presence of an eavesdropping HAP. Existing works typically assume identical channel statistics for both legitimate and eavesdropping HAPs, while favoring the legitimate one by presuming it captures a larger fraction of the optical beam power. In this work, we consider a more realistic model in which pointing errors (PEs) cause random beam displacements relative to the legitimate and eavesdropping HAPs, directly determining their received power. Assuming the satellite has access only to statistical channel state information of both HAPs, we derive closed-form expressions for connection outage probability (COP) and secrecy outage probability (SOP) to characterize the reliability and secrecy performance of the system. Through detailed analysis of COP and SOP, we reveal a fundamental reliability-secrecy trade-off in beam divergence angle (BDA). We then formulate an optimization problem that jointly optimizes BDA and wiretap code rates to maximize the system's secrecy throughput under both reliability and secrecy constraints. To solve this problem, we propose an algorithm providing the optimal solution, and also a low-complexity algorithm that yields the optimal solution in most practical scenarios. Numerical results demonstrate that the systems designed by the proposed algorithms achieve significantly improved secrecy throughput compared to conventional systems without the BDA optimization.
- Open Access
UAV-Assisted Downlink Satellite Covert Communication
This paper investigates the use of an unmanned aerial vehicle (UAV) to assist covert communication between a low-Earth orbit (LEO) satellite and a ground user under the surveillance of a passive warden. The UAV simultaneously serves its own ground network and acts as a friendly jammer to enhance the covertness of satellite transmissions. We derive a closed-form lower bound on the warden's average minimum detection error probability which is then used to define the covert constraint. Building on this, we formulate an optimization problem to jointly design the UAV's 3D placement, its power allocation, and the satellite's transmit power to maximize the system's covert rate. To solve the resulting non-convex problem, we propose an algorithm based on the block coordinate descent (BCD) and successive convex approximation (SCA) techniques, and further develop a Dinkelbach's algorithm for a special case. Numerical results validate the tightness of the derived bound and demonstrate the effectiveness of the proposed algorithms in configuring optimal system parameters.
Open AccessUAV-Assisted Downlink Satellite Covert Communication
This paper investigates the use of an unmanned aerial vehicle (UAV) to assist covert communication between a low-Earth orbit (LEO) satellite and a ground user under the surveillance of a passive warden. The UAV simultaneously serves its own ground network and acts as a friendly jammer to enhance the covertness of satellite transmissions. We derive a closed-form lower bound on the warden's average minimum detection error probability which is then used to define the covert constraint. Building on this, we formulate an optimization problem to jointly design the UAV's 3D placement, its power allocation, and the satellite's transmit power to maximize the system's covert rate. To solve the resulting non-convex problem, we propose an algorithm based on the block coordinate descent (BCD) and successive convex approximation (SCA) techniques, and further develop a Dinkelbach's algorithm for a special case. Numerical results validate the tightness of the derived bound and demonstrate the effectiveness of the proposed algorithms in configuring optimal system parameters.