Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kyungmok Oh

dblp:218/3653 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
LDPC codes
0.612022
Deep-Learning for Breaking the Trapping Sets in Low-Density Parity-Check Codes · IEEE Trans. Commun. 2022
Coding theory › error-correcting codes › decoding › iterative decoding
message-passing decoding
0.612022
Deep-Learning for Breaking the Trapping Sets in Low-Density Parity-Check Codes · IEEE Trans. Commun. 2022

Methods — techniques the papers use, named apart from their topics

deep learning · 0.6adaptive-error-path detection · 0.6
YearPublicationVenuePosition
2022 Deep-Learning for Breaking the Trapping Sets in Low-Density Parity-Check Codes
abstract
In the low-error rate regime, message-passing (MP) decoding for low-density parity-check (LDPC) codes is known to have performance degradation due to trapping sets (TSs), which often limits the use of LDPC codes for applications with low target error rates like storage devices. This work proposes a novel deep-learning based decoding algorithm which is tailored for breaking TSs. In particular, when MP decoding fails due to TSs, there exist pairs of unsatisfied check nodes (CNs) which are connected through paths only with error variable nodes (VNs), i.e., VNs with erroneous hard-decision results. The proposed algorithm efficiently identifies the paths with error VNs between unsatisfied CNs with the aid of deep-learning techniques. Then, the decoding failures are resolved by repeating the MP decoding after re-initializing the channel outputs for the error VNs in the identified paths. In addition, by analyzing the behaviors of the deep-learning based algorithm, we propose a low-complexity algorithm, called adaptive-error-path (AEP) detector. Simulation results show that the proposed algorithms efficiently break the TSs and significantly improve the error-floor performance in the low error-rate regime.
Seokju Han, Jieun Oh, Kyungmok Oh, Jeongseok Ha
IEEE Trans. Commun.3