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

Han-Ping Tsai

dblp:97/2452 · DBLP profile ↗
← Back
6ranked-venue papers
6as first author
0since 2021 · last 2008
—ORCID · none

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

Theory of computation · 6 · 6 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
6 papers
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 › block codes › linear code › self-dual codes
extremal self-dual codes		 0.262008
Construction of Self-Dual Codes · IEEE Trans. Inf. Theory 2008
Extremal self-dual codes of lengths 66 and 68 · IEEE Trans. Inf. Theory 1999
Some New Extremal Self-Dual [58, 29, 10] Codes · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes › block codes › linear code
self-dual codes		 0.262008
Construction of Self-Dual Codes · IEEE Trans. Inf. Theory 2008
Extremal self-dual codes of lengths 66 and 68 · IEEE Trans. Inf. Theory 1999
Some New Extremal Self-Dual [58, 29, 10] Codes · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes
code construction		 0.112008
Construction of Self-Dual Codes · IEEE Trans. Inf. Theory 2008
Coding theory › error-correcting codes
covering radius		 0.011997
The covering radius of extremal self-dual code D11 and its application · IEEE Trans. Inf. Theory 1997

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

construction method · 0.1code construction · 0.1weight enumerator analysis · 0.0
YearPublicationVenuePosition
2008 Construction of Self-Dual Codes
abstract
Construction methods for self-dual codes are given. By using these methods some new extremal self-dual$[{66, 33, 12}]$and$[{68, 34, 12}]$codes are obtained.
Han-Ping Tsai, Pei-Yu Shih, Ren-Yih Wu, Wen-Ku Su
 IEEE Trans. Inf. Theory1
1999 Extremal self-dual codes of lengths 66 and 68
abstract
New extremal self-dual codes of dimensions 33 and 34 are obtained.
Han-Ping Tsai
 IEEE Trans. Inf. Theory1
1998 Some New Extremal Self-Dual [58, 29, 10] Codes
abstract
The authors discuss extremal self-dual [60,30,12] codes and then go on to present new extremal self dual [58,29,10] codes.
Han-Ping Tsai, Yih-Jaw Jiang
 IEEE Trans. Inf. Theory1
1997 The covering radius of extremal self-dual code D11 and its application
abstract
D11, constructed by Conway and Sloane, is an extremal self-dual [56,28,12]-code with weight enumerator 1+8190y/sup 12/+622314y/sup 16/+11699688y/sup 20/+... . We find that the covering radius of D11 is 10. This shows that the inequality R(C/sub 56/)/spl les/10 cannot be improved any more, where R(C/sub 56/) is the covering radius of any extremal doubly even [56,28,12]-code C/sub 56/ and we use it to get ten new [58,29,10]-codes.
Han-Ping Tsai
 IEEE Trans. Inf. Theory1
1992 Existence of certain extremal self-dual codes
abstract
Two new singly-even extremal self-dual codes are given. These are a (42, 21, 8)-code and a (58, 29, 10)-code.>
Han-Ping Tsai
 IEEE Trans. Inf. Theory1
1992 Existence of some extremal self-dual codes
abstract
Two new singly-even extremal, self-dual codes are constructed: a (52,26,10) code and a (54,27,10) code.>
Han-Ping Tsai
 IEEE Trans. Inf. Theory1