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

Peter J.-S. Shiue

dblp:25/518 · also Peter Jau-Shyong Shiue, Peter Shiue · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2007
0000-0002-1832-9002ORCID · verified

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

Theory of computation · 2

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

TopicWeightPapersLastEvidence papers
Coding theory › sequences
complementary sequences
0.011999
On Aperiodic and Periodic Complementary Binary Sequences · IEEE Trans. Inf. Theory 1999

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

recursive construction · 0.0
YearPublicationVenuePosition
2007 The Sheffer group and the Riordan group
Tian-Xiao He, Leetsch C. Hsu, Peter J.-S. Shiue
Discret. Appl. Math.3
1999 On Aperiodic and Periodic Complementary Binary Sequences
abstract
We give direct and recursive constructions for aperiodic and periodic complementary sequences. Using these constructions, many missing entries in the table of Bomer and Antweiler (1990) can be filled.
Keqin Feng, Peter J.-S. Shiue, Qing Xiang
IEEE Trans. Inf. Theory2