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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Dong-Jing Lee

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

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

Systems, architecture and hardware · 1

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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › constrained coding › spectral-null codes
second-order spectral-null codes		 0.112006
Some New Efficient Second-Order Spectral-Null Codes with Small Lookup Tables · IEEE Trans. Computers 2006
Coding theory › constrained coding
spectral-null codes		 0.112006
Some New Efficient Second-Order Spectral-Null Codes with Small Lookup Tables · IEEE Trans. Computers 2006
Coding theory
constrained coding		 0.012006
Some New Efficient Second-Order Spectral-Null Codes with Small Lookup Tables · IEEE Trans. Computers 2006

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

enumerative coding · 0.1
YearPublicationVenuePosition
2006 Some New Efficient Second-Order Spectral-Null Codes with Small Lookup Tables
abstract
Tallini and Bose introduced a recursive method to construct second-order spectral-null codes which result in short (information length 16) base optimal second-order spectral-null codes that can be easily implemented either with table lookup or enumerative coding. In this paper, the extended base suboptimal second-order spectral-null codes (17 information length 32) obtained from two short base codes by lookup table are used to reduce the overall code length.
Ching-Nung Yang, Dong-Jing Lee
 IEEE Trans. Computers2