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

Minoru Ando

dblp:85/1423 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1985
—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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › source coding › scalable source coding
multiresolution source coding
0.011985
A unique ranking of multilevel sequences and its application to source coding · IEEE Trans. Inf. Theory 1985
Coding theory
source coding
0.011985
A unique ranking of multilevel sequences and its application to source coding · IEEE Trans. Inf. Theory 1985
Coding theory › source coding
universal coding
0.011985
A unique ranking of multilevel sequences and its application to source coding · IEEE Trans. Inf. Theory 1985

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

pascal triangle · 0.0enumeration algorithm · 0.0
YearPublicationVenuePosition
1985 A unique ranking of multilevel sequences and its application to source coding
abstract
A new simple algorithm for unique ranking ofq-ary sequences is presented, using a general triangle (a triangular array of integers) that includes the well-known Pascal triangle as a special case. Applying the algorithm gives a new multilevel source coding scheme for which the prefix is the Lee weight and the suffix is the ranking number. A detailed analysis of the asymptotic performance shows that the new scheme is weighted universal. The inverse enumeration algorithm for decoding is also presented, and the complexity of the algorithm increases linearly in proportion to the length of source sequences.
Hatsukazu Tanaka, Minoru Ando, Alberto Leon-Garcia
IEEE Trans. Inf. Theory2