◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Ki-Moon Lee

2 papers hereh-index 449 citations8 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1

Across the 1 of 2 papers where every author was matched, so the position is known.

fields
  • cs.IT2

identity via Semantic Scholar / OpenAlex

most citedKovalenko's Full-Rank Limit and Overhead as Lower Bounds for Error-Performances of LDPC and LT Codes over Binary Erasure Channels

4 citations · 4 across the 2 of their papers we have counts for

collaborators
Showing cs.ITShow all

2 papers · 1 filter

cs.IT2009

A Tight Estimate for Decoding Error-Probability of LT Codes Using Kovalenko's Rank Distribution

Ki-Moon Lee, Hayder Radha, Beom-Jin Kim

A new approach for estimating the Decoding Error-Probability (DEP) of LT codes with dense rows is derived by using the conditional Kovalenko's rank distribution. The estimate by th…

cs.IT2008★ 4 cited

Kovalenko's Full-Rank Limit and Overhead as Lower Bounds for Error-Performances of LDPC and LT Codes over Binary Erasure Channels

Ki-Moon Lee, Hayder Radha, Beom-Jin Kim

We present Kovalenko's full-rank limit as a tight lower bound for decoding error probability of LDPC codes and LT codes over BEC. From the limit, we derive a full-rank overhead as…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.