Gen-Cheng Wu

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

dblp:05/10122 · DBLP profile ↗

← Back

1ranked-venue papers

0as first author

0since 2021 · last 2011

—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

Topic	Weight	Papers	Last	Evidence papers
Coding theory › error-correcting codes › decoding › decoding algorithms › coding algorithms encoding and decoding algorithms	0.1	1	2011	Efficient Encoding/Decoding for Second-Order Spectral-Null Codes by Reducing Random Walks · IEEE Trans. Computers 2011
Coding theory › constrained coding › spectral-null codes second-order spectral-null codes	0.1	1	2011	Efficient Encoding/Decoding for Second-Order Spectral-Null Codes by Reducing Random Walks · IEEE Trans. Computers 2011
Coding theory › constrained coding spectral-null codes	0.1	1	2011	Efficient Encoding/Decoding for Second-Order Spectral-Null Codes by Reducing Random Walks · IEEE Trans. Computers 2011

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

tallini-bose random walk method · 0.1

Year	Publication	Venue	Position
2011	Efficient Encoding/Decoding for Second-Order Spectral-Null Codes by Reducing Random Walks abstract Second-order spectral-null (2-OSN) codes are, in general, constructed from concatenating any codewords in 2-OSN code. Most 2-OSN codes adopt the Tallini-Bose random walk method in encoding and decoding, which exchanges two adjacent bits each time in a binary vector. In this brief contribution, we give a new implementation of the Tallini-Bose random walk method for 2-OSN codes which is shown by experiment to be faster. Ching-Nung Yang, Chih-Yang Chiu, Gen-Cheng Wu	IEEE Trans. Computers	3