◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Dae San Kim

229 papers hereh-index 326.1k citations674 works total

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

author position
  • sole author24
  • first author60
  • middle author48
  • last author78

Across the 210 of 229 papers where every author was matched, so the position is known.

fields
  • math.NT211
  • math.CO5
  • math.PR5
  • cs.IT4
  • math.CA3
  • math.GM1
same name
  • Dae San Kim — 4 papers
  • Dae San Kim — 2 papers, h 3
  • Dae San Kim — 1 paper, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20072026
most citedDegenerate Laplace transform and degenerate gamma function

106 citations · 573 across the 226 of their papers we have counts for

collaborators
Showing cs.ITShow all

4 papers · 1 filter

cs.IT2011

Simple proofs for duality of generalized minimum poset weights and weight distributions of (Near-)MDS poset codes

Dae San Kim, Dong Chan Kim, Jong Yoon Hyun

In 1991, Wei introduced generalized minimum Hamming weights for linear codes and showed their monotonicity and duality. Recently, several authors extended these results to the case…

cs.IT2010★ 2 cited

A family of sequences with large size and good correlation property arising from M-ary Sidelnikov sequences of period qd−1

Dae San Kim

Let q be any prime power and let d be a positive integer greater than 1. In this paper, we construct a family of M-ary sequences of period q−1 from a given M-ary, with $M…

cs.IT2007

Weight Distributions of Hamming Codes (II)

Dae San Kim

In a previous paper, we derived a recursive formula determining the weight distributions of the [n=(q^m-1)/(q-1)] Hamming code H(m,q), when (m,q-1)=1. Here q is a prime power. We n…

cs.IT2007★ 4 cited

Weight Distributions of Hamming Codes

Dae San Kim

We derive a recursive formula determing the weight distribution of the [n=(q^m-1)/(q-1), n-m, 3] Hamming code H(m,q), when (m, q-1)=1. Here q is a prime power. The proof is based o…

◍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.