Demo Data from EDBT 2026 / reviewers in the wild / expert
Y. K. Han
dblp:27/5165
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Theory of computation · 1 · 1 first-author
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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › sequences
linear complexity |
0.1 | 1 | 2009 | New M -Ary Sequence Families With Low Correlation and Large Size · IEEE Trans. Inf. Theory 2009 |
Coding theory › sequences › sequence design
low-correlation sequence |
0.1 | 1 | 2009 | New M -Ary Sequence Families With Low Correlation and Large Size · IEEE Trans. Inf. Theory 2009 |
Coding theory › sequences
m-ary sequence |
0.1 | 1 | 2009 | New M -Ary Sequence Families With Low Correlation and Large Size · IEEE Trans. Inf. Theory 2009 |
Coding theory › sequences › pseudorandom sequences
power residue sequence |
0.1 | 1 | 2009 | New M -Ary Sequence Families With Low Correlation and Large Size · IEEE Trans. Inf. Theory 2009 |
Methods — techniques the papers use, named apart from their topics
shift-and-add method · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | New M -Ary Sequence Families With Low Correlation and Large SizeabstractIn this paper, we construct four$M$-ary sequence families from apower residue sequenceof odd prime period$p$and its constant multiple sequences using the shift-and-add method, when$M$is a divisor of$p-1$. We show that the maximum correlation values of the proposed sequence families are upper-bounded by$2\sqrt {p} +5$or$3\sqrt {p} +4$. In addition, we prove that the linear complexity of each sequence in the proposed families is either$p\!-\!1$or$p\!-\!{p-1 \over M}\!-\!1$. We also construct an$M$-ary sequence family fromSidel'nikov sequencesof period$p^m-1$by applying the same method, when$M$is a divisor of$p^m-1$. The proposed sequence family$\mathtilde {\cal F}_{\mmb s}$has larger size than the known$M$-ary Sidel'nikov sequence families, whereas they all have the same upper bound on the maximum correlation. Y. K. Han |
IEEE Trans. Inf. Theory | 1 |
| 1993 | Image reconstruction by a Hopfield neural network
Y. K. Han, Sim Heng Ong |
Image Vis. Comput. | 2 |