Hong-Yeop Song

Prof. Dr. Hong-Yeop Song


Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

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

Representative Publications

View All Publications
24 April 2017 in IEEE Communications Letters
Verified
Journal Article
Closed access
MNMi-Young Nam
Mi-Young Nam
HSHong-Yeop Song
Hong-Yeop Song
We propose a new construction for binary locally repairable codes (LRCs) based on a (partial) t-spread, which constructs an LRC with minimum distance d ≥ 6 and any locality r ≥ 2. Furthermore, we found that there are some cases in which the resulting codes are optimum in terms of the upper bound by Cadambe and Mazumdar in 2015.

20 February 2007 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
YKYoung-Joon Kim
Young-Joon Kim
HSHong-Yeop Song
Hong-Yeop Song
In this correspondence, we prove that the complex cross-correlation of a k-ary Sidel'nikov sequence of period q-1 and its constant multiple sequence is upper bounded by radicq+3, where q=pm and here p is an odd prime and m is a positive integer

16 July 2007 in IEEE Communications Letters
Verified
Journal Article
Closed access
SKSung-Ha Kim
Sung-Ha Kim
JKJoon-Sung Kim
Joon-Sung Kim
DKDae-Son Kim
Dae-Son Kim
HSHong-Yeop Song
Hong-Yeop Song
We propose a modification on the improved progressive-edge-growth(IPEG) algorithm. Proposed modification increases the connectivity of variable nodes using extrinsic message degree of variable nodes, which results in reducing the small stopping sets. Through computer simulation, we confirm that the codes constructed by the proposed algorithm have lower error floor than those constructed by the original IPEG algorithm.

4 June 2022 in Electronics Letters
Verified
Journal Article
Open access
IKInseon Kim
Inseon Kim
HSHong-Yeop Song
Hong-Yeop Song
In this paper, an algebraic construction of regular QC‐LDPC codes by using the modular multiplication table mod P and Golomb rulers are proposed. It is proved that the proposed QC‐LDPC codes based on a Golomb ruler of length L have girth at least 8 if . The error performance of the proposed QC‐LDPC codes are simulated with various Golomb rulers. The proposed codes of length around 300 from the optimal 6‐mark Golomb ruler have an additional coding gain of at least 0.1 dB over 5G NR LDPC codes, 0.5 dB over those given earlier by others, both at FER 10 −3 . Some non‐trivial techniques to increase the length of a given Golomb ruler with and without an additional mark for improving the performance of the codes from Golomb rulers up to 0.7 dB are also found.

1 July 2017 in Electronics Letters
Verified
Journal Article
Open access
PDF file
JPJ. Park
J. Park
IKI. Kim
I. Kim
HSHong-Yeop Song
Hong-Yeop Song
In this Letter, a new parity‐check‐concatenated (PCC) polar code construction that considers the number of minimum Hamming weight (MHW) codewords is proposed. The parity bits to reduce the number of MHW codewords as much as possible is successively constructed. The proposed construction can reduce the number of MHW codewords more than other codes. The results show that the proposed codes can outperform the other codes at a high signal‐to‐noise region.

24 August 2021 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
MSMin Kyu Song
Min Kyu Song
HSHong-Yeop Song
Hong-Yeop Song
In this paper, we give a new framework for constructing perfect sequences, called generalized Milewski sequences, over various alphabets including Polyphase (PSK) as well as Amplitude-and-Polyphase (APSK) in general, and for constructing optimal sets of such perfect sequences by using combinatorial designs, called circular Florentine arrays. Specifically, we prove that, given any positive integer $m\geq 1$ , (i) there exists a perfect sequence of period $mN^{2}$ for any positive integer $N$ if there exists a perfect sequence (polyphase or not) of length $m$ ; (ii) an optimal $k$ -set of perfect sequences of length $mN^{2}$ can be constructed if there exist both a $k \times N$ circular Florentine array and an optimal $k$ -set of perfect sequences all of length $m$ . This enables us to find some optimal $k$ -set of perfect sequences where $k > p_{\text {min}}-1$ , where $p_{\text {min}}$ is the smallest prime factor of $mN^{2}$ .