Daegeun Jee

dblp:400/6434 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0000-7507-3907ORCID · corroborated

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

Systems, architecture and hardware · 1 · 1 since 2021Computer 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 · 87% Graph algorithms and graph theory · 6% Computational geometry · 6%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware reliability and fault tolerance · 61% Memory systems · 39%

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

TopicWeightPapersLastEvidence papers
Coding theory
channel coding
1.012026
A New NB-LDPC Code Construction Method With Arbitrary Generalized Girth · IEEE Trans. Commun. 2026
Coding theory › error-correcting codes
code construction
1.012026
A New NB-LDPC Code Construction Method With Arbitrary Generalized Girth · IEEE Trans. Commun. 2026
Coding theory › error-correcting codes
LDPC codes
1.012026
A New NB-LDPC Code Construction Method With Arbitrary Generalized Girth · IEEE Trans. Commun. 2026
Coding theory › error-correcting codes › LDPC codes
non-binary LDPC codes
1.012026
A New NB-LDPC Code Construction Method With Arbitrary Generalized Girth · IEEE Trans. Commun. 2026
Memory systems
DRAM
0.912025
A New ECC Configuration Method for DRAM System Considering Metadata · IEEE Trans. Computers 2025
Hardware reliability and fault tolerance › error correction
error-correcting codes
0.912025
A New ECC Configuration Method for DRAM System Considering Metadata · IEEE Trans. Computers 2025
Hardware reliability and fault tolerance
error correction
0.912025
A New ECC Configuration Method for DRAM System Considering Metadata · IEEE Trans. Computers 2025
Graph algorithms and graph theory
graph representation
0.312026
A New NB-LDPC Code Construction Method With Arbitrary Generalized Girth · IEEE Trans. Commun. 2026
Computational geometry › intersection graphs
permutation graphs
0.312026
A New NB-LDPC Code Construction Method With Arbitrary Generalized Girth · IEEE Trans. Commun. 2026

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

decoding simulation · 1.0simulation · 0.9linear code construction · 0.9decoding algorithm · 0.9
YearPublicationVenuePosition
2026 A New NB-LDPC Code Construction Method With Arbitrary Generalized Girth
abstract
!Non-binary low density parity check (NB-LDPC) codes are known to have higher correction capability than their binary counterparts, low density parity check (LDPC) codes. The latest technique for analyzing NB-LDPC codes is to measure generalized girth. The generalized girth cannot be measured in a binary LDPC code, and can be considered an indicator for measuring the performance of NB-LDPC code. In this paper, we propose a new analysis method to represent NB-LDPC code as a graph. This graph is called a permutation graph. In this paper, we present and prove a reasoning for analyzing generalized girth using the permutation graph. This is a faster and simpler method than the existing generalized girth analysis method. The proposed code construction algorithm constructs NB-LDPC codes to have an arbitrary generalized girth length. Because the permutation graph-based analysis is applied, which is more effective than existing methods, the complexity of code construction is significantly reduced. This enables more efficient code construction. The decoding simulations show that the proposed method improves the correction performance of NB-LDPC codes compared to the existing state-of-the-art.
Jaeil Lim, Jaewon Chung, Donghun Jeong, Daegeun Jee, Eui-Cheol Lim
IEEE Trans. Commun.4
2025 A New ECC Configuration Method for DRAM System Considering Metadata
abstract
In this paper, a new ECC (error correcting code) solution for DRAM (dynamic random access memory) in computing systems is proposed. Existing papers on ECC for DRAM systems do not consider storage space for metadata. The methodology proposed in this paper considers storing metadata attached to a cacheline data in DRAM. We infer the maximum number of single-chip error correction cases that a linear code can support while considering metadata storage space. This can be said to be the maximum theoretical correction probability for a single chip error. A methodology to construct a code with maximum single-chip error correction is presented. A decoding methodology for the code is proposed. The proposed ECC solution can correct not only single chip failure but also additional small bit errors. We calculate the correction capability of the proposed methodology and verified it through simulation. The encoder and decoder hardware were synthesized and compared with existing methodologies.
Jaeil Lim, Jaewon Chung, Donghun Jeong, Daegeun Jee, Eui-Cheol Lim
IEEE Trans. Computers4