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

Sy-Hann Huang

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

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

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
reed-muller codes		 0.011995
On bit-level trellis complexity of Reed-Muller codes · IEEE Trans. Inf. Theory 1995
Coding theory › error-correcting codes › convolutional codes
trellis complexity		 0.011995
On bit-level trellis complexity of Reed-Muller codes · IEEE Trans. Inf. Theory 1995
Coding theory › error-correcting codes
convolutional codes		 0.011995
On bit-level trellis complexity of Reed-Muller codes · IEEE Trans. Inf. Theory 1995
Coding theory › error-correcting codes › convolutional codes › trellis complexity
minimal trellis		 0.011995
On bit-level trellis complexity of Reed-Muller codes · IEEE Trans. Inf. Theory 1995

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

recursive state dimension formula · 0.0
YearPublicationVenuePosition
1995 On bit-level trellis complexity of Reed-Muller codes
abstract
A formula, which relates the state dimensions of a minimal trellis of a Reed-Muller code to those of another Reed-Muller code with lower order and shorter length, is derived. The state dimension at every position of a minimal trellis of any Reed-Muller code can be obtained by a recursive application of this formula.
Chung-Chin Lu, Sy-Hann Huang
 IEEE Trans. Inf. Theory2